Sample Complexity
Sample Complexity is the minimum number of training samples required for a learning algorithm to achieve a specified level of performance with high probability, distinguishing it from related measures of computational or model complexity by focusing specifically on the dependence of generalization on sample size within the framework of supervised learning.
1.1K
Publications
89.5K
Citations
2.4K
Authors
598
Institutions
Publications per year
2017–2026
593
Parents
1.1K
Soft Actor-Critic Algorithms and Applications
Tuomas Haarnoja, Aurick Zhou, Kristian Hartikainen et al. · arXiv (Cornell University) · 2018 · 2K citations · Full text
Random sampling with a reservoir
Jeffrey Scott Vitter · ACM Transactions on Mathematical Software · 1985 · 1.8K citations · Full text
1–5 of 1.1K
2.4K
17
h-index
16
h-index
16
h-index
15
h-index
14
h-index
1–5 of 2.4K
598
Massachusetts Institute of Technology
Cambridge, United States
35 h-index
154 publications
10K citations
University of California, Berkeley
Berkeley, United States
33 h-index
144 publications
15.4K citations
Carnegie Mellon University
Pittsburgh, United States
30 h-index
116 publications
6.6K citations
The University of Texas at Austin
Austin, United States
28 h-index
88 publications
5.2K citations
Stanford University
Stanford, United States
26 h-index
100 publications
8.1K citations
Princeton University
Princeton, United States
26 h-index
93 publications
5.5K citations
Microsoft (United States)
Redmond, United States
25 h-index
46 publications
2.2K citations
University of California San Diego
San Diego, United States
21 h-index
55 publications
3.3K citations
1–8 of 598
Repository · 403 publications · 34.9K citations
67
h-index
27 publications · 2.7K citations
21
h-index
Conference · 29 publications · 912 citations
18
h-index
24 publications · 960 citations
17
h-index
Conference · 18 publications · 963 citations
16
h-index
1–5