mlsanityData to 7 Oct 2026

An Element-wise RSAV Algorithm for Unconstrained Optimization Problems

arXiv 2309.04013 ↗First posted 7 Sep 2023math.OC cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We present a novel optimization algorithm, element-wise relaxed scalar auxiliary variable (E-RSAV), that satisfies an unconditional energy dissipation law and exhibits improved alignment between the modified and the original energy. Our algorithm features rigorous proofs of linear convergence in the convex setting. Furthermore, we present a simple accelerated algorithm that improves the linear convergence rate to super-linear in the univariate case. We also propose an adaptive version of E-RSAV with Steffensen step size. We validate the robustness and fast convergence of our algorithm through ample numerical experiments.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 37 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

7 of 37 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2021Convex optimizationcited by 2,479
  4. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
  5. 2020AEGD: Adaptive Gradient Descent with Energycited by 6
  6. 2022Stochastic Steffensen methodcited by 2
  7. 2023An efficient and robust SAV based algorithm for discrete gradient systems arising from optimizationscited by 1

Built on by

Not cited yet.