{"total":36,"rows":[{"id":"2210.10749","title":"Transformers Learn Shortcuts to Automata","created":"2022-10-19","cited_by_count":268,"area":null},{"id":"2206.15144","title":"Neural Networks can Learn Representations with Gradient Descent","created":"2022-06-30","cited_by_count":161,"area":null},{"id":"2210.08649","title":"Loss Minimization through the Lens of Outcome Indistinguishability","created":"2022-10-16","cited_by_count":62,"area":null},{"id":"2105.14835","title":"Towards Lower Bounds on the Depth of ReLU Neural Networks","created":"2021-05-31","cited_by_count":56,"area":null},{"id":"2102.04401","title":"The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals","created":"2021-02-08","cited_by_count":52,"area":null},{"id":"2302.06512","title":"Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals","created":"2023-02-13","cited_by_count":31,"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":"2303.17045","title":"Training Neural Networks is NP-Hard in Fixed Dimension","created":"2023-03-29","cited_by_count":23,"area":null},{"id":"2110.02479","title":"Exponentially Many Local Minima in Quantum Neural Networks","created":"2021-10-06","cited_by_count":22,"area":null},{"id":"2402.04084","title":"Provably learning a multi-head attention layer","created":"2024-02-06","cited_by_count":21,"area":null},{"id":"2206.08918","title":"Learning a Single Neuron with Adversarial Label Noise via Gradient Descent","created":"2022-06-17","cited_by_count":20,"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":"2306.10615","title":"Agnostically Learning Single-Index Models using Omnipredictors","created":"2023-06-18","cited_by_count":16,"area":null},{"id":"2402.07821","title":"On Computationally Efficient Multi-Class Calibration","created":"2024-02-12","cited_by_count":16,"area":null},{"id":"2102.07802","title":"Efficient Learning with Arbitrary Covariate Shift","created":"2021-02-15","cited_by_count":15,"area":null},{"id":"2204.01368","title":"Training Fully Connected Neural Networks is $\\exists\\mathbb{R}$-Complete","created":"2022-04-04","cited_by_count":15,"area":null},{"id":"2101.02429","title":"Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time","created":"2021-01-07","cited_by_count":14,"area":null},{"id":"2304.10524","title":"Learning Narrow One-Hidden-Layer ReLU Networks","created":"2023-04-20","cited_by_count":14,"area":null},{"id":"2111.08117","title":"Neural networks with linear threshold activations: structure and algorithms","created":"2021-11-15","cited_by_count":12,"area":null},{"id":"2208.02711","title":"Agnostic Learning of General ReLU Activation Using Gradient Descent","created":"2022-08-04","cited_by_count":12,"area":null},{"id":"2210.13601","title":"Active Learning for Single Neuron Models with Lipschitz Non-Linearities","created":"2022-10-24","cited_by_count":12,"area":null},{"id":"2405.09312","title":"Agnostic Active Learning of Single Index Models with Linear Sample Complexity","created":"2024-05-15","cited_by_count":11,"area":null},{"id":"2109.04623","title":"ReLU Regression with Massart Noise","created":"2021-09-10","cited_by_count":10,"area":null},{"id":"2302.07426","title":"Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy","created":"2023-02-15","cited_by_count":10,"area":null},{"id":"2307.12496","title":"A faster and simpler algorithm for learning shallow networks","created":"2023-07-24","cited_by_count":7,"area":null},{"id":"2312.12657","title":"The Convex Landscape of Neural Networks: Characterizing Global Optima and Stationary Points via Lasso Models","created":"2023-12-19","cited_by_count":7,"area":null},{"id":"2411.15669","title":"Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models","created":"2024-11-23","cited_by_count":6,"area":null},{"id":"2307.12840","title":"Efficiently Learning One-Hidden-Layer ReLU Networks via Schur Polynomials","created":"2023-07-24","cited_by_count":4,"area":null},{"id":"2502.16021","title":"Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees","created":"2025-02-22","cited_by_count":4,"area":null},{"id":"2505.18131","title":"Leveraging KANs for Expedient Training of Multichannel MLPs via Preconditioning and Geometric Refinement","created":"2025-05-23","cited_by_count":4,"area":null},{"id":"2504.10428","title":"Smoothed Analysis of Learning from Positive Samples","created":"2025-04-14","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":"2305.16508","title":"Most Neural Networks Are Almost Learnable","created":"2023-05-25","cited_by_count":2,"area":null},{"id":"2411.11238","title":"Reliable Learning of Halfspaces under Gaussian Marginals","created":"2024-11-18","cited_by_count":1,"area":null},{"id":"2606.20937","title":"Learning through Internalization","created":"2026-06-18","cited_by_count":1,"area":null},{"id":"2505.12353","title":"Importance Sampling for Nonlinear Models","created":"2025-05-18","cited_by_count":0,"area":null}],"next_cursor":null}