a public good project by the
Synthesis
Company
of California

© 2026

Improved Bounds on the Sample Complexity of Learning | doi.page

0 citations0 references

Google Scholar doi.org

Improved Bounds on the Sample Complexity of Learning

Journal of Computer and System Sciences·2001·Vol. 62(3), pp. 516–527

Citations Over TimeTop 10% of 2001 papers

Yi Li, Philip M. Long, Aravind Srinivasan

Related Papers

→ The Sample Complexity of Exploration in the Multi-Armed Bandit Problem(2004)328 cited
→ Near-optimal PAC bounds for discounted MDPs(2014)43 cited
→ Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization(2023)3 cited
→ An estimation of sample complexity of the neural network model in the extended PAC learning framework(2003)1 cited
→ A sharper lower bound on Rankin's constant(2023)