Picture for Hesameddin Mohammadi

Hesameddin Mohammadi

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms

Add code
Sep 24, 2022
Figure 1 for Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Figure 2 for Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Figure 3 for Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Figure 4 for Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Viaarxiv icon

Transient growth of accelerated first-order methods for strongly convex optimization problems

Add code
Mar 14, 2021
Figure 1 for Transient growth of accelerated first-order methods for strongly convex optimization problems
Figure 2 for Transient growth of accelerated first-order methods for strongly convex optimization problems
Figure 3 for Transient growth of accelerated first-order methods for strongly convex optimization problems
Figure 4 for Transient growth of accelerated first-order methods for strongly convex optimization problems
Viaarxiv icon

Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem

Add code
Dec 26, 2019
Figure 1 for Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem
Figure 2 for Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem
Figure 3 for Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem
Figure 4 for Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem
Viaarxiv icon

Robustness of accelerated first-order algorithms for strongly convex optimization problems

Add code
May 27, 2019
Figure 1 for Robustness of accelerated first-order algorithms for strongly convex optimization problems
Figure 2 for Robustness of accelerated first-order algorithms for strongly convex optimization problems
Figure 3 for Robustness of accelerated first-order algorithms for strongly convex optimization problems
Figure 4 for Robustness of accelerated first-order algorithms for strongly convex optimization problems
Viaarxiv icon