Sample Complexity Analysis

Sample Complexity Analysis is a theoretical framework in stochastic shortest path problems that characterizes the minimum number of samples required by a learning algorithm to achieve a desired level of policy accuracy with high probability.

808

Publications

46K

Citations

1.6K

Authors

431

Institutions

Publications per year

2017–2026

412

Authors

1.6K

  1. BR
    Benjamin Recht

    University of California, Berkeley, United States

    15 publications · 1K citations

    13

    h-index

  2. SM
    Sham M. Kakade

    Microsoft (United States), United States

    16 publications · 736 citations

    13

    h-index

  3. JA
    Jayadev Acharya

    Cornell University, United States

    14 publications · 408 citations

    12

    h-index

  4. SS
    Simon S. Du

    Carnegie Mellon University, United States

    12 publications · 829 citations

    12

    h-index

  5. ID
    Ilias Diakonikolas

    Columbia University, United States

    16 publications · 579 citations

    12

    h-index

1–5 of 1.6K

Venues

  1. arXiv (Cornell University)

    Repository · 299 publications · 12.8K citations

    55

    h-index

  2. Neural Information Processing Systems

    Conference · 20 publications · 632 citations

    17

    h-index

  3. IEEE Transactions on Information Theory

    20 publications · 2.3K citations

    17

    h-index

  4. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 16 publications · 921 citations

    15

    h-index

  5. IEEE Transactions on Signal Processing

    16 publications · 545 citations

    13

    h-index

1–5