{"total":60,"rows":[{"id":"2203.01550","title":"A Characterization of Multiclass Learnability","created":"2022-03-03","cited_by_count":67,"area":null},{"id":"2304.09167","title":"Optimal PAC Bounds Without Uniform Convergence","created":"2023-04-18","cited_by_count":33,"area":null},{"id":"2111.04746","title":"Realizable Learning is All You Need","created":"2021-11-08","cited_by_count":25,"area":null},{"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":"2211.04956","title":"A Characterization of List Learnability","created":"2022-11-07","cited_by_count":22,"area":null},{"id":"2209.07369","title":"Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization","created":"2022-09-15","cited_by_count":17,"area":null},{"id":"2303.15383","title":"List Online Classification","created":"2023-03-27","cited_by_count":16,"area":null},{"id":"2309.13692","title":"Regularization and Optimal Multiclass Learning","created":"2023-09-24","cited_by_count":15,"area":null},{"id":"2210.02297","title":"Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes","created":"2022-10-05","cited_by_count":14,"area":null},{"id":"2202.05420","title":"A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability","created":"2022-02-11","cited_by_count":13,"area":null},{"id":"2402.07568","title":"Weisfeiler-Leman at the margin: When more expressivity matters","created":"2024-02-12","cited_by_count":13,"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":"2604.24749","title":"The Optimal Sample Complexity of Multiclass and List Learning","created":"2026-04-27","cited_by_count":11,"area":null},{"id":"2403.10889","title":"List Sample Compression and Uniform Convergence","created":"2024-03-16","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":"2211.09101","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","created":"2022-11-16","cited_by_count":8,"area":null},{"id":"2308.06424","title":"Multiclass Learnability Does Not Imply Sample Compression","created":"2023-08-12","cited_by_count":6,"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":"2110.04763","title":"Fat-Shattering Dimension of $k$-fold Aggregations","created":"2021-10-10","cited_by_count":5,"area":null},{"id":"2303.17578","title":"Online Learning and Disambiguations of Partial Concept Classes","created":"2023-03-30","cited_by_count":5,"area":null},{"id":"2411.13029","title":"Probably Approximately Precision and Recall Learning","created":"2024-11-20","cited_by_count":5,"area":null},{"id":"2505.09167","title":"Online Learning of Neural Networks","created":"2025-05-14","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":"2410.23461","title":"Transformation-Invariant Learning and Theoretical Guarantees for OOD Generalization","created":"2024-10-30","cited_by_count":4,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","cited_by_count":4,"area":null},{"id":"2503.15294","title":"Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces","created":"2025-03-19","cited_by_count":4,"area":null},{"id":"2506.14143","title":"Leveraging Predictive Equivalence in Decision Trees","created":"2025-06-17","cited_by_count":4,"area":"lr"},{"id":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","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":"2506.16704","title":"How Many Domains Suffice for Domain Generalization? A Tight Characterization via the Domain Shattering Dimension","created":"2025-06-20","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":"2410.13012","title":"Sample Compression Scheme Reductions","created":"2024-10-16","cited_by_count":2,"area":null},{"id":"2504.09006","title":"Learning in Structured Stackelberg Games","created":"2025-04-11","cited_by_count":2,"area":null},{"id":"2504.10598","title":"Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks","created":"2025-04-14","cited_by_count":2,"area":null},{"id":"2506.00135","title":"Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2506.12856","title":"Private List Learnability vs. Online List Learnability","created":"2025-06-15","cited_by_count":2,"area":null},{"id":"2206.08014","title":"On Error and Compression Rates for Prototype Rules","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2501.08551","title":"A Theory of Optimistically Universal Online Learnability for General Concept Classes","created":"2025-01-15","cited_by_count":1,"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":"2511.02644","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","created":"2025-11-04","cited_by_count":1,"area":null},{"id":"2605.13684","title":"Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2605.30479","title":"Universal Multiclass Transductive Online Learning","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2606.06148","title":"Tight list replicability bounds via a novel sphere covering theorem","created":"2026-06-04","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":"2506.19810","title":"Ambiguous Online Learning","created":"2025-06-24","cited_by_count":0,"area":null},{"id":"2510.08382","title":"Characterizing the Multiclass Learnability of Forgiving 0-1 Loss Functions","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2602.11920","title":"Learning Conditional Averages","created":"2026-02-12","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.29819","title":"The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2607.08961","title":"NL-PAC: Specification Ambiguity and Certified Minimax Risk Floors in LLM-Mediated Supervision","created":"2026-07-09","cited_by_count":0,"area":null},{"id":"2607.10751","title":"The VC dimension of partial concept classes via Radon's theorem","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2608.02533","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","created":"2026-08-03","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.15402","title":"Towards a theory of inference-time alignment with unknown rewards","created":"2026-08-15","cited_by_count":0,"area":"alignment"},{"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.38834","title":"Optimal VC Dimension of Contrastive Learning with Margin","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.18935","title":"Delay Complexity Dimension: Learning with Delayed and Censored Labels","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}