{"total":35,"rows":[{"id":"2102.08446","title":"Smoothed Analysis with Adaptive Adversaries","created":"2021-02-16","cited_by_count":57,"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":"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":"2302.14853","title":"An Efficient Tester-Learner for Halfspaces","created":"2023-02-28","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":"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":"2106.07779","title":"Boosting in the Presence of Massart Noise","created":"2021-06-14","cited_by_count":10,"area":null},{"id":"2109.04623","title":"ReLU Regression with Massart Noise","created":"2021-09-10","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":"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":"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":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2511.17782","title":"Smoothed Agnostic Learning of Halfspaces over the Hypercube","created":"2025-11-21","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":"2309.14240","title":"Learning to Abstain From Uninformative Data","created":"2023-09-25","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":"2512.01783","title":"The Active and Noise-Tolerant Strategic Perceptron","created":"2025-12-01","cited_by_count":2,"area":null},{"id":"2209.08319","title":"On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data","created":"2022-09-17","cited_by_count":1,"area":null},{"id":"2308.03142","title":"Self-Directed Linear Classification","created":"2023-08-06","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":"2405.12958","title":"Online Learning of Halfspaces with Massart Noise","created":"2024-05-21","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":"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":"2410.16573","title":"Enhancing PAC Learning of Half spaces Through Robust Optimization Techniques","created":"2024-10-21","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":"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":"2608.08416","title":"Optimal Learning Under Tsybakov Noise","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2608.13601","title":"Hard Cases, Bad Labels: Testing Error Exposure and Error Location in Uncertainty Sampling Under Bounded Label Noise","created":"2026-08-05","cited_by_count":0,"area":null}],"next_cursor":null}