:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Hermant, Julien, Renaud, Marien, Aujol, Jean-François, Dossal, Charles, Rondepierre, Aude
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2410.07870
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Study of the behaviour of Nesterov Accelerated Gradient in a non convex setting: the strongly quasar convex case
por: Hermant, Julien, et al.
Publicado: (2024)

Continuized Nesterov Acceleration for Non-Convex Optimization
por: Hermant, Julien, et al.
Publicado: (2025)

Continuized Nesterov Momentum Achieves the $O(\varepsilon^{-7/4})$ Complexity without Additional Mechanisms
por: Hermant, Julien, et al.
Publicado: (2026)

Strong Convergence of FISTA Iterates under H{ö}lderian and Quadratic Growth Conditions
por: Aujol, Jean-François, et al.
Publicado: (2024)

Heavy Ball Momentum for Non-Strongly Convex Optimization
por: Aujol, Jean-François, et al.
Publicado: (2024)

Acceleration for Polyak-Łojasiewicz Functions with a Gradient Aiming Condition
por: Hermant, Julien
Publicado: (2026)

Stochastic Adaptive Gradient Descent Without Descent
por: Aujol, Jean-François, et al.
Publicado: (2025)

Projected Block Coordinate Descent for sparse spike estimation
por: Bénard, Pierre-Jean, et al.
Publicado: (2024)

Optimization with First Order Algorithms
por: Dossal, Charles, et al.
Publicado: (2024)

On the Moreau envelope properties of weakly convex functions
por: Renaud, Marien, et al.
Publicado: (2025)

From sparse recovery to plug-and-play priors, understanding trade-offs for stable recovery with generalized projected gradient descent
por: Joundi, Ali, et al.
Publicado: (2025)

A note on the convergence of RED algorithms under minimal hypotheses and open questions
por: Traonmilin, Yann, et al.
Publicado: (2026)

Optimality of a refraction strategy in the optimal dividends problem with absolutely continuous controls subject to Parisian ruin
por: Locas, Félix, et al.
Publicado: (2023)

SGD with memory: fundamental properties and stochastic acceleration
por: Yarotsky, Dmitry, et al.
Publicado: (2024)

Demystifying SGD with Doubly Stochastic Gradients
por: Kim, Kyurae, et al.
Publicado: (2024)

Convergence Analysis of a Proximal Stochastic Denoising Regularization Algorithm
por: Renaud, Marien, et al.
Publicado: (2024)

Convergence of SGD with momentum in the nonconvex case: A time window-based analysis
por: Qiu, Junwen, et al.
Publicado: (2024)

Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution
por: Orvieto, Antonio, et al.
Publicado: (2022)

From PowerSGD to PowerSGD+: Low-Rank Gradient Compression for Distributed Optimization with Convergence Guarantees
por: Xie, Shengping, et al.
Publicado: (2025)

From Gradient Clipping to Normalization for Heavy Tailed SGD
por: Hübler, Florian, et al.
Publicado: (2024)

AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent
por: Surjanovic, Nikola, et al.
Publicado: (2025)

GPU-accelerated dynamic nonlinear optimization with ExaModels and MadNLP
por: Pacaud, François, et al.
Publicado: (2024)

Optimality of a barrier strategy in a spectrally negative Lévy model with a level-dependent intensity of bankruptcy
por: Mata, Dante, et al.
Publicado: (2024)

From Inexact Gradients to Byzantine Robustness: Acceleration and Optimization under Similarity
por: Gaucher, Renaud, et al.
Publicado: (2026)

On the Set of Possible Minimizers of a Sum of Convex Functions
por: Zamani, Moslem, et al.
Publicado: (2024)

Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration
por: Sun, Tao, et al.
Publicado: (2024)

SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization
por: Dahan, Tehila, et al.
Publicado: (2023)

Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms
por: Mohammadi, Hesameddin, et al.
Publicado: (2022)

Making SGD Parameter-Free
por: Carmon, Yair, et al.
Publicado: (2022)

On the Trajectories of SGD Without Replacement
por: Beneventano, Pierfrancesco
Publicado: (2023)

Local SGD and Federated Averaging Through the Lens of Time Complexity
por: Fradin, Adrien, et al.
Publicado: (2025)

Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
por: Garrigos, Guillaume, et al.
Publicado: (2025)

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
por: Tyurin, Alexander, et al.
Publicado: (2024)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
por: Zhang, Huiling, et al.
Publicado: (2023)

Dimension-adapted Momentum Outscales SGD
por: Ferbach, Damien, et al.
Publicado: (2025)

Heavy-Tail Phenomenon in Decentralized SGD
por: Gurbuzbalaban, Mert, et al.
Publicado: (2022)

Convergence and Inference of Stream SGD, with Applications to Queueing Systems and Inventory Control
por: Li, Xiang, et al.
Publicado: (2023)

Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness
por: Lobanov, Aleksandr, et al.
Publicado: (2026)

Provably Accelerated Imaging with Restarted Inertia and Score-based Image Priors
por: Renaud, Marien, et al.
Publicado: (2025)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
por: Vernimmen, Pierre, et al.
Publicado: (2025)