Copertina

Alternating Regret for Online Convex Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hait, Soumita, Li, Ping, Luo, Haipeng, Zhang, Mengxiao
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
di: Hait, Soumita, et al.
Pubblicazione: (2026)

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
di: Zhang, Mengxiao, et al.
Pubblicazione: (2024)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
di: Qiu, Hao, et al.
Pubblicazione: (2025)

Contextual Multinomial Logit Bandits with General Value Functions
di: Zhang, Mengxiao, et al.
Pubblicazione: (2024)

Decentralized Online Convex Optimization with Unknown Feedback Delays
di: Qiu, Hao, et al.
Pubblicazione: (2026)

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

Contextual Linear Bandits with Delay as Payoff
di: Zhang, Mengxiao, et al.
Pubblicazione: (2025)

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

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

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

Efficient Contextual Bandits with Uninformed Feedback Graphs
di: Zhang, Mengxiao, et al.
Pubblicazione: (2024)

Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedback
di: Zhang, Mengxiao, et al.
Pubblicazione: (2026)

Provably Efficient Interactive-Grounded Learning with Personalized Reward
di: Zhang, Mengxiao, et al.
Pubblicazione: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

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

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

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
di: Ye, Haishan
Pubblicazione: (2026)

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

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

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
di: Jia, Tingkai, et al.
Pubblicazione: (2026)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
di: Liu, Junyan, et al.
Pubblicazione: (2026)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
di: Qiu, Hao, et al.
Pubblicazione: (2026)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
di: Liu, Xiufeng, et al.
Pubblicazione: (2026)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
di: Sahinoglu, Emre, et al.
Pubblicazione: (2025)

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
di: Pasteris, Stephen, et al.
Pubblicazione: (2024)

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
di: Qiu, Hao, et al.
Pubblicazione: (2026)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
di: Cassel, Asaf, et al.
Pubblicazione: (2024)

One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
di: Bhat, Amith, et al.
Pubblicazione: (2026)

Swap Regret Minimization Through Response-Based Approachability
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
di: Lucier, Brendan, et al.
Pubblicazione: (2023)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
di: Cai, Yang, et al.
Pubblicazione: (2025)

Simultaneous Swap Regret Minimization via KL-Calibration
di: Luo, Haipeng, et al.
Pubblicazione: (2025)

Unconstrained Robust Online Convex Optimization
di: Zhang, Jiujia, et al.
Pubblicazione: (2025)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
di: Oki, Taihei, et al.
Pubblicazione: (2026)

Breaking the $O(\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\sqrt{T})$ Static Regret in Constrained Online Convex Optimization
di: Balasundaram, Haricharan, et al.
Pubblicazione: (2026)

Quality check of a sample partition using multinomial distribution
di: Modak, Soumita
Pubblicazione: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
di: Chen, Sijia, et al.
Pubblicazione: (2023)

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