Lower Bounds for the Empirical Minimization Algorithm

DOI10.1109/TIT.2008.926323zbMath1328.68332OpenAlexW2095838485MaRDI QIDQ3604755

Shahar Mendelson

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.926323

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Generalized linear models (logistic models) (62J12) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Aggregation via empirical risk minimization, Semi-supervised AUC optimization based on positive-unlabeled learning, Sharper lower bounds on the performance of the empirical risk minimization algorithm, Empirical risk minimization is optimal for the convex aggregation problem, On the optimality of the aggregate with exponential weights for low temperatures, General nonexact oracle inequalities for classes with a subexponential envelope, Obtaining fast error rates in nonconvex situations