{"total":25,"rows":[{"id":"2207.08799","title":"Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit","created":"2022-07-18","cited_by_count":187,"area":null},{"id":"2302.11055","title":"SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics","created":"2023-02-21","cited_by_count":143,"area":null},{"id":"2110.13162","title":"Quantum machine learning beyond kernel methods","created":"2021-10-25","cited_by_count":92,"area":null},{"id":"2206.01717","title":"A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Features","created":"2022-06-03","cited_by_count":49,"area":null},{"id":"2406.01581","title":"Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit","created":"2024-06-03","cited_by_count":46,"area":null},{"id":"2103.01210","title":"Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels","created":"2021-03-01","cited_by_count":41,"area":null},{"id":"2202.07626","title":"Random Feature Amplification: Feature Learning and Generalization in Neural Networks","created":"2022-02-15","cited_by_count":35,"area":null},{"id":"2102.02336","title":"On the Approximation Power of Two-Layer Networks of Random ReLUs","created":"2021-02-03","cited_by_count":29,"area":null},{"id":"2110.03922","title":"The Eigenlearning Framework: A Conservation Law Perspective on Kernel Regression and Wide Neural Networks","created":"2021-10-08","cited_by_count":26,"area":null},{"id":"2102.00434","title":"The Connection Between Approximation, Depth Separation and Learnability in Neural Networks","created":"2021-01-31","cited_by_count":19,"area":null},{"id":"2104.06970","title":"Understanding the Eluder Dimension","created":"2021-04-14","cited_by_count":19,"area":null},{"id":"2208.03113","title":"On the non-universality of deep learning: quantifying the cost of symmetry","created":"2022-08-05","cited_by_count":18,"area":null},{"id":"2106.01101","title":"Learning a Single Neuron with Bias Using Gradient Descent","created":"2021-06-02","cited_by_count":17,"area":null},{"id":"2307.06887","title":"Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networks","created":"2023-07-13","cited_by_count":16,"area":null},{"id":"2310.12408","title":"Provable Guarantees for Neural Networks via Gradient Feature Learning","created":"2023-10-19","cited_by_count":14,"area":null},{"id":"2309.03800","title":"Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck","created":"2023-09-07","cited_by_count":13,"area":null},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2407.16153","title":"On the Benefits of Rank in Attention Layers","created":"2024-07-23","cited_by_count":5,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","cited_by_count":4,"area":null},{"id":"2605.23556","title":"Is Dimensionality a Barrier for Retrieval Models?","created":"2026-05-22","cited_by_count":3,"area":null},{"id":"2401.07606","title":"RedEx: Beyond Fixed Representation Methods via Convex Optimization","created":"2024-01-15","cited_by_count":1,"area":null},{"id":"2411.10784","title":"On Reductions and Representations of Learning Problems in Euclidean Spaces","created":"2024-11-16","cited_by_count":1,"area":null},{"id":"2505.10423","title":"The Power of Random Features and the Limits of Distribution-Free Gradient Descent","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2508.13346","title":"Dimension lower bounds for linear approaches to function approximation","created":"2025-08-18","cited_by_count":0,"area":null},{"id":"2603.02234","title":"Structured vs. Unstructured Pruning: An Exponential Gap","created":"2026-02-13","cited_by_count":0,"area":null}],"next_cursor":null}