conftrace_

bandit problem

12 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) thompson sampling (237) online learning (1777) sequential decision (123) implicit exploration (3) deep neural network (1803) optimistic algorithm (35) learning dynamics (75) zeroth-order optimization (102)

Papers

Uniform Last-Iterate Guarantee for Bandits and Reinforcement Learning NIPS 2024
Bandits with Preference Feedback: A Stackelberg Game Perspective NIPS 2024
Likelihood Ratio Confidence Sets for Sequential Decision Making NIPS 2023
Hierarchical Bayesian Bandits AISTATS 2022
Efficient Online Bayesian Inference for Neural Bandits AISTATS 2022
Deep Proxy Causal Learning and its Application to Confounded Bandit Policy Evaluation NIPS 2021
Beyond Variance Reduction: Understanding the True Impact of Baselines on Policy Optimization ICML 2021
Making the most of your day: online learning for optimal allocation of time NIPS 2021
No Regrets for Learning the Prior in Bandits NIPS 2021
Pure Exploration with Multiple Correct Answers NIPS 2019
Efficient Thompson Sampling for Online Matrix-Factorization Recommendation NIPS 2015
Efficient learning by implicit exploration in bandit problems with side observations NIPS 2014