Image de couverture de livre

Comparator-Adaptive $Φ$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hait, Soumita, Li, Ping, Luo, Haipeng, Zhang, Mengxiao
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Alternating Regret for Online Convex Optimization
par: Hait, Soumita, et autres
Publié: (2025)

Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
par: Hait, Soumita, et autres
Publié: (2026)

Contextual Multinomial Logit Bandits with General Value Functions
par: Zhang, Mengxiao, et autres
Publié: (2024)

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
par: Zhang, Mengxiao, et autres
Publié: (2024)

On Tractable $Φ$-Equilibria in Non-Concave Games
par: Cai, Yang, et autres
Publié: (2024)

Contextual Linear Bandits with Delay as Payoff
par: Zhang, Mengxiao, et autres
Publié: (2025)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
par: Cai, Yang, et autres
Publié: (2023)

Efficient Contextual Bandits with Uninformed Feedback Graphs
par: Zhang, Mengxiao, et autres
Publié: (2024)

Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedback
par: Zhang, Mengxiao, et autres
Publié: (2026)

Provably Efficient Interactive-Grounded Learning with Personalized Reward
par: Zhang, Mengxiao, et autres
Publié: (2024)

Improved Bounds for Swap Multicalibration and Swap Omniprediction
par: Luo, Haipeng, et autres
Publié: (2025)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
par: Liu, Junyan, et autres
Publié: (2026)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
par: Qiu, Hao, et autres
Publié: (2026)

A Short Note on a Variant of the Squint Algorithm
par: Luo, Haipeng
Publié: (2026)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
par: Qiu, Hao, et autres
Publié: (2026)

Improved Regret Bounds for Bandits with Expert Advice
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2024)

Improved Kernel Alignment Regret Bound for Online Kernel Learning
par: Li, Junfan, et autres
Publié: (2022)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
par: Cassel, Asaf, et autres
Publié: (2024)

One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
par: Bhat, Amith, et autres
Publié: (2026)

A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions
par: Li, Junfan, et autres
Publié: (2025)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
par: Lee, Junghyun, et autres
Publié: (2023)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
par: Zhang, Lijun, et autres
Publié: (2025)

Swap Regret Minimization Through Response-Based Approachability
par: Anagnostides, Ioannis, et autres
Publié: (2026)

On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise
par: Wang, Jingyi, et autres
Publié: (2024)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
par: Cai, Yang, et autres
Publié: (2025)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
par: Lucier, Brendan, et autres
Publié: (2023)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
par: Iwazaki, Shogo
Publié: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
par: Réveillard, William, et autres
Publié: (2025)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
par: Liu, Junyan, et autres
Publié: (2025)

Simultaneous Swap Regret Minimization via KL-Calibration
par: Luo, Haipeng, et autres
Publié: (2025)

Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games
par: Gao, Minbo, et autres
Publié: (2023)

Improved Regret Bounds for Online Fair Division with Bandit Learning
par: Schiffer, Benjamin, et autres
Publié: (2025)

Revisiting Generative Policies: A Simpler Reinforcement Learning Algorithmic Perspective
par: Zhang, Jinouwen, et autres
Publié: (2024)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
par: Anagnostides, Ioannis, et autres
Publié: (2024)

Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms
par: Xu, Mengfan, et autres
Publié: (2020)

Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
par: Nguyen-Tang, Thanh, et autres
Publié: (2024)

Quality check of a sample partition using multinomial distribution
par: Modak, Soumita
Publié: (2024)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
par: Tajdini, Artin, et autres
Publié: (2025)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
par: Moradipari, Ahmadreza, et autres
Publié: (2023)