No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
Fuente:
arXiv
Saved in:
| Main Authors: | Stradi, Francesco Emanuele, Castiglioni, Matteo, Marchesi, Alberto, Gatti, Nicola, Kroer, Christian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning Adversarial MDPs with Stochastic Hard Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026)
by: Kalupahana, Kalana, et al.
Published: (2026)
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
Truly Adapting to Adversarial Constraints in Constrained MABs
by: Stradi, Francesco Emanuele, et al.
Published: (2026)
by: Stradi, Francesco Emanuele, et al.
Published: (2026)
Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)
by: Bacchiocchi, Francesco, et al.
Published: (2026)
Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)
by: Genalti, Gianmarco, et al.
Published: (2025)
Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2025)
by: Stradi, Francesco Emanuele, et al.
Published: (2025)
Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
Markov Persuasion Processes: Learning to Persuade from Scratch
by: Bacchiocchi, Francesco, et al.
Published: (2024)
by: Bacchiocchi, Francesco, et al.
Published: (2024)
A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
by: Germano, Jacopo, et al.
Published: (2023)
by: Germano, Jacopo, et al.
Published: (2023)
Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
by: Stradi, Francesco Emanuele, et al.
Published: (2024)
Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)
by: Bacchiocchi, Francesco, et al.
Published: (2025)
Online Resource Allocation With General Constraints
by: Chiefari, Eleonora Fidelia, et al.
Published: (2026)
by: Chiefari, Eleonora Fidelia, et al.
Published: (2026)
Safe Online Bid Optimization with Return on Investment and Budget Constraints
by: Castiglioni, Matteo, et al.
Published: (2022)
by: Castiglioni, Matteo, et al.
Published: (2022)
Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)
by: Bollini, Matteo, et al.
Published: (2026)
Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)
by: Bacchiocchi, Francesco, et al.
Published: (2023)
Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)
by: Castiglioni, Matteo, et al.
Published: (2023)
$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)
by: Genalti, Gianmarco, et al.
Published: (2023)
Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)
by: Lunghi, Anna, et al.
Published: (2026)
Attention is All You Need Until You Need Retention
by: Yaslioglu, M. Murat
Published: (2025)
by: Yaslioglu, M. Murat
Published: (2025)
Hedging Is Not All You Need: A Simple Baseline for Online Learning Under Haphazard Inputs
by: Buckchash, Himanshu, et al.
Published: (2024)
by: Buckchash, Himanshu, et al.
Published: (2024)
Context is All You Need
by: Delanois, Jean Erik, et al.
Published: (2026)
by: Delanois, Jean Erik, et al.
Published: (2026)
Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
by: Lunghi, Anna, et al.
Published: (2025)
by: Lunghi, Anna, et al.
Published: (2025)
Context-Selective State Space Models: Feedback is All You Need
by: Zattra, Riccardo, et al.
Published: (2025)
by: Zattra, Riccardo, et al.
Published: (2025)
Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)
by: Bernasconi, Martino, et al.
Published: (2024)
Exploitation Is All You Need... for Exploration
by: Rentschler, Micah, et al.
Published: (2025)
by: Rentschler, Micah, et al.
Published: (2025)
No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)
by: Maran, Davide, et al.
Published: (2024)
Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)
by: Bacchiocchi, Francesco, et al.
Published: (2025)
Hard Examples Are All You Need: Maximizing GRPO Post-Training Under Annotation Budgets
by: Pikus, Benjamin, et al.
Published: (2025)
by: Pikus, Benjamin, et al.
Published: (2025)
All You Need Is Synthetic Task Augmentation
by: Godin, Guillaume
Published: (2025)
by: Godin, Guillaume
Published: (2025)
Element-wise Attention Is All You Need
by: Feng, Guoxin
Published: (2025)
by: Feng, Guoxin
Published: (2025)
Efficient Deep Learning Board: Training Feedback Is Not All You Need
by: Gong, Lina, et al.
Published: (2024)
by: Gong, Lina, et al.
Published: (2024)
No More Adam: Learning Rate Scaling at Initialization is All You Need
by: Xu, Minghao, et al.
Published: (2024)
by: Xu, Minghao, et al.
Published: (2024)
Cooperation Is All You Need
by: Adeel, Ahsan, et al.
Published: (2023)
by: Adeel, Ahsan, et al.
Published: (2023)
Regret-Based Defense in Adversarial Reinforcement Learning
by: Belaire, Roman, et al.
Published: (2023)
by: Belaire, Roman, et al.
Published: (2023)
More Agents Is All You Need
by: Li, Junyou, et al.
Published: (2024)
by: Li, Junyou, et al.
Published: (2024)
Transduction is All You Need for Structured Data Workflows
by: Gliozzo, Alfio, et al.
Published: (2025)
by: Gliozzo, Alfio, et al.
Published: (2025)
Choice of PEFT Technique in Continual Learning: Prompt Tuning is Not All You Need
by: Wistuba, Martin, et al.
Published: (2024)
by: Wistuba, Martin, et al.
Published: (2024)
Is Exploration All You Need? Effective Exploration Characteristics for Transfer in Reinforcement Learning
by: Balloch, Jonathan C., et al.
Published: (2024)
by: Balloch, Jonathan C., et al.
Published: (2024)
Contracting With a Reinforcement Learning Agent by Playing Trick or Treat
by: Bollini, Matteo, et al.
Published: (2024)
by: Bollini, Matteo, et al.
Published: (2024)
Similar Items
-
Learning Adversarial MDPs with Stochastic Hard Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024) -
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026) -
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024) -
Truly Adapting to Adversarial Constraints in Constrained MABs
by: Stradi, Francesco Emanuele, et al.
Published: (2026) -
Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)