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

Online Certification of Preference-Based Fairness for Personalized Recommender Systems (Extended Abstract) IJCAI 2023
Statistical and Computational Trade-off in Multi-Agent Multi-Armed Bandits NIPS 2023
Multiplier Bootstrap-based Exploration ICML 2023
Stochastic Gradient Succeeds for Bandits ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Module-wise Adaptive Distillation for Multimodality Foundation Models NIPS 2023
Leveraging Demonstrations to Improve Online Learning: Quality Matters ICML 2023
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits IJCAI 2023
Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback ICML 2023
Adversarial Attacks on Online Learning to Rank with Click Feedback NIPS 2023
Competing for Shareable Arms in Multi-Player Multi-Armed Bandits ICML 2023
Doubly Adversarial Federated Bandits ICML 2023
Adaptive Linear Estimating Equations NIPS 2023
VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback JMLR 2023
Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits ICML 2023
SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits (Extended Abstract) IJCAI 2023
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards NIPS 2023
A Novel Demand Response Model and Method for Peak Reduction in Smart Grids -- PowerTAC IJCAI 2023
BanditPAM++: Faster $k$-medoids Clustering NIPS 2023
Adaptation to the Range in K-Armed Bandits JMLR 2023
Improving Few-Shot Generalization by Exploring and Exploiting Auxiliary Data NIPS 2023
Multi-Fidelity Multi-Armed Bandits Revisited NIPS 2023
Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework NIPS 2023
An $\varepsilon$-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond NIPS 2023