Skip to content
conftrace_

stochastic bandit

114 papers

Papers

Stochastic Rising Bandits ICML 2022 When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits NeurIPS 2022 Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021 An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021 Asymptotically Optimal Information-Directed Sampling COLT 2021 Corralling Stochastic Bandit Algorithms AISTATS 2021 Dynamic Balancing for Model Selection in Bandits and RL ICML 2021 Fast Pure Exploration via Frank-Wolfe NeurIPS 2021 Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions COLT 2021 Indexed Minimum Empirical Divergence for Unimodal Bandits NeurIPS 2021 Observation-Free Attacks on Stochastic Bandits NeurIPS 2021 On the Optimality of Batch Policy Optimization Algorithms ICML 2021 Regret Bounds for Batched Bandits AAAI 2021 Stochastic Bandits with Graph Feedback in Non-Stationary Environments AAAI 2021 Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021 Bandits with Adversarial Scaling ICML 2020 Collaborative Exploration in Stochastic Multi-Player Bandits ACML 2020 Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NeurIPS 2020 Finding All ε-Good Arms in Stochastic Bandits NeurIPS 2020 Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Selfish Robustness and Equilibria in Multi-Player Bandits COLT 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulation ICML 2020 Batched Multi-armed Bandits Problem NeurIPS 2019