On the use of Anderson acceleration in hierarchical control

2021-12-08 · Xuan-Huy Pham, Mazen Alamir, François Bonne, Patrick Bonnay

This paper investigates the use of fixed-point Anderson acceleration method (AA) to a recently proposed hierarchical control framework. Due to its model-free property, the AA-based resulting hierarchical framework becomes more generic since no mathematical model of the subsystems at the lower layer is required at the upper coordinator layer. Numerical results are proposed to evaluate the effectiveness of this approach. The paper also presents a modified version of the original hierarchical approach that involves the AA in hierarchical control.

📄 PDF Abstract BibTeX arXiv:2112.04299

Code (0)

등록된 구현이 없습니다.

Anderson Acceleration of Proximal Gradient Methods

2019-10-18 · ICML 2020 1 · Vien V. Mai, Mikael Johansson

Anderson acceleration is a well-established and simple technique for speeding up fixed-point computations with countless applications. Previous studies of Anderson acceleration in optimization have only been able to prov…

Regularized Anderson Acceleration for Off-Policy Deep Reinforcement Learning

2019-09-07 · NeurIPS 2019 12 · Wenjie Shi, Shiji Song, Hui Wu, Ya-Chu Hsu 외

Model-free deep reinforcement learning (RL) algorithms have been widely used for a range of complex control tasks. However, slow convergence and sample inefficiency remain challenging problems in RL, especially when hand…

Deep Reinforcement Learning MuJoCo reinforcement-learning Reinforcement Learning+1

A Fast Anderson-Chebyshev Acceleration for Nonlinear Optimization

2018-09-07 · Zhize Li, Jian Li

Anderson acceleration (or Anderson mixing) is an efficient acceleration method for fixed point iterations $x_{t+1}=G(x_t)$, e.g., gradient descent can be viewed as iteratively applying the operation $G(x) \triangleq x-\a…

subspace methods

Anderson acceleration for iteratively reweighted $\ell_1$ algorithm

2024-03-12 · Kexin Li

Iteratively reweighted L1 (IRL1) algorithm is a common algorithm for solving sparse optimization problems with nonconvex and nonsmooth regularization. The development of its acceleration algorithm, often employing Nester…

Anderson Acceleration for Reinforcement Learning

2018-09-25 · Matthieu Geist, Bruno Scherrer

Anderson acceleration is an old and simple method for accelerating the computation of a fixed point. However, as far as we know and quite surprisingly, it has never been applied to dynamic programming or reinforcement le…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)