Skip to content
conftrace_

stochastic reward

20 papers

Papers

BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms ICML 2025 Bandits with Ranking Feedback NeurIPS 2024 Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints ICML 2024 Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning ICML 2024 Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds ICML 2023 Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023 Short-lived High-volume Bandits ICML 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 A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option AISTATS 2020 Finite Continuum-Armed Bandits NeurIPS 2020 Linear Bandits with Feature Feedback AAAI 2020 Best of both worlds: Stochastic & adversarial best-arm identification COLT 2018 Multi-armed Bandits with Compensation NeurIPS 2018 Reward Estimation for Variance Reduction in Deep Reinforcement Learning CoRL 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 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 Mortal Multi-Armed Bandits NeurIPS 2008