{"total":27,"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":"2108.10573","title":"The staircase property: How hierarchical structure can guide deep learning","created":"2021-08-24","cited_by_count":62,"area":null},{"id":"2204.02892","title":"Sub-Task Decomposition Enables Learning in Sequence to Sequence Tasks","created":"2022-04-06","cited_by_count":41,"area":null},{"id":"2309.15111","title":"SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problem","created":"2023-09-26","cited_by_count":39,"area":null},{"id":"2406.06467","title":"How Far Can Transformers Reason? The Globality Barrier and Inductive Scratchpad","created":"2024-06-10","cited_by_count":36,"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":"2306.16921","title":"Provable Advantage of Curriculum Learning on Parity Targets with Mixed Inputs","created":"2023-06-29","cited_by_count":22,"area":null},{"id":"2301.13833","title":"A Mathematical Model for Curriculum Learning for Parities","created":"2023-01-31","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":"2205.13647","title":"Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures","created":"2022-05-26","cited_by_count":17,"area":null},{"id":"2506.18110","title":"RL for Reasoning by Adaptively Revealing Rationales","created":"2025-06-22","cited_by_count":16,"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":"2310.11428","title":"Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression","created":"2023-10-17","cited_by_count":14,"area":null},{"id":"2202.12846","title":"An initial alignment between neural network and target is needed for gradient descent to learn","created":"2022-02-25","cited_by_count":12,"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":"2310.05309","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","created":"2023-10-08","cited_by_count":5,"area":null},{"id":"2510.04115","title":"On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach","created":"2025-10-05","cited_by_count":4,"area":null},{"id":"2510.14826","title":"To Infinity and Beyond: Tool-Use Unlocks Length Generalization in State Space Models","created":"2025-10-16","cited_by_count":4,"area":null},{"id":"2510.14331","title":"LLM Priors for ERM over Programs","created":"2025-10-16","cited_by_count":3,"area":null},{"id":"2602.08907","title":"Positive Distribution Shift as a Framework for Understanding Tractable Learning","created":"2026-02-09","cited_by_count":3,"area":null},{"id":"2209.00735","title":"Recurrent Convolutional Neural Networks Learn Succinct Learning Algorithms","created":"2022-09-01","cited_by_count":2,"area":null},{"id":"2602.11262","title":"Unlearnable phases of matter","created":"2026-02-11","cited_by_count":2,"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":"2609.13057","title":"Benign Loss Landscapes Can Coexist with Worst-Case Hardness","created":"2026-09-11","cited_by_count":0,"area":null},{"id":"2610.02749","title":"Learning Query Encoders Can Be Hard Even When Vector Retrieval Is Geometrically Easy","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}