{"total":47,"rows":[{"id":"2107.08444","title":"A Theory of PAC Learnability of Partial Concept Classes","created":"2021-07-18","cited_by_count":60,"area":null},{"id":"2111.05275","title":"Towards a Unified Information-Theoretic Framework for Generalization","created":"2021-11-09","cited_by_count":30,"area":null},{"id":"2102.02145","title":"Adversarially Robust Learning with Unknown Perturbation Sets","created":"2021-02-03","cited_by_count":24,"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":"2203.13421","title":"Learning Losses for Strategic Classification","created":"2022-03-25","cited_by_count":22,"area":null},{"id":"2102.01646","title":"Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games","created":"2021-02-02","cited_by_count":18,"area":null},{"id":"2308.06239","title":"Private Distribution Learning with Public Data: The View from Sample Compression","created":"2023-08-11","cited_by_count":14,"area":null},{"id":"2402.09327","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","created":"2024-02-14","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":"2403.10889","title":"List Sample Compression and Uniform Convergence","created":"2024-03-16","cited_by_count":10,"area":null},{"id":"2201.08704","title":"Adaptive Data Analysis with Correlated Observations","created":"2022-01-21","cited_by_count":9,"area":null},{"id":"2203.00849","title":"Adversarially Robust Learning with Tolerance","created":"2022-03-02","cited_by_count":9,"area":null},{"id":"2206.13254","title":"Sample compression schemes for balls in graphs","created":"2022-06-27","cited_by_count":9,"area":null},{"id":"2110.15168","title":"Labeled sample compression schemes for complexes of oriented matroids","created":"2021-10-28","cited_by_count":7,"area":null},{"id":"2307.04317","title":"Text Descriptions are Compressive and Invariant Representations for Visual Learning","created":"2023-07-10","cited_by_count":7,"area":null},{"id":"2406.10529","title":"A Theory of Interpretable Approximations","created":"2024-06-15","cited_by_count":7,"area":null},{"id":"2108.10037","title":"Primal and Dual Combinatorial Dimensions","created":"2021-08-23","cited_by_count":6,"area":null},{"id":"2308.06424","title":"Multiclass Learnability Does Not Imply Sample Compression","created":"2023-08-12","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":"2210.05455","title":"Unlabelled Sample Compression Schemes for Intersection-Closed Classes and Extremal Classes","created":"2022-10-11","cited_by_count":5,"area":null},{"id":"2405.17120","title":"Dual VC Dimension Obstructs Sample Compression by Embeddings","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2406.17814","title":"Distribution Learnability and Robustness","created":"2024-06-25","cited_by_count":4,"area":null},{"id":"2409.17932","title":"Sample Compression Unleashed: New Generalization Bounds for Real Valued Losses","created":"2024-09-26","cited_by_count":4,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","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":"2410.13577","title":"Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks","created":"2024-10-17","cited_by_count":3,"area":null},{"id":"2310.04812","title":"Applications of Littlestone dimension to query learning and to compression","created":"2023-10-07","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":"2509.00924","title":"Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data","created":"2025-08-31","cited_by_count":2,"area":null},{"id":"2510.17451","title":"The Parameterized Complexity of Computing the VC-Dimension","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2110.02456","title":"VC dimension of partially quantized neural networks in the overparametrized regime","created":"2021-10-06","cited_by_count":1,"area":null},{"id":"2112.12340","title":"Learning with distributional inverters","created":"2021-12-23","cited_by_count":1,"area":null},{"id":"2506.23186","title":"Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs","created":"2025-06-29","cited_by_count":1,"area":null},{"id":"2601.11265","title":"Sample-Near-Optimal Agnostic Boosting with Improved Running Time","created":"2026-01-16","cited_by_count":1,"area":null},{"id":"2603.18551","title":"Learning Decision-Sufficient Representations for Linear Optimization","created":"2026-03-19","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":"2608.13514","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","created":"2026-08-13","cited_by_count":1,"area":null},{"id":"2111.00062","title":"Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion","created":"2021-10-29","cited_by_count":0,"area":null},{"id":"2212.12631","title":"A Labelled Sample Compression Scheme of Size at Most Quadratic in the VC Dimension","created":"2022-12-24","cited_by_count":0,"area":null},{"id":"2305.17528","title":"Two Heads are Actually Better than One: Towards Better Adversarial Robustness via Transduction and Rejection","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2501.08887","title":"PAC Learnability of Scenario Decision-Making Algorithms: Necessary Conditions and Sufficient Conditions","created":"2025-01-15","cited_by_count":0,"area":null},{"id":"2509.06120","title":"If generative AI is the answer, what is the question?","created":"2025-09-07","cited_by_count":0,"area":null},{"id":"2604.25028","title":"Null Measurability at the Symmetrization Interface in VC Learning","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.12465","title":"High-arity Sample Compression","created":"2026-05-12","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},{"id":"2609.29696","title":"An Agnostic Sample Compression Scheme for Squared Loss of Near-Linear Size in the Fat-Shattering Dimension","created":"2026-08-31","cited_by_count":0,"area":null},{"id":"2610.18714","title":"On Collusion-Free Teaching in Planar Graphs","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}