{"total":16,"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":"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":"2410.13548","title":"Adaptive and oblivious statistical adversaries are equivalent","created":"2024-10-17","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":"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":"2206.08899","title":"Popular decision tree algorithms are provably noise tolerant","created":"2022-06-17","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":"2502.05073","title":"Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions","created":"2025-02-07","cited_by_count":2,"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":"2203.12246","title":"New Distinguishers for Negation-Limited Weak Pseudorandom Functions","created":"2022-03-23","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":"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":"2609.17655","title":"Efficient Robust Learning at the Information-Theoretic Limit","created":"2026-09-15","cited_by_count":0,"area":null}],"next_cursor":null}