{"total":52,"rows":[{"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":"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":"2102.05629","title":"Agnostic Proper Learning of Halfspaces under Gaussian Marginals","created":"2021-02-10","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":"2207.14030","title":"Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems","created":"2022-07-28","cited_by_count":16,"area":null},{"id":"2306.10615","title":"Agnostically Learning Single-Index Models using Omnipredictors","created":"2023-06-18","cited_by_count":16,"area":null},{"id":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14,"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":"2109.04623","title":"ReLU Regression with Massart Noise","created":"2021-09-10","cited_by_count":10,"area":null},{"id":"2410.13548","title":"Adaptive and oblivious statistical adversaries are equivalent","created":"2024-10-17","cited_by_count":9,"area":null},{"id":"2502.09525","title":"Robust Learning of Multi-index Models via Iterative Subspace Approximation","created":"2025-02-13","cited_by_count":9,"area":null},{"id":"2505.20177","title":"The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination","created":"2025-05-26","cited_by_count":7,"area":null},{"id":"2202.05096","title":"Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals","created":"2022-02-10","cited_by_count":6,"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":"2410.21426","title":"Sum-of-squares lower bounds for Non-Gaussian Component Analysis","created":"2024-10-28","cited_by_count":6,"area":null},{"id":"2501.00508","title":"Active Learning of General Halfspaces: Label Queries vs Membership Queries","created":"2024-12-31","cited_by_count":6,"area":null},{"id":"2410.01186","title":"Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate","created":"2024-10-02","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":"2206.04589","title":"Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models","created":"2022-06-09","cited_by_count":4,"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":"2310.11876","title":"SQ Lower Bounds for Learning Mixtures of Linear Classifiers","created":"2023-10-18","cited_by_count":4,"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":"2404.00529","title":"Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs","created":"2024-03-31","cited_by_count":3,"area":null},{"id":"2602.24178","title":"Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension","created":"2026-02-27","cited_by_count":3,"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":"2502.11413","title":"Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2505.13708","title":"Robust learning of halfspaces under log-concave marginals","created":"2025-05-19","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.19398","title":"PTF Testing Lower Bounds for Non-Gaussian Component Analysis","created":"2025-11-24","cited_by_count":2,"area":null},{"id":"2603.06027","title":"Agnostic learning in (almost) optimal time via Gaussian surface area","created":"2026-03-06","cited_by_count":2,"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":"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":"2605.18662","title":"Efficient and Noise-Tolerant PAC Learning of Multiclass Linear Classifiers","created":"2026-05-18","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":"2504.15244","title":"Faster Algorithms for Agnostically Learning Disjunctions and their Implications","created":"2025-04-21","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":"2602.01054","title":"The Quantum Learning Menagerie (A survey on Quantum learning for Classical concepts)","created":"2026-02-01","cited_by_count":0,"area":null},{"id":"2602.22300","title":"Testable Learning of General Halfspaces under Massart Noise","created":"2026-02-25","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":"2606.11130","title":"Robust Regression of General ReLUs with Queries","created":"2026-06-09","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}