{"total":22,"rows":[{"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":"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":"2305.20069","title":"A survey on the complexity of learning quantum states","created":"2023-05-31","cited_by_count":32,"area":null},{"id":"2309.03843","title":"Gradient-Based Feature Learning under Structured Data","created":"2023-09-07","cited_by_count":32,"area":null},{"id":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28,"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":"2406.01461","title":"Hardness of Learning Neural Networks under the Manifold Hypothesis","created":"2024-06-03","cited_by_count":18,"area":null},{"id":"2407.05622","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries","created":"2024-07-08","cited_by_count":15,"area":null},{"id":"2401.01869","title":"On the hardness of learning under symmetries","created":"2024-01-03","cited_by_count":13,"area":null},{"id":"2406.11828","title":"Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations","created":"2024-06-17","cited_by_count":13,"area":null},{"id":"2111.10352","title":"On the power of adaptivity in statistical adversaries","created":"2021-11-19","cited_by_count":12,"area":null},{"id":"2407.00966","title":"Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension","created":"2024-07-01","cited_by_count":11,"area":null},{"id":"2102.05174","title":"On the Hardness of PAC-learning Stabilizer States with Noise","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2501.00817","title":"Hardness of Learning Fixed Parities with Neural Networks","created":"2025-01-01","cited_by_count":7,"area":null},{"id":"2205.13531","title":"Learning ReLU networks to high uniform accuracy is intractable","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2309.12207","title":"Boolformer: Symbolic Regression of Logic Functions with Transformers","created":"2023-09-21","cited_by_count":5,"area":null},{"id":"2509.24510","title":"Specialization after Generalization: Towards Understanding Test-Time Training in Foundation Models","created":"2025-09-29","cited_by_count":5,"area":null},{"id":"2106.13851","title":"Approximate Maximum Halfspace Discrepancy","created":"2021-06-25","cited_by_count":3,"area":null},{"id":"2510.14331","title":"LLM Priors for ERM over Programs","created":"2025-10-16","cited_by_count":3,"area":null},{"id":"2510.21020","title":"From Information to Generative Exponent: Learning Rate Induces Phase Transitions in SGD","created":"2025-10-23","cited_by_count":2,"area":null},{"id":"2306.06184","title":"A Unified Model and Dimension for Interactive Estimation","created":"2023-06-09","cited_by_count":0,"area":null},{"id":"2605.28612","title":"Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}