Sample Complexity Of Exploration

The Sample Complexity of Exploration is the theoretical measure, within reinforcement learning and multi-armed bandit problems, that quantifies the minimum number of interactions or samples an agent must gather from an environment to achieve a desired level of policy accuracy or confidence in distinguishing between optimal and suboptimal actions, thereby characterizing the efficiency of exploration strategies in balancing uncertainty reduction against reward maximization.

40

Publications

3K

Citations

111

Authors

42

Institutions

Publications per year

2017–2026

20

Authors

111

  1. KJ
    Kevin Jamieson

    University of California, Berkeley, United States

    3 publications · 49 citations

    3

    h-index

  2. BR
    Benjamin Recht

    University of California, Berkeley, United States

    3 publications · 56 citations

    3

    h-index

  3. PA
    Pieter Abbeel

    University of California, Berkeley, United States

    3 publications · 66 citations

    3

    h-index

  4. TS
    Tom Schaul

    Google DeepMind (United Kingdom), United Kingdom

    2 publications · 603 citations

    2

    h-index

  5. MC
    Marlos C. Machado

    University of Alberta, Canada

    2 publications · 123 citations

    2

    h-index

1–5 of 111

Venues

  1. arXiv (Cornell University)

    Repository · 16 publications · 495 citations

    13

    h-index

  2. International Conference on Machine Learning

    Conference · 2 publications · 87 citations

    2

    h-index

  3. Neural Information Processing Systems

    Conference · 2 publications · 89 citations

    2

    h-index

  4. DSpace@MIT (Massachusetts Institute of Technology)

    Repository · 1 publications · 10 citations

    1

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 1 publications · 17 citations

    1

    h-index

1–5