conftrace_

multi-arm bandit

20 papers

Explore in graph

Also known as

MAB

Co-occurring keywords

regret bound (1926) thompson sampling (237) conditional value at risk (50) multi-armed bandit (1098) online optimization (108) regret minimization (315) sample complexity (1169) policy optimization (657) stochastic optimization (1060) differential privacy (1016)

Papers

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
Meta Learning of Interface Conditions for Multi-Domain Physics-Informed Neural Networks ICML 2023
Concurrent Constrained Optimization of Unknown Rewards for Multi-Robot Task Allocation RSS 2023
Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR ICML 2023
Matching in Multi-arm Bandit with Collision NIPS 2022
A Unifying Framework for Online Optimization with Long-Term Constraints NIPS 2022
The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks ICML 2021
Backdoor Scanning for Deep Neural Networks through K-Arm Optimization ICML 2021
Parallelizing Thompson Sampling NIPS 2021
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits NIPS 2021
Beyond $log^2(T)$ regret for decentralized bandits in matching markets ICML 2021
Optimal Thompson Sampling strategies for support-aware CVaR bandits ICML 2021
Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination NIPS 2021
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019
Unified Policy Optimization for Robust Reinforcement Learning ACML 2019
An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule ICML 2019
Volumetric Spanners: An Efficient Exploration Basis for Learning JMLR 2016
Online Stochastic Linear Optimization under One-bit Feedback ICML 2016