conftrace_

combinatorial semi-bandit

25 papers

Explore in graph

Also known as

CSB

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) combinatorial optimization (1039) stochastic optimization (1060) linear bandit (124) online algorithm (445) thompson sampling (237) bandit algorithm (108) triggering probability (3)

Papers

A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs JMLR 2025
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits NIPS 2024
Bandit Task Assignment with Unknown Processing Time NIPS 2023
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs COLT 2023
Closing the Computational-Statistical Gap in Best Arm Identification for Combinatorial Semi-bandits NIPS 2023
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits ICML 2023
A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits AISTATS 2022
Linear Combinatorial Semi-Bandit with Causally Related Rewards IJCAI 2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms NIPS 2022
Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits NIPS 2021
Combinatorial semi-bandit in the non-stationary environment UAI 2021
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time ALT 2021
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NIPS 2021
Bandits with Knapsacks beyond the Worst Case NIPS 2021
Experimental Design for Regret Minimization in Linear Bandits AISTATS 2021
(Locally) Differentially Private Combinatorial Semi-Bandits ICML 2020
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits AAAI 2020
Exploiting structure of uncertainty for efficient matroid semi-bandits ICML 2019
Blocking Bandits NIPS 2019
More Adaptive Algorithms for Adversarial Bandits COLT 2018
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NIPS 2017
Efficient Learning in Large-Scale Combinatorial Semi-Bandits ICML 2015
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015
First-order regret bounds for combinatorial semi-bandits COLT 2015