New lower bounds for statistical query learning
From MaRDI portal
Publication:1780448
DOI10.1016/j.jcss.2004.10.003zbMath1105.68053MaRDI QIDQ1780448
Publication date: 13 June 2005
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2004.10.003
68Q32: Computational learning theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Polynomial‐time universality and limitations of deep learning, A complete characterization of statistical query learning with applications to evolvability, Unconditional lower bounds for learning intersections of halfspaces, Characterizing Statistical Query Learning: Simplified Notions and Proofs
Cites Work