No article text was recorded for this version.
convergence-robustness trade-off
Version 1 of 129 papers43 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Robustness of accelerated first-order algorithms for strongly convex optimization problems
- Blog: Tradeoffs Between Convergence Rate and Noise Amplification for Momentum-Based Accelerated Optimization Algorithms
- Blog: Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- Blog: Stochastic Differential Equations for Modeling First Order Optimization Methods
- Blog: Entropic risk-averse generalized momentum methods
- Blog: Accelerated gradient methods with biased gradient estimates: Risk sensitivity, high-probability guarantees, and large deviation bounds
- Blog: Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems
- Blog: On Acceleration for Convex Composite Minimization with Noise-Corrupted Gradients and Approximate Proximal Mapping
- Blog: Input-Output Performance of Linear-Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems
- Blog: Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
- Blog: Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games
- Blog: Novel iteration schemes for the Cluster Variation Method
- Blog: Algorithms for Independent Components Analysis and Higher Order Statistics
- Blog: Robust Accelerated Primal-Dual Methods for Computing Saddle Points
- Blog: Momentum-Based Variance Reduction in Non-Convex SGD
- Blog: Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights
- Blog: The Cross-Entropy Method Optimizes for Quantiles
- Blog: Minimax Iterative Dynamic Game: Application to Nonlinear Robot Control Tasks
- Blog: Universal intermediate gradient method for convex problems with inexact oracle
- Blog: On the Convergence of A Family of Robust Losses for Stochastic Gradient Descent
- Blog: On the Accelerated Noise-Tolerant Power Method
- Blog: Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance
- Blog: Two Improved Normalized Subband Adaptive Filter Algorithms with Good Robustness Against Impulsive Interferences
- Blog: Adaptively Perturbed Mirror Descent for Learning in Games
- Blog: Analysis of Gradient Descent With Varying Step Sizes Using Integral Quadratic Constraints
- Blog: Corner Gradient Descent
- Blog: Reproducibility in Optimization: Theoretical Framework and Limits
- Blog: Evolution Strategies with Additive Noise: A Convergence Rate Lower Bound
- Blog: Sifting through the noise: Universal first-order methods for stochastic variational inequalities
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_convergence_robustness_trade_off_2649beb8,
title = {convergence-robustness trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convergence-robustness-trade-off/rdr_2649beb8b3a445d7a13b193c6f5bd497},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_convergence_robustness_trade_off_2649beb8_v1,
title = {convergence-robustness trade-off},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convergence-robustness-trade-off/rdr_2649beb8b3a445d7a13b193c6f5bd497/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}