arXiv Machine Learning July 30, 2026 By Vaneet Aggarwal

Parameter-Free Dynamic Regret for Online Convex Optimization under Heavy-Tailed Noise

Read the original on arXiv Machine Learning →

arXiv:2607. 27073v1 Announce Type: new Abstract: We study online convex optimization (OCO) in non-stationary environments under heavy-tailed noise, where the stochastic gradient oracle admits only a finite $p$-th central moment for some $p \in (1, 2]$.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 21

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

arXiv:2607. 17607v1 Announce Type: new Abstract: We study whether stochastic nonconvex optimization can be reduced to ordinary static regret minimization in online convex optimization in a black-box manner.

By Haichen Hu, David Simchi-Levi

arXiv Machine Learning

Jun 9

Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization

arXiv:2606. 08028v1 Announce Type: new Abstract: We study high-probability regret bounds for online convex optimization (OCO) with strongly convex losses and establish three results that resolve open questions at the intersection of noise adaptivity, feedback structure, and constraint satisfaction.

By Wentao Zhang, Yutong Zhang, Wentao Mo

reinforcement-learning

arXiv Machine Learning

Aug 10

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory

arXiv:2602. 06902v3 Announce Type: replace Abstract: In this paper, we study dynamic regret in unconstrained online convex optimization (OCO) with movement costs.

By Hao Qiu, Andrew Jacobsen, Emmanuel Esposito, Mengxiao Zhang

arXiv Machine Learning

Jul 13

Logarithmic High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback

arXiv:2603. 25029v4 Announce Type: replace Abstract: We study online convex optimization (OCO) with two-point bandit feedback against a non-anticipating adaptive adversary.

By Haishan Ye

reinforcement-learning safety

arXiv Machine Learning

Jul 15

A Geometric Approach to Constrained Online Learning

arXiv:2605. 21107v2 Announce Type: replace Abstract: We study constrained online convex optimization with adversarial time-varying constraints.

By Dhruv Sarkar, Abhishek Sinha

safety

arXiv Machine Learning

Jun 2

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad

arXiv:2605. 18694v2 Announce Type: replace-cross Abstract: Many tasks in modern machine learning are observed to involve heavy-tailed gradient noise during the optimization process.

By Zijian Liu

Related stories

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory

Logarithmic High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback

A Geometric Approach to Constrained Online Learning

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad