{"total":45,"rows":[{"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":"2102.05629","title":"Agnostic Proper Learning of Halfspaces under Gaussian Marginals","created":"2021-02-10","cited_by_count":21,"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":"2406.02742","title":"Tolerant Algorithms for Learning with Arbitrary Covariate Shift","created":"2024-06-04","cited_by_count":15,"area":null},{"id":"2404.02364","title":"Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds","created":"2024-04-02","cited_by_count":13,"area":null},{"id":"2102.06247","title":"Sample-Optimal PAC Learning of Halfspaces with Malicious Noise","created":"2021-02-11","cited_by_count":11,"area":null},{"id":"2205.14337","title":"List-Decodable Sparse Mean Estimation","created":"2022-05-28","cited_by_count":11,"area":null},{"id":"2208.10521","title":"Estimation Contracts for Outlier-Robust Geometric Perception","created":"2022-08-22","cited_by_count":11,"area":null},{"id":"2406.09373","title":"Efficient Discrepancy Testing for Learning with Distribution Shift","created":"2024-06-13","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":"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":"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":"2501.00508","title":"Active Learning of General Halfspaces: Label Queries vs Membership Queries","created":"2024-12-31","cited_by_count":6,"area":null},{"id":"2307.08438","title":"Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise","created":"2023-07-13","cited_by_count":5,"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.03570","title":"Learning Constant-Depth Circuits in Malicious Noise Models","created":"2024-11-06","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":"2501.09851","title":"Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random","created":"2025-01-16","cited_by_count":5,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2202.01269","title":"Robust Estimation for Nonparametric Families via Generative Adversarial Networks","created":"2022-02-02","cited_by_count":3,"area":null},{"id":"2306.00673","title":"Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise","created":"2023-06-01","cited_by_count":3,"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":"2505.13708","title":"Robust learning of halfspaces under log-concave marginals","created":"2025-05-19","cited_by_count":2,"area":null},{"id":"2506.03075","title":"Agnostic Learning under Targeted Poisoning: Optimal Rates and the Role of Randomness","created":"2025-06-03","cited_by_count":2,"area":null},{"id":"2506.05252","title":"Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning","created":"2025-06-05","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":"2405.07914","title":"Distribution Learning Meets Graph Structure Sampling","created":"2024-05-13","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":"2511.07244","title":"A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube","created":"2025-11-10","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":"2604.02555","title":"Robust Learning with Optimal Error","created":"2026-04-02","cited_by_count":1,"area":null},{"id":"2605.17251","title":"Iterative Chow Filtering for Learning with Distribution Shift","created":"2026-05-17","cited_by_count":1,"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":"2602.22300","title":"Testable Learning of General Halfspaces under Massart Noise","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2604.26446","title":"Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals","created":"2026-04-29","cited_by_count":0,"area":null},{"id":"2605.21428","title":"Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals","created":"2026-05-20","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.11149","title":"Efficiently Learning Drifting Halfspaces with Massart Noise","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2606.17215","title":"Sum-of-Squares Degree Barriers for the Reweighted-Hinge Method in Robust Halfspace Learning: A Christoffel-Function Characterization","created":"2026-06-15","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}