{"total":21,"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":"2204.07196","title":"Testing distributional assumptions of learning algorithms","created":"2022-04-14","cited_by_count":30,"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":"2102.06247","title":"Sample-Optimal PAC Learning of Halfspaces with Malicious Noise","created":"2021-02-11","cited_by_count":11,"area":null},{"id":"2310.10098","title":"PAC Learning Linear Thresholds from Label Proportions","created":"2023-10-16","cited_by_count":10,"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":"2201.13419","title":"Agnostic Learnability of Halfspaces via Logistic Loss","created":"2022-01-31","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":"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.14090","title":"Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles","created":"2024-05-23","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":"2102.06277","title":"On Agnostic PAC Learning using $\\mathcal{L}_2$-polynomial Regression and Fourier-based Algorithms","created":"2021-02-11","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":"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":"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.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}],"next_cursor":null}