{"total":25,"rows":[{"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":"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":"2101.08303","title":"From Local Pseudorandom Generators to Hardness of Learning","created":"2021-01-20","cited_by_count":24,"area":null},{"id":"2310.09753","title":"When can transformers reason with abstract symbols?","created":"2023-10-15","cited_by_count":24,"area":null},{"id":"2108.09805","title":"Efficient Algorithms for Learning from Coarse Labels","created":"2021-08-22","cited_by_count":21,"area":null},{"id":"2106.10744","title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","created":"2021-06-20","cited_by_count":20,"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":"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":"2307.15804","title":"On Single Index Models beyond Gaussian Data","created":"2023-07-28","cited_by_count":17,"area":null},{"id":"2107.10370","title":"Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry II","created":"2021-07-21","cited_by_count":16,"area":null},{"id":"2110.05667","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks","created":"2021-10-12","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":"2202.08064","title":"Learning a Single Neuron for Non-monotonic Activation Functions","created":"2022-02-16","cited_by_count":13,"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":"2210.06088","title":"Annihilation of Spurious Minima in Two-Layer ReLU Networks","created":"2022-10-12","cited_by_count":9,"area":null},{"id":"2502.06443","title":"Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions","created":"2025-02-10","cited_by_count":8,"area":null},{"id":"2310.12660","title":"Gradient Descent Fails to Learn High-frequency Functions and Modular Arithmetic","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2312.16819","title":"Hidden Minima in Two-Layer ReLU Networks","created":"2023-12-28","cited_by_count":2,"area":null},{"id":"2310.01611","title":"Intractability of Learning the Discrete Logarithm with Gradient-Based Methods","created":"2023-10-02","cited_by_count":1,"area":null},{"id":"2607.06382","title":"A Function-Space Dichotomy for Compositional Learning: Exponential Sub-Optimality of the Neural Tangent Kernel","created":"2026-07-07","cited_by_count":1,"area":null},{"id":"2211.05730","title":"NEON: Enabling Efficient Support for Nonlinear Operations in Resistive RAM-based Neural Network Accelerators","created":"2022-11-10","cited_by_count":0,"area":null},{"id":"2403.02697","title":"Noise misleads rotation invariant algorithms on sparse targets","created":"2024-03-05","cited_by_count":0,"area":null},{"id":"2505.22158","title":"The informativeness of the gradient revisited","created":"2025-05-28","cited_by_count":0,"area":null},{"id":"2602.07732","title":"Efficient Adaptive Data Analysis over Dense Distributions","created":"2026-02-07","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}