Strong minimax lower bounds for learning

DOI10.1023/A:1007454427662zbMath0892.68083OpenAlexW3017128687MaRDI QIDQ1383192

Gábor Lugosi, András Antos

Publication date: 2 April 1998

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007454427662

zbMATH Keywords

PAC learningVapnik-Chervonenkis dimension

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Ten More Years of Error Rate Research, The true sample complexity of active learning, Lower bounds on the rate of convergence of nonparametric regression estimates, Optimal third root asymptotic bounds in the statistical estimation of thresholds, Theory of Classification: a Survey of Some Recent Advances, Lower bounds for the rate of convergence in nonparametric pattern recognition