multi-armed bandit

Pricing against a Budget and ROI Constrained Buyer AISTATS 2023 Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets AAAI 2023 Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023 Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds JMLR 2023 Reinforcement Learning Can Be More Efficient with Multiple Rewards ICML 2023 Replicable Bandits ICLR 2023 Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption NeurIPS 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Robust Budget Pacing with a Single Sample ICML 2023 SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits (Extended Abstract) IJCAI 2023 Short-lived High-volume Bandits ICML 2023 Smooth Non-stationary Bandits ICML 2023 Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds NeurIPS 2023 Statistical and Computational Trade-off in Multi-Agent Multi-Armed Bandits NeurIPS 2023 Statistical Inference on Multi-armed Bandits with Delayed Feedback ICML 2023 Stochastic Gradient Succeeds for Bandits ICML 2023 Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk NeurIPS 2023 Thompson Exploration with Best Challenger Rule in Best Arm Identification ACML 2023 Thompson Sampling with Less Exploration is Fast and Optimal ICML 2023 Thresholded linear bandits AISTATS 2023 Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits ICML 2023 Towards Efficient and Domain-Agnostic Evasion Attack with High-Dimensional Categorical Inputs AAAI 2023 Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023 Trading-off price for data quality to achieve fair online allocation NeurIPS 2023 Transportability for Bandits with Data from Different Environments NeurIPS 2023