conftrace_

multi-armed bandit

1098 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) thompson sampling (237) upper confidence bound (197) regret minimization (315) online algorithm (445) sample complexity (1169) contextual bandit (381) best arm identification (85)

Papers

Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise AISTATS 2022
Maximizing and Satisficing in Multi-armed Bandits with Graph Information NIPS 2022
Graph Neural Network Bandits NIPS 2022
A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits AAAI 2022
Bandit Data-Driven Optimization for Crowdsourcing Food Rescue Platforms AAAI 2022
Max-Min Grouped Bandits AAAI 2022
Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model AAAI 2022
Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique JMLR 2022
An Online Learning Approach to Sequential User-Centric Selection Problems AAAI 2022
When Are Linear Stochastic Bandits Attackable? ICML 2022
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022
Open Problem: Optimal Best Arm Identification with Fixed-Budget COLT 2022
Multi-armed Bandit Algorithm against Strategic Replication AISTATS 2022
Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits JMLR 2022
Partner-Aware Algorithms in Decentralized Cooperative Bandit Teams AAAI 2022
Learning the Optimal Recommendation from Explorative Users AAAI 2022
Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs COLT 2022
Regret, stability & fairness in matching markets with bandit learners AISTATS 2022
Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits AISTATS 2022
Maillard Sampling: Boltzmann Exploration Done Optimally AISTATS 2022
Distributionally-Aware Kernelized Bandit Problems for Risk Aversion ICML 2022
Safe Exploration for Efficient Policy Evaluation and Comparison ICML 2022
k-experts - Online Policies and Fundamental Limits AISTATS 2022
Online Certification of Preference-Based Fairness for Personalized Recommender Systems AAAI 2022
A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed Risk NIPS 2022