Image de couverture de livre

Data-Dependent Regret Bounds for Constrained MABs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Genalti, Gianmarco, Stradi, Francesco Emanuele, Castiglioni, Matteo, Marchesi, Alberto, Gatti, Nicola
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

Truly Adapting to Adversarial Constraints in Constrained MABs
par: Stradi, Francesco Emanuele, et autres
Publié: (2026)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
par: Germano, Jacopo, et autres
Publié: (2023)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Replicable Constrained Bandits
par: Bollini, Matteo, et autres
Publié: (2026)

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
par: Stradi, Francesco Emanuele, et autres
Publié: (2025)

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Learning Adversarial MDPs with Stochastic Hard Constraints
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
par: Kalupahana, Kalana, et autres
Publié: (2026)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Markov Persuasion Processes: Learning to Persuade from Scratch
par: Bacchiocchi, Francesco, et autres
Publié: (2024)

Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
par: Stradi, Francesco Emanuele, et autres
Publié: (2025)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
par: Bacchiocchi, Francesco, et autres
Publié: (2025)

Multi-Armed Bandits With Best-Action Queries
par: Bacchiocchi, Francesco, et autres
Publié: (2026)

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
par: Genalti, Gianmarco, et autres
Publié: (2023)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
par: Genalti, Gianmarco, et autres
Publié: (2025)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
par: Genalti, Gianmarco, et autres
Publié: (2024)

Learning Optimal Contracts: How to Exploit Small Action Spaces
par: Bacchiocchi, Francesco, et autres
Publié: (2023)

Regret Minimization in Bilateral Trade With Perturbed Markets
par: Lunghi, Anna, et autres
Publié: (2026)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
par: Lunghi, Anna, et autres
Publié: (2025)

Autoregressive Bandits
par: Bacchiocchi, Francesco, et autres
Publié: (2022)

The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
par: Castiglioni, Matteo, et autres
Publié: (2026)

Constrained Phi-Equilibria
par: Bernasconi, Martino, et autres
Publié: (2023)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
par: Bernasconi, Martino, et autres
Publié: (2024)

Online Packet Scheduling with Deadlines and Learning
par: Genalti, Gianmarco, et autres
Publié: (2026)

Online Resource Allocation With General Constraints
par: Chiefari, Eleonora Fidelia, et autres
Publié: (2026)

A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
par: Bollini, Matteo, et autres
Publié: (2026)

Safe Online Bid Optimization with Return on Investment and Budget Constraints
par: Castiglioni, Matteo, et autres
Publié: (2022)

The Sample Complexity of Stackelberg Games
par: Bacchiocchi, Francesco, et autres
Publié: (2024)

Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
par: Bollini, Matteo, et autres
Publié: (2024)

Online Bayesian Persuasion Without a Clue
par: Bacchiocchi, Francesco, et autres
Publié: (2024)

Regret-Minimizing Contracts: Agency Under Uncertainty
par: Bernasconi, Martino, et autres
Publié: (2024)

Contract Design Under Approximate Best Responses
par: Bacchiocchi, Francesco, et autres
Publié: (2025)

No-Regret Learning in Bilateral Trade via Global Budget Balance
par: Bernasconi, Martino, et autres
Publié: (2023)

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
par: Jamshidi, Fateme, et autres
Publié: (2025)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
par: Di Gennaro, Federico, et autres
Publié: (2025)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
par: He, Jiafan, et autres
Publié: (2025)

Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs
par: Chen, Shulun, et autres
Publié: (2025)

uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs
par: Chen, Yu, et autres
Publié: (2024)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
par: Supantha, Subhamon, et autres
Publié: (2025)