:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Castiglioni, Matteo, Lunghi, Anna, Marchesi, Alberto
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2602.10868
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)

Better Regret Rates in Bilateral Trade via Sublinear Budget Violation
by: Lunghi, Anna, et al.
Published: (2025)

A Stronger Benchmark for Online Bilateral Trade: From Fixed Prices to Distributions
by: Lunghi, Anna, et al.
Published: (2026)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Online Two-Sided Markets: Many Buyers Enhance Learning
by: Lunghi, Anna, et al.
Published: (2025)

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026)

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

Learning Adversarial MDPs with Stochastic Hard Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
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)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

Truly Adapting to Adversarial Constraints in Constrained MABs
by: Stradi, Francesco Emanuele, et al.
Published: (2026)

Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Markov Persuasion Processes: Learning to Persuade from Scratch
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)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Multi-Horizon Time Series Forecasting of non-parametric CDFs with Deep Lattice Networks
by: Erdmann, Niklas, et al.
Published: (2025)

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

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Pricing Query Complexity of Multiplicative Revenue Approximation
by: Tang, Wei, et al.
Published: (2026)

Regret-Minimizing Contracts: Agency Under Uncertainty
by: Bernasconi, Martino, et al.
Published: (2024)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
by: Genalti, Gianmarco, et al.
Published: (2024)

Deep Generative Models: Complexity, Dimensionality, and Approximation
by: Wang, Kevin, et al.
Published: (2025)

The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning
by: Block, Adam, et al.
Published: (2023)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
by: Maran, Davide, et al.
Published: (2024)

Online Uniform Sampling: Randomized Learning-Augmented Approximation Algorithms with Application to Digital Health
by: Liu, Xueqing, et al.
Published: (2024)

Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
by: Potfer, Marius, et al.
Published: (2025)

Fix Representation (Optimally) Before Fairness: Finite-Sample Shrinkage Population Correction and the True Price of Fairness Under Subpopulation Shift
by: Asiaee, Amir, et al.
Published: (2026)

HUMAP: Hierarchical Uniform Manifold Approximation and Projection
by: Marcílio-Jr, Wilson E., et al.
Published: (2021)

List Sample Compression and Uniform Convergence
by: Hanneke, Steve, et al.
Published: (2024)

Single-Timescale Multi-Sequence Stochastic Approximation Without Fixed Point Smoothness: Theories and Applications
by: Huang, Yue, et al.
Published: (2024)