:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xie, Yan-Feng, Zhang, Yu-Jie, Zhao, Peng, Zhou, Zhi-Hua
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2602.08372
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)

Gradient-Variation Online Learning under Generalized Smoothness
by: Xie, Yan-Feng, et al.
Published: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
by: Ahn, Kwangjun, et al.
Published: (2024)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
by: Yan, Yu-Hu, et al.
Published: (2025)

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
by: Yan, Yu-Hu, et al.
Published: (2023)

Adam-SHANG: A Convergent Adam-Type Method for Stochastic Smooth Convex Optimization
by: Yu, Yaxin, et al.
Published: (2026)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
by: Wang, Yi-Han, et al.
Published: (2025)

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

Provable Adaptivity of Adam under Non-uniform Smoothness
by: Wang, Bohan, et al.
Published: (2022)

Dynamic Controlled Variables Based Dynamic Self-Optimizing Control
by: Zhou, Chenchen, et al.
Published: (2026)

Implicit Bias of AdamW: $\ell_\infty$ Norm Constrained Optimization
by: Xie, Shuo, et al.
Published: (2024)

On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
by: Gong, Xiaochuan, et al.
Published: (2025)

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

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
by: Yu, Yaxin, et al.
Published: (2026)

Adam Converges Without Any Modification On Update Rules
by: Zhang, Yushun, et al.
Published: (2026)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization
by: Huang, Feihu, et al.
Published: (2026)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Regret of exploratory policy improvement and $q$-learning
by: Tang, Wenpin, et al.
Published: (2024)

Risk-Sensitive Q-Learning in Continuous Time with Application to Dynamic Portfolio Selection
by: Xie, Chuhan
Published: (2025)

From Adam to Adam-Like Lagrangians: Second-Order Nonlocal Dynamics
by: Heredia, Carlos
Published: (2026)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions
by: Hong, Yusu, et al.
Published: (2024)

On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond
by: Wang, Bohan, et al.
Published: (2024)

Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices
by: Zhao, Pengxiang, et al.
Published: (2024)

Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)

No-Regret Gaussian Process Optimization of Time-Varying Functions
by: Mauduit, Eliabelle, et al.
Published: (2025)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
by: Zhao, Yuheng, et al.
Published: (2025)

Dynamic Range Reduction via Branch-and-Bound
by: Gerlach, Thore, et al.
Published: (2024)

Stochastic Gradient Langevin Dynamics with Variance Reduction
by: Huang, Zhishen, et al.
Published: (2021)

Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis
by: Zhao, Yuheng, et al.
Published: (2026)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Adam on Local Time: Addressing Nonstationarity in RL with Relative Adam Timesteps
by: Ellis, Benjamin, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Optimizer-Induced Mode Connectivity: From AdamW to Muon
by: Zhang, Fangzhao, et al.
Published: (2026)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
by: Yu, Kihyun, et al.
Published: (2024)