{"total":33,"rows":[{"id":"2307.03848","title":"Optimal Learners for Realizable Regression: PAC Learning and Online Learning","created":"2023-07-07","cited_by_count":23,"area":null},{"id":"2403.08831","title":"Majority-of-Three: The Simplest Optimal Learner?","created":"2024-03-12","cited_by_count":17,"area":null},{"id":"2309.13692","title":"Regularization and Optimal Multiclass Learning","created":"2023-09-24","cited_by_count":15,"area":null},{"id":"2312.04027","title":"The sample complexity of multi-distribution learning","created":"2023-12-07","cited_by_count":12,"area":null},{"id":"2407.19777","title":"Revisiting Agnostic PAC Learning","created":"2024-07-29","cited_by_count":11,"area":null},{"id":"2604.24749","title":"The Optimal Sample Complexity of Multiclass and List Learning","created":"2026-04-27","cited_by_count":11,"area":null},{"id":"2308.07588","title":"High-Probability Risk Bounds via Sequential Predictors","created":"2023-08-15","cited_by_count":10,"area":null},{"id":"2511.12659","title":"Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back","created":"2025-11-16","cited_by_count":9,"area":null},{"id":"2407.07765","title":"Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem","created":"2024-07-10","cited_by_count":6,"area":null},{"id":"2409.19218","title":"A Characterization of List Regression","created":"2024-09-28","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":"2507.17316","title":"Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probability","created":"2025-07-23","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":"2406.11667","title":"Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'?","created":"2024-06-17","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":"2402.10360","title":"Transductive Learning Is Compact","created":"2024-02-15","cited_by_count":2,"area":null},{"id":"2605.25678","title":"PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting","created":"2026-05-25","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":"2502.00607","title":"PAC Learning is just Bipartite Matching (Sort of)","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2506.14110","title":"Universal rates of ERM for agnostic learning","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2606.04423","title":"The price of multi-group transductive learning","created":"2026-06-03","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":"2603.02043","title":"Multiplicative Oracle Inequalities for Transductive Learning via Level-Set Aggregation","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2603.07221","title":"Margin in Abstract Spaces","created":"2026-03-07","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":"2608.08416","title":"Optimal Learning Under Tsybakov Noise","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2608.10869","title":"Optimistic Rates for Multiclass PAC Learning","created":"2026-08-11","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":"2608.26516","title":"Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning","created":"2026-08-27","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}