{"total":50,"rows":[{"id":"2109.11676","title":"Theory of overparametrization in quantum neural networks","created":"2021-09-23","cited_by_count":100,"area":null},{"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":"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":"2207.14266","title":"Cryptographic Hardness of Learning Halfspaces with Massart Noise","created":"2022-07-28","cited_by_count":25,"area":null},{"id":"2101.08303","title":"From Local Pseudorandom Generators to Hardness of Learning","created":"2021-01-20","cited_by_count":24,"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":"2102.05312","title":"Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise","created":"2021-02-10","cited_by_count":18,"area":null},{"id":"2101.01152","title":"Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noise","created":"2021-01-04","cited_by_count":17,"area":null},{"id":"2107.05582","title":"Forster Decomposition and Learning Halfspaces with Noise","created":"2021-07-12","cited_by_count":16,"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":"2402.07821","title":"On Computationally Efficient Multi-Class Calibration","created":"2024-02-12","cited_by_count":16,"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":"2407.00966","title":"Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension","created":"2024-07-01","cited_by_count":11,"area":null},{"id":"2104.09437","title":"Provable Robustness of Adversarial Training for Learning Halfspaces with Noise","created":"2021-04-19","cited_by_count":10,"area":null},{"id":"2106.07779","title":"Boosting in the Presence of Massart Noise","created":"2021-06-14","cited_by_count":10,"area":null},{"id":"2304.03370","title":"Reliable learning in challenging environments","created":"2023-04-06","cited_by_count":10,"area":null},{"id":"2405.02612","title":"Learning Linear Utility Functions From Pairwise Comparison Queries","created":"2024-05-04","cited_by_count":8,"area":null},{"id":"2410.01656","title":"Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians","created":"2024-10-02","cited_by_count":7,"area":null},{"id":"2411.13083","title":"Omnipredicting Single-Index Models with Multi-Index Models","created":"2024-11-20","cited_by_count":7,"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":"2201.07206","title":"Minimax Optimality (Probably) Doesn't Imply Distribution Learning for GANs","created":"2022-01-18","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":"2410.01186","title":"Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate","created":"2024-10-02","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":"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":"2504.10428","title":"Smoothed Analysis of Learning from Positive Samples","created":"2025-04-14","cited_by_count":3,"area":null},{"id":"2511.08791","title":"The Probably Approximately Correct Learning Model in Computational Learning Theory","created":"2025-11-11","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":"2201.13419","title":"Agnostic Learnability of Halfspaces via Logistic Loss","created":"2022-01-31","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":"2512.02279","title":"Limitations of Membership Queries in Testable Learning","created":"2025-12-01","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":"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":"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":"2602.21191","title":"Statistical Query Lower Bounds for Smoothed Agnostic Learning","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2306.05490","title":"Learnability with PAC Semantics for Multi-agent Beliefs","created":"2023-06-08","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":"2505.24737","title":"Adapting to Linear Separable Subsets with Large-Margin in Differentially Private Learning","created":"2025-05-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":"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.21428","title":"Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals","created":"2026-05-20","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":"2607.15645","title":"Testing Distributions Against Bounded Distinguishers","created":"2026-07-17","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}