# On the Interplay between Acceleration and Identification for the Proximal Gradient algorithm

arXiv: https://arxiv.org/abs/1909.08944 · HTML: https://mlsanity.com/paper/1909.08944/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Sep 2019.

## Built on by (most cited first, 1 of 1)

- [Complexity of Classical Acceleration for ℓ1-Regularized PageRank](https://mlsanity.com/paper/2602.21138/) (2026)

## Abstract (arXiv)

In this paper, we study the interplay between acceleration and structure identification for the proximal gradient algorithm. We report and analyze several cases where this interplay has negative effects on the algorithm behavior (iterates oscillation, loss of structure, etc.). We present a generic method that tames acceleration when structure identification may be at stake; it benefits from a convergence rate that matches the one of the accelerated proximal gradient under some qualifying condition. We show empirically that the proposed method is much more stable in terms of subspace identification compared to the accelerated proximal gradient method while keeping a similar functional decrease.