Daniil Ryabko
Artificial Intelligence · 2015
A researcher in the Science corpus: 1 paper; trusts 13 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 7 citations into it
- Management Science and Operations Research — 5 citations into it
- Reinforcement Learning — 5 citations into it
Whom Daniil Ryabko trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Daniil Ryabko's perspective
Ordered by how strongly the researchers Daniil Ryabko trusts endorse each paper. Same corpus, a different order for every researcher.
- Near-Optimal Reinforcement Learning in Polynomial Time
- Near-optimal Regret Bounds for Reinforcement Learning
- The Nonstochastic Multiarmed Bandit Problem
- Online Linear Regression and Its Application to Model-Based Reinforcement Learning
- Introduction to Nonparametric Estimation
- Nearly Tight Bounds for the Continuum-Armed Bandit Problem
- Exploration in Metric State Spaces
- Off-policy Learning with Options and Recognizers
- Multi-armed bandits in metric spaces (Symposium on the Theory of Computing)
- Kernel-Based Reinforcement Learning
Their papers
- Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning (2015) — 41 citations