conftrace_

stochastic reward

17 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) regret bound (1926) stochastic optimization (1060) online learning (1777) upper confidence bound (197) online algorithm (445) adversarial reward (10) arm selection (28) sample complexity (1169) multi-agent reinforcement learning (538)

Papers

Bandits with Ranking Feedback NIPS 2024
Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds ICML 2023
Short-lived High-volume Bandits ICML 2023
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023
DFAC Framework: Factorizing the Value Function via Quantile Mixture for Multi-Agent Distributional Q-Learning ICML 2021
Stochastic Graphical Bandits with Adversarial Corruptions AAAI 2021
Linear Bandits with Feature Feedback AAAI 2020
Finite Continuum-Armed Bandits NIPS 2020
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option AISTATS 2020
Reward Estimation for Variance Reduction in Deep Reinforcement Learning CORL 2018
Multi-armed Bandits with Compensation NIPS 2018
Best of both worlds: Stochastic & adversarial best-arm identification COLT 2018
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017
Lenient Learning in Independent-Learner Stochastic Cooperative Games JMLR 2016
The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012
Mortal Multi-Armed Bandits NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008