"regret minimization" Papers

39 papers found

Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits

Zihan Zhang, Xiangyang Ji, Yuan Zhou

ICLR 2025posterarXiv:2110.08057
10
citations

An Online Learning Theory of Trading-Volume Maximization

Tommaso Cesari, Roberto Colomboni

ICLR 2025poster
3
citations

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

Soumita Hait, Ping Li, Haipeng Luo et al.

NeurIPS 2025spotlight

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization

Marius Potfer, Vianney Perchet

NeurIPS 2025posterarXiv:2510.19591

Feature-Based Online Bilateral Trade

Solenne Gaucher, Martino Bernasconi, Matteo Castiglioni et al.

ICLR 2025posterarXiv:2405.18183
3
citations

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality

Junyan Liu, Ziyun Chen, Kun Wang et al.

NeurIPS 2025posterarXiv:2505.18828

Learning from Imperfect Human Feedback: A Tale from Corruption-Robust Dueling

Yuwei Cheng, Fan Yao, Xuefeng Liu et al.

ICLR 2025posterarXiv:2405.11204
2
citations

Markov Persuasion Processes: Learning to Persuade From Scratch

Francesco Bacchiocchi, Francesco Emanuele Stradi, Matteo Castiglioni et al.

NeurIPS 2025posterarXiv:2402.03077
9
citations

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets

Zixian Yang, Sushil Varma, Lei Ying

NeurIPS 2025posterarXiv:2510.14097

On the Universal Near Optimality of Hedge in Combinatorial Settings

Zhiyuan Fan, Arnab Maiti, Lillian Ratliff et al.

NeurIPS 2025spotlightarXiv:2510.17099

Optimal Regret of Bandits under Differential Privacy

Achraf Azize, Yulian Wu, Junya Honda et al.

NeurIPS 2025poster

Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation

Toshinori Kitamura, Arnob Ghosh, Tadashi Kozuno et al.

NeurIPS 2025spotlightarXiv:2502.10138

Regretful Decisions under Label Noise

Sujay Nagaraj, Yang Liu, Flavio Calmon et al.

ICLR 2025poster
3
citations

REINFORCEMENT LEARNING FOR INDIVIDUAL OPTIMAL POLICY FROM HETEROGENEOUS DATA

Rui Miao, Babak Shahbaba, Annie Qu

NeurIPS 2025posterarXiv:2505.09496
1
citations

Stable Matching with Ties: Approximation Ratios and Learning

Shiyun Lin, Simon Mauras, Nadav Merlis et al.

NeurIPS 2025posterarXiv:2411.03270
2
citations

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization

Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman

ICML 2024poster

Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits

Nikolai Karpov, Qin Zhang

AAAI 2024paperarXiv:2301.11442
2
citations

Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods

Wenzhi Gao, Chunlin Sun, Chenyu Xue et al.

ICML 2024poster

Eluder-based Regret for Stochastic Contextual MDPs

Orin Levy, Asaf Cassel, Alon Cohen et al.

ICML 2024poster

Equilibrium of Data Markets with Externality

Safwan Hossain, Yiling Chen

ICML 2024posterarXiv:2302.08012

Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs

Tianyuan Jin, Hao-Lun Hsu, William Chang et al.

AAAI 2024paperarXiv:2312.15549

Graph-Triggered Rising Bandits

Gianmarco Genalti, Marco Mussi, Nicola Gatti et al.

ICML 2024poster

Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements

Naman Agarwal, Satyen Kale, Karan Singh et al.

ICML 2024poster

Incentivized Learning in Principal-Agent Bandit Games

Antoine Scheid, Daniil Tiapkin, Etienne Boursier et al.

ICML 2024poster

Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery

Yassir Jedra, William Réveillard, Stefan Stojanovic et al.

ICML 2024poster

Monotone Individual Fairness

Yahav Bechavod

ICML 2024poster

Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning

Joon Suk Huh, Kirthevasan Kandasamy

ICML 2024poster

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback

Asaf Cassel, Haipeng Luo, Aviv Rosenberg et al.

ICML 2024poster

Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints

Dan Qiao, Yu-Xiang Wang

ICML 2024poster

No-Regret Reinforcement Learning in Smooth MDPs

Davide Maran, Alberto Maria Metelli, Matteo Papini et al.

ICML 2024poster

Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints

Francesco Emanuele Stradi, Jacopo Germano, Gianmarco Genalti et al.

ICML 2024poster

Online Learning with Bounded Recall

Jon Schneider, Kiran Vodrahalli

ICML 2024poster

Online Matrix Completion: A Collaborative Approach with Hott Items

Dheeraj Baby, Soumyabrata Pal

ICML 2024poster

Pricing with Contextual Elasticity and Heteroscedastic Valuation

Jianyu Xu, Yu-Xiang Wang

ICML 2024spotlight

Projection-Free Online Convex Optimization with Time-Varying Constraints

Dan Garber, Ben Kretzu

ICML 2024poster

Prospective Side Information for Latent MDPs

Jeongyeol Kwon, Yonathan Efroni, Shie Mannor et al.

ICML 2024spotlight

Quantum Algorithm for Online Exp-concave Optimization

Jianhao He, Chengchang Liu, Xutong Liu et al.

ICML 2024poster

Rate-Optimal Policy Optimization for Linear Markov Decision Processes

Uri Sherman, Alon Cohen, Tomer Koren et al.

ICML 2024poster

Test-Time Regret Minimization in Meta Reinforcement Learning

Mirco Mutti, Aviv Tamar

ICML 2024poster