An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear
Bandits with General Constraints

v1v2v3 (latest)

An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints

10 February 2021

ArXiv (abs)PDF HTML

Papers citing "An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints"

7 / 7 papers shown

Title
Multi-Metric Adaptive Experimental Design under Fixed Budget with Validation Qining Zhang Tanner Fiez Yi Liu Wenyang Liu 66 0 0 03 Jun 2025
On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit Xiaoyi Wu Bo Ji Bin Li FaML 128 0 0 01 Jan 2025
Trading-off price for data quality to achieve fair online allocation M. Molina Nicolas Gast Patrick Loiseau Vianney Perchet 58 4 0 23 Jun 2023
Online Nonstochastic Control with Adversarial and Static Constraints Xin Liu Zixi Yang Lei Ying 64 5 0 05 Feb 2023
Learning While Scheduling in Multi-Server Systems with Unknown Statistics: MaxWeight with Discounted UCB Zixi Yang R. Srikant Lei Ying 52 9 0 02 Sep 2022
On Kernelized Multi-Armed Bandits with Constraints Xingyu Zhou Bo Ji 69 30 0 29 Mar 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints Liyu Chen R. Jain Haipeng Luo 112 28 0 31 Jan 2022