Copertina

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vernimmen, Pierre, Glineur, François
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
di: Vernimmen, Pierre, et al.
Pubblicazione: (2025)

PEPit: computer-assisted worst-case analyses of first-order optimization methods in Python
di: Goujaud, Baptiste, et al.
Pubblicazione: (2022)

Exact Convergence rate of the subgradient method by using Polyak step size
di: Zamani, Moslem, et al.
Pubblicazione: (2024)

Dual first-order methods for efficient computation of convex hull prices
di: Tanji, Sofiane, et al.
Pubblicazione: (2025)

Snacks: a fast large-scale kernel SVM solver
di: Tanji, Sofiane, et al.
Pubblicazione: (2023)

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
di: Jiang, Liwei, et al.
Pubblicazione: (2026)

A simple uniformly optimal method without line search for convex optimization
di: Li, Tianjiao, et al.
Pubblicazione: (2023)

Proximal gradient methods with inexact oracle of degree q for composite optimization
di: Nabou, Yassine, et al.
Pubblicazione: (2024)

Nesterov acceleration in benignly non-convex landscapes
di: Gupta, Kanan, et al.
Pubblicazione: (2024)

Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
di: Le, Tam
Pubblicazione: (2025)

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
di: Van Dessel, Guillaume, et al.
Pubblicazione: (2025)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
di: Cutkosky, Ashok, et al.
Pubblicazione: (2023)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
di: Liu, Wei, et al.
Pubblicazione: (2025)

Presolve techniques for quasi-convex chance constraints with finite-support low-dimensional uncertainty
di: Van Dessel, Guillaume, et al.
Pubblicazione: (2025)

Random Scaling and Momentum for Non-smooth Non-convex Optimization
di: Zhang, Qinzi, et al.
Pubblicazione: (2024)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
di: Alecsa, Cristian Daniel
Pubblicazione: (2021)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
di: Rotaru, Teodor, et al.
Pubblicazione: (2024)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
di: Wang, Ruyu, et al.
Pubblicazione: (2023)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
di: Chen, Xiang, et al.
Pubblicazione: (2024)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
di: Lan, Guanghui, et al.
Pubblicazione: (2024)

Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction
di: Horenko, Illia, et al.
Pubblicazione: (2023)

Non-geodesically-convex optimization in the Wasserstein space
di: Luu, Hoang Phuc Hau, et al.
Pubblicazione: (2024)

Learning based convex approximation for constrained parametric optimization
di: Liu, Kang, et al.
Pubblicazione: (2025)

Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
di: Zhang, Qi, et al.
Pubblicazione: (2024)

An accelerated proximal bundle method for convex optimization
di: Liao, Feng-Yi, et al.
Pubblicazione: (2025)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

Stochastic set-valued optimization and its application to robust learning
di: Giovannelli, Tommaso, et al.
Pubblicazione: (2026)

A constrained optimization approach to improve robustness of neural networks
di: Zhao, Shudian, et al.
Pubblicazione: (2024)

Extended convexity and smoothness and their applications in deep learning
di: Qi, Binchuan, et al.
Pubblicazione: (2024)

A minimax optimal control approach for robust neural ODEs
di: Cipriani, Cristina, et al.
Pubblicazione: (2023)

LancBiO: dynamic Lanczos-aided bilevel optimization via Krylov subspace
di: Yang, Yan, et al.
Pubblicazione: (2024)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
di: Bertoncini, Jeremy, et al.
Pubblicazione: (2025)

Decision-calibrated prediction sets for robust power system operations
di: Stratigakos, Akylas, et al.
Pubblicazione: (2026)

Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration
di: Guo, Luyao, et al.
Pubblicazione: (2026)

BONSAI: Structure-exploiting robust Bayesian optimization for networked black-box systems under uncertainty
di: Kudva, Akshay, et al.
Pubblicazione: (2025)

Convergence rates of stochastic gradient method with independent sequences of step-size and momentum weight
di: Hwang, Wen-Liang
Pubblicazione: (2024)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
di: Lauga, Guillaume
Pubblicazione: (2026)

A stochastic gradient method for trilevel optimization
di: Giovannelli, Tommaso, et al.
Pubblicazione: (2025)

Non-convex entropic mean-field optimization via Best Response flow
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2025)

Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity
di: Li, Bowen, et al.
Pubblicazione: (2023)