2025 "regret minimization" Papers
28 papers found
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
Shinji Ito, Kevin Jamieson, Haipeng Luo et al.
Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits
Zihan Zhang, Xiangyang Ji, Yuan Zhou
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
Tim van Erven, Jack Mayo, Julia Olkhovskaya et al.
An Online Learning Theory of Trading-Volume Maximization
Tommaso Cesari, Roberto Colomboni
Causal LLM Routing: End-to-End Regret Minimization from Observational Data
Asterios Tsiourvas, Wei Sun, Georgia Perakis
Comparator-Adaptive $\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games
Soumita Hait, Ping Li, Haipeng Luo et al.
Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
Marius Potfer, Vianney Perchet
Contextual Dynamic Pricing with Heterogeneous Buyers
Thodoris Lykouris, Sloan Nietert, Princewill Okoroafor et al.
Feature-Based Online Bilateral Trade
Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni et al.
Finally Rank-Breaking Conquers MNL Bandits: Optimal and Efficient Algorithms for MNL Assortment
Aadirupa Saha, Pierre Gaillard
Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
Junyan Liu, Ziyun Chen, Kun Wang et al.
Learning from Imperfect Human Feedback: A Tale from Corruption-Robust Dueling
Yuwei Cheng, Fan Yao, Xuefeng Liu et al.
Learning to price with resource constraints: from full information to machine-learned prices
Ruicheng Ao, Jiashuo Jiang, David Simchi-Levi
Linear Bandits with Memory
Pierre Laforgue, Giulia Clerici, Nicolò Cesa-Bianchi
Markov Persuasion Processes: Learning to Persuade From Scratch
Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni et al.
Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
Zixian Yang, Sushil Varma, Lei Ying
Neural Combinatorial Clustered Bandits for Recommendation Systems
Baran Atalar, Carlee Joe-Wong
No-Regret Online Autobidding Algorithms in First-price Auctions
Yilin LI, Yuan Deng, Wei Tang et al.
Online Learning in the Repeated Mediated Newsvendor Problem
Nataša Bolić, Tom Cesari, Roberto Colomboni et al.
On the Universal Near Optimality of Hedge in Combinatorial Settings
Zhiyuan Fan, Arnab Maiti, Lillian Ratliff et al.
Optimal Regret of Bandits under Differential Privacy
Achraf Azize, Yulian Wu, Junya Honda et al.
Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation
Toshinori Kitamura, Arnob Ghosh, Tadashi Kozuno et al.
Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
Orin Levy, Liad Erez, Alon Peled-Cohen et al.
Regretful Decisions under Label Noise
Sujay Nagaraj, Yang Liu, Flavio Calmon et al.
REINFORCEMENT LEARNING FOR INDIVIDUAL OPTIMAL POLICY FROM HETEROGENEOUS DATA
Rui Miao, Babak Shahbaba, Annie Qu
Robust Contextual Pricing
Anupam Gupta, Guru Guruganesh, Renato Leme et al.
Stable Matching with Ties: Approximation Ratios and Learning
Shiyun Lin, Simon Mauras, Nadav Merlis et al.
Tightening Regret Lower and Upper Bounds in Restless Rising Bandits
Cristiano Migali, Marco Mussi, Gianmarco Genalti et al.