Cover Image

Efficient Swap Regret Minimization in Combinatorial Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kontogiannis, Andreas, Pollatos, Vasilis, Mertikopoulos, Panayotis, Panageas, Ioannis
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
by: Kontogiannis, Andreas, et al.
Published: (2025)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Tree-based Focused Web Crawling with Reinforcement Learning
by: Kontogiannis, Andreas, et al.
Published: (2021)

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

Contractive kinetic Langevin samplers beyond global Lipschitz continuity
by: Lytras, Iosif, et al.
Published: (2025)

On Corruption-Robustness in Performative Reinforcement Learning
by: Pollatos, Vasilis, et al.
Published: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

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

Tamed Langevin sampling under weaker conditions
by: Lytras, Iosif, et al.
Published: (2024)

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

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

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
by: Zhang, Raymond, et al.
Published: (2024)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
by: Huang, Zhiming, et al.
Published: (2026)

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

Nested replicator dynamics, nested logit choice, and similarity-based learning
by: Mertikopoulos, Panayotis, et al.
Published: (2024)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
by: Chauhan, Rohan, et al.
Published: (2025)

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
by: Feng, Qing, et al.
Published: (2024)

Oracle-Efficient Combinatorial Semi-Bandits
by: Kim, Jung-hun, et al.
Published: (2025)

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

Testable and Actionable Calibration for Full Swap Regret
by: Bairaktari, Konstantina, et al.
Published: (2026)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

Sparsity-Based Interpolation of External, Internal and Swap Regret
by: Lu, Zhou, et al.
Published: (2025)

A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
by: Legacci, Davide, et al.
Published: (2024)

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

Combinatorial Rising Bandits
by: Song, Seockbean, et al.
Published: (2024)

Combinatorial Logistic Bandits
by: Liu, Xutong, et al.
Published: (2024)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
by: Lu, Jiuyao, et al.
Published: (2025)

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

On the Computational Complexity of Performative Prediction
by: Anagnostides, Ioannis, et al.
Published: (2026)

Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
by: Liu, Xutong, et al.
Published: (2022)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)

Forecasting for Swap Regret for All Downstream Agents
by: Roth, Aaron, et al.
Published: (2024)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)