◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Ryabko

10 papers hereh-index 18982 citations95 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author2
  • middle author1
  • last author6

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • cs.LG6
  • cs.CC1
  • cs.CR1
  • math.PR1
  • stat.ML1

identity via Semantic Scholar / OpenAlex

activity
20062013
most citedOnline Regret Bounds for Undiscounted Continuous Reinforcement Learning

44 citations · 127 across the 10 of their papers we have counts for

collaborators
Showing 2012 · cs.LGShow all

1 paper · 2 filters

cs.LG2012★ 32 cited

Regret Bounds for Restless Markov Bandits

Ronald Ortner, Daniil Ryabko, Peter Auer +1

We consider the restless Markov bandit problem, in which the state of each arm evolves according to a Markov process independently of the learner's actions. We suggest an algorithm…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.