Algorithms with Logarithmic or Sublinear Regret for Constrained
Contextual Bandits

Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits

27 April 2015

Papers citing "Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits"

19 / 19 papers shown

Title
Constrained Online Decision-Making: A Unified Framework Haichen Hu David Simchi-Levi Navid Azizan 39 0 0 11 May 2025
Semi-Infinitely Constrained Markov Decision Processes and Efficient Reinforcement Learning Liangyu Zhang Yang Peng Wenhao Yang Zhihua Zhang 26 1 0 29 Apr 2023
Spatio-temporal Incentives Optimization for Ride-hailing Services with Offline Deep Reinforcement Learning Yanqiu Wu Qingyang Li Zhiwei Qin OffRL 20 3 0 06 Nov 2022
Safe Exploration for Efficient Policy Evaluation and Comparison Runzhe Wan Branislav Kveton Rui Song OffRL 36 10 0 26 Feb 2022
Fairer LP-based Online Allocation via Analytic Center Guanting Chen Xiaocheng Li Yinyu Ye FaML 23 8 0 27 Oct 2021
Distributionally Robust Learning Ruidi Chen I. Paschalidis OOD 32 65 0 20 Aug 2021
Bandit Algorithms for Precision Medicine Yangyi Lu Ziping Xu Ambuj Tewari 66 11 0 10 Aug 2021
Restless Bandits with Many Arms: Beating the Central Limit Theorem Xinming Zhang P. Frazier 16 23 0 25 Jul 2021
Learning with Safety Constraints: Sample Complexity of Reinforcement Learning for Constrained MDPs Aria HasanzadeZonuzy Archana Bura D. Kalathil S. Shakkottai 32 38 0 01 Aug 2020
Contextual Constrained Learning for Dose-Finding Clinical Trials Hyun-Suk Lee Cong Shen James Jordon M. Schaar 14 14 0 08 Jan 2020
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds Xiaocheng Li Yinyu Ye 28 66 0 12 Sep 2019
Linear Stochastic Bandits Under Safety Constraints Sanae Amani M. Alizadeh Christos Thrampoulidis 33 117 0 16 Aug 2019
Online Allocation and Pricing: Constant Regret via Bellman Inequalities Alberto Vera Siddhartha Banerjee I. Gurvich OffRL 22 48 0 14 Jun 2019
The Bayesian Prophet: A Low-Regret Framework for Online Decision Making Alberto Vera Siddhartha Banerjee OffRL 15 87 0 15 Jan 2019
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks Adrian Rivera Cardoso He Wang Huan Xu 40 11 0 21 Jun 2018
Double Thompson Sampling for Dueling Bandits Huasen Wu Xin Liu 22 87 0 25 Apr 2016
Linear Contextual Bandits with Knapsacks Shipra Agrawal Nikhil R. Devanur 41 142 0 24 Jul 2015
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives Shipra Agrawal Nikhil R. Devanur Lihong Li 25 90 0 10 Jun 2015
Resourceful Contextual Bandits Ashwinkumar Badanidiyuru John Langford Aleksandrs Slivkins 42 117 0 27 Feb 2014