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
808
1–5 of 808
1.6K
13
h-index
13
h-index
12
h-index
12
h-index
12
h-index
1–5 of 1.6K
431
Massachusetts Institute of Technology
Cambridge, United States
31 h-index
128 publications
8.3K citations
Carnegie Mellon University
Pittsburgh, United States
28 h-index
103 publications
6.2K citations
University of California, Berkeley
Berkeley, United States
25 h-index
84 publications
8K citations
Princeton University
Princeton, United States
24 h-index
80 publications
4.7K citations
Microsoft (United States)
Redmond, United States
23 h-index
34 publications
1.8K citations
Stanford University
Stanford, United States
21 h-index
64 publications
4.7K citations
The University of Texas at Austin
Austin, United States
20 h-index
61 publications
3K citations
University of California San Diego
San Diego, United States
19 h-index
44 publications
2.8K citations
1–8 of 431
Repository · 299 publications · 12.8K citations
55
h-index
Conference · 20 publications · 632 citations
17
h-index
20 publications · 2.3K citations
17
h-index
Conference · 16 publications · 921 citations
15
h-index
16 publications · 545 citations
13
h-index
1–5