multi-arm bandit

Dynamic Reward Adjustment in Multi-Reward Reinforcement Learning for Counselor Reflection Generation COLING 2024 Thompson Sampling Itself is Differentially Private AISTATS 2024 Affective and Dynamic Beam Search for Story Generation EMNLP 2023 Concurrent Constrained Optimization of Unknown Rewards for Multi-Robot Task Allocation RSS 2023 Meta Learning of Interface Conditions for Multi-Domain Physics-Informed Neural Networks ICML 2023 Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR ICML 2023 A Unifying Framework for Online Optimization with Long-Term Constraints NeurIPS 2022 Fast Generic Interaction Detection for Model Interpretability and Compression ICLR 2022 Matching in Multi-arm Bandit with Collision NeurIPS 2022 Backdoor Scanning for Deep Neural Networks through K-Arm Optimization ICML 2021 Beyond $log^2(T)$ regret for decentralized bandits in matching markets ICML 2021 From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits NeurIPS 2021 Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination NeurIPS 2021 Optimal Thompson Sampling strategies for support-aware CVaR bandits ICML 2021 Parallelizing Thompson Sampling NeurIPS 2021 The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks ICML 2021 An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule ICML 2019 Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019 Unified Policy Optimization for Robust Reinforcement Learning ACML 2019 Online Stochastic Linear Optimization under One-bit Feedback ICML 2016 Volumetric Spanners: An Efficient Exploration Basis for Learning JMLR 2016