Cover Image

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Lijun, Yang, Wenhao, Wang, Guanghui, Jiang, Wei, Zhou, Zhi-Hua
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

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

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
by: Yang, Wenhao, et al.
Published: (2025)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Universal Online Convex Optimization with $1$ Projection per Round
by: Yang, Wenhao, et al.
Published: (2024)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)

Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
by: Jiang, Wei, et al.
Published: (2024)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)

Comparator-Adaptive $Φ$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games
by: Hait, Soumita, et al.
Published: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
by: Hu, Lunjia, et al.
Published: (2026)

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
by: Wan, Yuanyu, et al.
Published: (2024)

Adaptive Regret for Bandits Made Possible: Two Queries Suffice
by: Lu, Zhou, et al.
Published: (2024)

Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification
by: Qin, Chao, et al.
Published: (2024)

Taming Latency and Bandwidth: A Theoretical Framework and Adaptive Algorithm for Communication-Constrained Training
by: Lu, Rongwei, et al.
Published: (2025)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction
by: Jiang, Wei, et al.
Published: (2024)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

Improved Dynamic Regret for Online Frank-Wolfe
by: Wan, Yuanyu, et al.
Published: (2023)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

Hierarchical Deep Counterfactual Regret Minimization
by: Chen, Jiayu, et al.
Published: (2023)

Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion
by: Zhang, Lijun, et al.
Published: (2015)

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

Communication-Aware Reinforcement Learning for Cooperative Adaptive Cruise Control
by: Jiang, Sicong, et al.
Published: (2024)

Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret
by: Li, Jingyang, et al.
Published: (2023)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)

Improved Analysis for Sign-based Methods with Momentum Updates
by: Jiang, Wei, et al.
Published: (2025)

Scaling the Convex Barrier with Sparse Dual Algorithms
by: De Palma, Alessandro, et al.
Published: (2021)

Logarithmic Neyman Regret for Adaptive Estimation of the Average Treatment Effect
by: Neopane, Ojash, et al.
Published: (2024)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Invariance-Based Dynamic Regret Minimization
by: Lazzaretto, Margherita, et al.
Published: (2026)

The Fallacy of Minimizing Cumulative Regret in the Sequential Task Setting
by: Xu, Ziping, et al.
Published: (2024)

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
by: Jiang, Wei, et al.
Published: (2024)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)

Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond
by: Yu, Dingzhi, et al.
Published: (2024)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)