{"total":34,"rows":[{"id":"2304.09167","title":"Optimal PAC Bounds Without Uniform Convergence","created":"2023-04-18","cited_by_count":33,"area":null},{"id":"2301.12600","title":"Bagging Provides Assumption-free Stability","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2403.08831","title":"Majority-of-Three: The Simplest Optimal Learner?","created":"2024-03-12","cited_by_count":17,"area":null},{"id":"2312.04027","title":"The sample complexity of multi-distribution learning","created":"2023-12-07","cited_by_count":12,"area":null},{"id":"2212.09270","title":"The One-Inclusion Graph Algorithm is not Always Optimal","created":"2022-12-19","cited_by_count":11,"area":null},{"id":"2407.19777","title":"Revisiting Agnostic PAC Learning","created":"2024-07-29","cited_by_count":11,"area":null},{"id":"2301.09627","title":"The Impossibility of Parallelizing Boosting","created":"2023-01-23","cited_by_count":7,"area":null},{"id":"2301.11571","title":"AdaBoost is not an Optimal Weak to Strong Learner","created":"2023-01-27","cited_by_count":6,"area":null},{"id":"2311.17885","title":"Are Ensembles Getting Better all the Time?","created":"2023-11-29","cited_by_count":6,"area":null},{"id":"2502.09496","title":"On Agnostic PAC Learning in the Small Error Regime","created":"2025-02-13","cited_by_count":5,"area":null},{"id":"2405.05190","title":"Is Transductive Learning Equivalent to PAC Learning?","created":"2024-05-08","cited_by_count":4,"area":null},{"id":"2502.16462","title":"Improved Margin Generalization Bounds for Voting Classifiers","created":"2025-02-23","cited_by_count":4,"area":null},{"id":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2606.13614","title":"Majority-of-Three is Optimal","created":"2026-06-11","cited_by_count":4,"area":null},{"id":"2402.02976","title":"Boosting, Voting Classifiers and Randomized Sample Compression Schemes","created":"2024-02-05","cited_by_count":3,"area":null},{"id":"2402.15145","title":"The Cost of Parallelizing Boosting","created":"2024-02-23","cited_by_count":3,"area":null},{"id":"2408.17148","title":"The Many Faces of Optimal Weak-to-Strong Learning","created":"2024-08-30","cited_by_count":3,"area":null},{"id":"2410.22749","title":"Understanding Aggregations of Proper Learners in Multiclass Classification","created":"2024-10-30","cited_by_count":3,"area":null},{"id":"2502.10359","title":"Proper Learnability and the Role of Unlabeled Data","created":"2025-02-14","cited_by_count":2,"area":null},{"id":"2511.20407","title":"Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets","created":"2025-11-25","cited_by_count":2,"area":null},{"id":"2602.19552","title":"The Sample Complexity of Replicable Realizable PAC Learning","created":"2026-02-23","cited_by_count":2,"area":null},{"id":"2608.06363","title":"An Optimal Agnostic PAC Algorithm","created":"2026-08-06","cited_by_count":2,"area":null},{"id":"2506.14110","title":"Universal rates of ERM for agnostic learning","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2511.15507","title":"Sample-Adaptivity Tradeoff in On-Demand Sampling","created":"2025-11-19","cited_by_count":1,"area":null},{"id":"2608.13514","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","created":"2026-08-13","cited_by_count":1,"area":null},{"id":"2507.18903","title":"PAC-Causal Learnability: From Identification to Finite-Sample Guarantees","created":"2025-07-25","cited_by_count":0,"area":null},{"id":"2603.23208","title":"A One-Inclusion Graph Approach to Multi-Group Learning","created":"2026-03-24","cited_by_count":0,"area":null},{"id":"2605.06004","title":"A Fine-Grained Understanding of Uniform Convergence for Halfspaces","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.29819","title":"The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.28309","title":"Surprises in Proper Positive-Only Learning","created":"2026-06-26","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.20480","title":"When Clean Data Hurts: Learning with Monotone Corruptions Beyond Binary Classification","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2609.10886","title":"Relatively Smart II: Tractable or Semi-Supervised Instance-Optimal Learning","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2609.24260","title":"Adversarially Robust PAC Learning with Optimal VC Rates","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}