{"total":30,"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":"2207.14266","title":"Cryptographic Hardness of Learning Halfspaces with Massart Noise","created":"2022-07-28","cited_by_count":25,"area":null},{"id":"2302.14853","title":"An Efficient Tester-Learner for Halfspaces","created":"2023-02-28","cited_by_count":18,"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":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14,"area":null},{"id":"2201.09818","title":"Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise","created":"2022-01-24","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":"2212.03008","title":"A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning","created":"2022-12-06","cited_by_count":11,"area":null},{"id":"2306.16352","title":"Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise","created":"2023-06-28","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":"2402.15995","title":"Improved Hardness Results for Learning Intersections of Halfspaces","created":"2024-02-25","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.09691","title":"A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise","created":"2025-01-16","cited_by_count":6,"area":null},{"id":"2210.09949","title":"SQ Lower Bounds for Learning Single Neurons with Massart Noise","created":"2022-10-18","cited_by_count":5,"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":"2106.07080","title":"Semi-verified PAC Learning from the Crowd","created":"2021-06-13","cited_by_count":4,"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":"2602.24178","title":"Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension","created":"2026-02-27","cited_by_count":3,"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":"2511.19398","title":"PTF Testing Lower Bounds for Non-Gaussian Component Analysis","created":"2025-11-24","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":"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":"2306.13057","title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","created":"2023-06-22","cited_by_count":0,"area":null},{"id":"2504.15251","title":"On Learning Parallel Pancakes with Mostly Uniform Weights","created":"2025-04-21","cited_by_count":0,"area":null},{"id":"2510.10665","title":"Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination","created":"2025-10-12","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":"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}],"next_cursor":null}