:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Choudhury, Sayantan, Cheng, Xiaoran, Takáč, Martin, Na, Sen, Kolar, Mladen
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Machine Learning
Accesso online:	https://arxiv.org/abs/2605.06884
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters
di: Yukhimchuk, Alexander, et al.
Pubblicazione: (2026)

Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models
di: Fang, Yuchen, et al.
Pubblicazione: (2024)

Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems
di: Fang, Yuchen, et al.
Pubblicazione: (2022)

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
di: Chezhegov, Savelii, et al.
Pubblicazione: (2024)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
di: Iiduka, Hideaki
Pubblicazione: (2026)

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
di: Wang, Haoxuan, et al.
Pubblicazione: (2026)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
di: Gorbunov, Eduard, et al.
Pubblicazione: (2024)

High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise
di: Fang, Yuchen, et al.
Pubblicazione: (2025)

Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad
di: Choudhury, Sayantan, et al.
Pubblicazione: (2024)

Beyond the Ideal: Analyzing the Inexact Muon Update
di: Shulgin, Egor, et al.
Pubblicazione: (2025)

Random-reshuffled SARAH does not need a full gradient computations
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2021)

Can SGD Handle Heavy-Tailed Noise?
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods
di: Lau, Tim Tsz-Kit, et al.
Pubblicazione: (2024)

(Accelerated) Noise-adaptive Stochastic Heavy-Ball Momentum
di: Dang, Anh, et al.
Pubblicazione: (2024)

Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models
di: Xie, Xingyu, et al.
Pubblicazione: (2022)

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
di: Choudhury, Sayantan, et al.
Pubblicazione: (2025)

Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
di: Agrawal, Shubhada, et al.
Pubblicazione: (2026)

Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networks
di: Liao, Fangshuo, et al.
Pubblicazione: (2023)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
di: Zhu, Tianxi, et al.
Pubblicazione: (2025)

Muon is Provably Faster with Momentum Variance Reduction
di: Qian, Xun, et al.
Pubblicazione: (2025)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
di: Wu, Yidong, et al.
Pubblicazione: (2026)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
di: Liu, Zijian
Pubblicazione: (2026)

Scale-Invariant Neural Network Optimization: Norm Geometry and Heavy-Tailed Noise
di: Zhang, Jiayu, et al.
Pubblicazione: (2026)

EMA-Nesterov: Stabilizing Nesterov's Lookahead for Accelerated Deep Learning Optimization
di: Yau, Chung-Yiu, et al.
Pubblicazione: (2026)

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods
di: Lau, Tim Tsz-Kit, et al.
Pubblicazione: (2024)

Adaptive Batch Size Schedules for Distributed Training of Language Models with Data and Model Parallelism
di: Lau, Tim Tsz-Kit, et al.
Pubblicazione: (2024)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
di: Gorbunov, Eduard, et al.
Pubblicazione: (2021)

Multiplayer Federated Learning: Reaching Equilibrium with Less Communication
di: Yoon, TaeHo, et al.
Pubblicazione: (2025)

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise
di: Yu, Dingzhi, et al.
Pubblicazione: (2026)

Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis
di: Chandak, Siddharth, et al.
Pubblicazione: (2026)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
di: Liu, Zijian, et al.
Pubblicazione: (2024)

Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2025)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
di: Sadiev, Abdurakhmon, et al.
Pubblicazione: (2025)

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
di: Gorbunov, Eduard, et al.
Pubblicazione: (2023)

Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning
di: Zhang, Dake, et al.
Pubblicazione: (2024)

Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise
di: Kanakeri, Vinay, et al.
Pubblicazione: (2025)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
di: Liu, Zijian
Pubblicazione: (2025)

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