AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS

DOI10.20382/jocg.v3i1a9zbMath1404.68103arXiv0903.4817OpenAlexW2963576992MaRDI QIDQ2968091

Martin Jaggi, Clément Maria, Bernd Gärtner

Publication date: 9 March 2017

Full work available at URL: https://arxiv.org/abs/0903.4817

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Root-finding approaches for computing conformal prediction set ⋮ Moser's shadow problem ⋮ LASSO for streaming data with adaptative filtering

This page was built for publication: AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS