{"total":49,"rows":[{"id":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61,"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":"2204.07196","title":"Testing distributional assumptions of learning algorithms","created":"2022-04-14","cited_by_count":30,"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":"2108.08767","title":"Learning General Halfspaces with General Massart Noise under the Gaussian Distribution","created":"2021-08-19","cited_by_count":27,"area":null},{"id":"2211.13312","title":"A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity","created":"2022-11-23","cited_by_count":27,"area":null},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"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":"2102.05629","title":"Agnostic Proper Learning of Halfspaces under Gaussian Marginals","created":"2021-02-10","cited_by_count":21,"area":null},{"id":"2108.09805","title":"Efficient Algorithms for Learning from Coarse Labels","created":"2021-08-22","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":"2303.05485","title":"Efficient Testable Learning of Halfspaces with Adversarial Label Noise","created":"2023-03-09","cited_by_count":19,"area":null},{"id":"2302.14853","title":"An Efficient Tester-Learner for Halfspaces","created":"2023-02-28","cited_by_count":18,"area":null},{"id":"2305.11765","title":"Tester-Learners for Halfspaces: Universal Algorithms","created":"2023-05-19","cited_by_count":17,"area":null},{"id":"2305.14311","title":"Statistical Indistinguishability of Learning Algorithms","created":"2023-05-23","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":"2403.04744","title":"SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions","created":"2024-03-07","cited_by_count":13,"area":null},{"id":"2306.07892","title":"Robustly Learning a Single Neuron via Sharpness","created":"2023-06-13","cited_by_count":12,"area":null},{"id":"2402.13857","title":"Replicable Learning of Large-Margin Halfspaces","created":"2024-02-21","cited_by_count":12,"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":"2205.16003","title":"Learning (Very) Simple Generative Models Is Hard","created":"2022-05-31","cited_by_count":9,"area":null},{"id":"2411.07536","title":"Model Stealing for Any Low-Rank Language Model","created":"2024-11-12","cited_by_count":9,"area":null},{"id":"2405.15599","title":"On the Computational Landscape of Replicable Learning","created":"2024-05-24","cited_by_count":7,"area":null},{"id":"2403.02300","title":"Statistical Query Lower Bounds for Learning Truncated Gaussians","created":"2024-03-04","cited_by_count":6,"area":null},{"id":"2406.17989","title":"Learning Neural Networks with Sparse Activations","created":"2024-06-26","cited_by_count":6,"area":null},{"id":"2410.21426","title":"Sum-of-squares lower bounds for Non-Gaussian Component Analysis","created":"2024-10-28","cited_by_count":6,"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":"2411.14349","title":"Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals","created":"2024-11-21","cited_by_count":5,"area":null},{"id":"2411.05708","title":"Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models","created":"2024-11-08","cited_by_count":4,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","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":"2201.13419","title":"Agnostic Learnability of Halfspaces via Logistic Loss","created":"2022-01-31","cited_by_count":2,"area":null},{"id":"2203.02824","title":"Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs","created":"2022-03-05","cited_by_count":2,"area":null},{"id":"2411.06697","title":"Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2508.04670","title":"Robustly Learning Monotone Single-Index Models","created":"2025-08-06","cited_by_count":2,"area":null},{"id":"2511.11498","title":"Learning and Testing Convex Functions","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2105.03594","title":"Learning stochastic decision trees","created":"2021-05-08","cited_by_count":1,"area":null},{"id":"2309.11657","title":"Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions","created":"2023-09-20","cited_by_count":1,"area":null},{"id":"2310.15411","title":"Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach","created":"2023-10-23","cited_by_count":1,"area":null},{"id":"2411.11238","title":"Reliable Learning of Halfspaces under Gaussian Marginals","created":"2024-11-18","cited_by_count":1,"area":null},{"id":"2602.21191","title":"Statistical Query Lower Bounds for Smoothed Agnostic Learning","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2306.13057","title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","created":"2023-06-22","cited_by_count":0,"area":null},{"id":"2408.17165","title":"Efficient Testable Learning of General Halfspaces with Adversarial Label Noise","created":"2024-08-30","cited_by_count":0,"area":null},{"id":"2601.18115","title":"Robust Learning of a Group DRO Neuron","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2605.02350","title":"A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces","created":"2026-05-04","cited_by_count":0,"area":null},{"id":"2605.27594","title":"Proper Agnostic Learning of Functions of Halfspaces under Gaussian Marginals","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2609.17655","title":"Efficient Robust Learning at the Information-Theoretic Limit","created":"2026-09-15","cited_by_count":0,"area":null}],"next_cursor":null}