Skip to content
conftrace_

optimistic algorithm

36 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (19) online learning (13) multi-armed bandit (8) regret minimization (7) markov decision process (6) reinforcement learning (6) nash equilibrium (5) delayed feedback (3) stochastic optimization (3) linear bandit (2)

Papers

Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020 Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret NeurIPS 2020 Anytime Online-to-Batch, Optimism and Acceleration ICML 2019 Are sample means in multi-armed bandits positively or negatively biased? NeurIPS 2019 Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs NeurIPS 2019 Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NeurIPS 2019 Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NeurIPS 2018 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013 Parametric Bandits: The Generalized Linear Case NeurIPS 2010 Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs NeurIPS 2007