{"total":59,"rows":[{"id":"2205.01445","title":"High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation","created":"2022-05-03","cited_by_count":150,"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":"2411.04330","title":"Scaling Laws for Precision","created":"2024-11-07","cited_by_count":95,"area":null},{"id":"2301.13105","title":"Generalization on the Unseen, Logic Reasoning and Degree Curriculum","created":"2023-01-30","cited_by_count":73,"area":null},{"id":"2307.02129","title":"How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Model","created":"2023-07-05","cited_by_count":71,"area":null},{"id":"2305.18270","title":"How Two-Layer Neural Networks Learn, One (Giant) Step at a Time","created":"2023-05-29","cited_by_count":68,"area":null},{"id":"2409.17858","title":"How Feature Learning Can Improve Neural Scaling Laws","created":"2024-09-26","cited_by_count":56,"area":null},{"id":"2402.03220","title":"The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents","created":"2024-02-05","cited_by_count":52,"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":"2402.04980","title":"Asymptotics of feature learning in two-layer networks after one gradient-step","created":"2024-02-07","cited_by_count":38,"area":null},{"id":"2405.15459","title":"Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functions","created":"2024-05-24","cited_by_count":37,"area":null},{"id":"2306.04815","title":"Catapults in SGD: spikes in the training loss and their impact on generalization through feature learning","created":"2023-06-07","cited_by_count":31,"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":"2405.17580","title":"Mixed Dynamics In Linear Networks: Unifying the Lazy and Active Regimes","created":"2024-05-27","cited_by_count":18,"area":null},{"id":"2407.05694","title":"On the Limitations of Compute Thresholds as a Governance Strategy","created":"2024-07-08","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":"2505.17495","title":"ProxySPEX: Inference-Efficient Interpretability via Sparse Feature Interactions in LLMs","created":"2025-05-23","cited_by_count":16,"area":null},{"id":"2403.09053","title":"Towards a theory of model distillation","created":"2024-03-14","cited_by_count":15,"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":"2504.05426","title":"Survey on Algorithms for multi-index models","created":"2025-04-07","cited_by_count":15,"area":null},{"id":"2506.15872","title":"Hidden Breakthroughs in Language Model Training","created":"2025-06-18","cited_by_count":15,"area":null},{"id":"2506.06489","title":"Alternating Gradient Flows: A Theory of Feature Learning in Two-layer Neural Networks","created":"2025-06-06","cited_by_count":14,"area":null},{"id":"2507.02550","title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","created":"2025-07-03","cited_by_count":14,"area":null},{"id":"2404.08602","title":"Sliding down the stairs: how correlated latent variables accelerate learning with neural networks","created":"2024-04-12","cited_by_count":12,"area":null},{"id":"2502.03210","title":"From Kernels to Features: A Multi-Scale Adaptive Theory of Feature Learning","created":"2025-02-05","cited_by_count":10,"area":null},{"id":"2406.01589","title":"Tilting the Odds at the Lottery: the Interplay of Overparameterisation and Curricula in Neural Networks","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2506.05500","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","created":"2025-06-05","cited_by_count":9,"area":null},{"id":"2211.08771","title":"On the symmetries in the dynamics of wide two-layer neural networks","created":"2022-11-16","cited_by_count":8,"area":null},{"id":"2211.13873","title":"Global and Local Hierarchy-aware Contrastive Framework for Implicit Discourse Relation Recognition","created":"2022-11-25","cited_by_count":7,"area":null},{"id":"2404.10727","title":"How Deep Networks Learn Sparse and Hierarchical Data: the Sparse Random Hierarchy Model","created":"2024-04-16","cited_by_count":7,"area":null},{"id":"2407.05664","title":"How DNNs break the Curse of Dimensionality: Compositionality and Symmetry Learning","created":"2024-07-08","cited_by_count":6,"area":null},{"id":"2506.02664","title":"Computational Thresholds in Multi-Modal Learning via the Spiked Matrix-Tensor Model","created":"2025-06-03","cited_by_count":6,"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":"2402.05013","title":"Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth","created":"2024-02-07","cited_by_count":5,"area":null},{"id":"2406.01766","title":"How Does Gradient Descent Learn Features -- A Local Analysis for Regularized Two-Layer Neural Networks","created":"2024-06-03","cited_by_count":4,"area":null},{"id":"2505.21722","title":"Saddle-To-Saddle Dynamics in Deep ReLU Networks: Low-Rank Bias in the First Saddle Escape","created":"2025-05-27","cited_by_count":4,"area":null},{"id":"2311.02215","title":"Towards model-free RL algorithms that scale well with unstructured data","created":"2023-11-03","cited_by_count":3,"area":null},{"id":"2406.02157","title":"Online Learning and Information Exponents: On The Importance of Batch size, and Time/Complexity Tradeoffs","created":"2024-06-04","cited_by_count":3,"area":null},{"id":"2409.12446","title":"Neural Networks Generalize on Low Complexity Data","created":"2024-09-19","cited_by_count":3,"area":null},{"id":"2507.04448","title":"Transfer Learning in Infinite Width Feature Learning Networks","created":"2025-07-06","cited_by_count":3,"area":null},{"id":"2602.05184","title":"Towards Worst-Case Guarantees with Scale-Aware Interpretability","created":"2026-02-05","cited_by_count":3,"area":null},{"id":"2601.00455","title":"Deep Networks Learn Deep Hierarchical Models","created":"2026-01-01","cited_by_count":2,"area":null},{"id":"2210.02604","title":"Spectral Regularization Allows Data-frugal Learning over Combinatorial Spaces","created":"2022-10-05","cited_by_count":1,"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":"2401.12113","title":"Extracting Formulae in Many-Valued Logic from Deep Neural Networks","created":"2024-01-22","cited_by_count":1,"area":null},{"id":"2402.00094","title":"Deep Neural Networks: A Formulation Via Non-Archimedean Analysis","created":"2024-01-31","cited_by_count":1,"area":null},{"id":"2402.08948","title":"Mean-Field Analysis for Learning Subspace-Sparse Polynomials with Gaussian Input","created":"2024-02-14","cited_by_count":1,"area":null},{"id":"2405.17573","title":"Hamiltonian Mechanics of Feature Learning: Bottleneck Structure in Leaky ResNets","created":"2024-05-27","cited_by_count":1,"area":null},{"id":"2511.19328","title":"Understanding the Staged Dynamics of Transformers in Learning Latent Structure","created":"2025-11-24","cited_by_count":1,"area":null},{"id":"2303.01429","title":"Optimal transfer protocol by incremental layer defrosting","created":"2023-03-02","cited_by_count":0,"area":null},{"id":"2305.04347","title":"Interpreting Training Aspects of Deep-Learned Error-Correcting Codes","created":"2023-05-07","cited_by_count":0,"area":null},{"id":"2407.01656","title":"Absolute abstraction: a renormalisation group approach","created":"2024-07-01","cited_by_count":0,"area":null},{"id":"2412.06097","title":"Order Theory in the Context of Machine Learning","created":"2024-12-08","cited_by_count":0,"area":null},{"id":"2510.19382","title":"A Derandomization Framework for Structure Discovery: Applications in Neural Networks and Beyond","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2604.22951","title":"The Power of Power Law: Asymmetry Enables Compositional Reasoning","created":"2026-04-24","cited_by_count":0,"area":null},{"id":"2605.16913","title":"A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights","created":"2026-05-16","cited_by_count":0,"area":null},{"id":"2607.25200","title":"Algorithmic Separation between Constant-Depth and Logarithmic-Depth Neural Networks","created":"2026-07-28","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}],"next_cursor":null}