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

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

Hesameddin Mohammadi
Meisam Razaviyayn
M. Jovanović
ArXivPDFHTML

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

5 / 5 papers shown
Title
Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
Hesameddin Mohammadi
Meisam Razaviyayn
Mihailo R. Jovanović
31
7
0
24 Sep 2022
Exact Formulas for Finite-Time Estimation Errors of Decentralized Temporal Difference Learning with Linear Function Approximation
Exact Formulas for Finite-Time Estimation Errors of Decentralized Temporal Difference Learning with Linear Function Approximation
Xing-ming Guo
Bin Hu
13
2
0
20 Apr 2022
Convex Programs and Lyapunov Functions for Reinforcement Learning: A Unified Perspective on the Analysis of Value-Based Methods
Convex Programs and Lyapunov Functions for Reinforcement Learning: A Unified Perspective on the Analysis of Value-Based Methods
Xing-ming Guo
Bin Hu
OffRL
27
3
0
14 Feb 2022
BiConMP: A Nonlinear Model Predictive Control Framework for Whole Body Motion Planning
BiConMP: A Nonlinear Model Predictive Control Framework for Whole Body Motion Planning
Avadesh Meduri
Paarth Shah
Julian Viereck
Majid Khadiv
Ioannis Havoutis
Ludovic Righetti
33
73
0
19 Jan 2022
Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I
Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I
Sandeep Kumar
K. Rajawat
Daniel P. Palomar
19
4
0
21 Jul 2019