Polynomial‐time universality and limitations of deep learning

DOI10.1002/cpa.22121MaRDI QIDQ6074573

Colin Sandon, Emmanuel Abbe

Publication date: 12 October 2023

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

• New lower bounds for statistical query learning
• Cryptographic hardness for learning intersections of halfspaces
• Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• Efficient noise-tolerant learning from statistical queries
• Characterizing Statistical Query Learning: Simplified Notions and Proofs
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
• On the Complexity of Random Satisfiability Problems with Planted Solutions
• Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions
• Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
• Understanding Machine Learning
• Noise-tolerant learning, the parity problem, and the statistical query model
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial‐time universality and limitations of deep learning