{"total":53,"rows":[{"id":"2103.12024","title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$","created":"2021-03-22","cited_by_count":42,"area":null},{"id":"2304.09167","title":"Optimal PAC Bounds Without Uniform Convergence","created":"2023-04-18","cited_by_count":33,"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":"2301.12767","title":"Compression, Generalization and Learning","created":"2023-01-30","cited_by_count":21,"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":"2403.08831","title":"Majority-of-Three: The Simplest Optimal Learner?","created":"2024-03-12","cited_by_count":17,"area":null},{"id":"2103.00671","title":"Robust learning under clean-label attack","created":"2021-03-01","cited_by_count":15,"area":null},{"id":"2210.02713","title":"On Optimal Learning Under Targeted Data Poisoning","created":"2022-10-06","cited_by_count":14,"area":"safety"},{"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":"2212.09270","title":"The One-Inclusion Graph Algorithm is not Always Optimal","created":"2022-12-19","cited_by_count":11,"area":null},{"id":"2306.15744","title":"Ticketed Learning-Unlearning Schemes","created":"2023-06-27","cited_by_count":11,"area":"safety"},{"id":"2312.13978","title":"Metalearning with Very Few Samples Per Task","created":"2023-12-21","cited_by_count":11,"area":null},{"id":"2402.03254","title":"Minimum Description Length and Generalization Guarantees for Representation Learning","created":"2024-02-05","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":"2303.05369","title":"Data-dependent Generalization Bounds via Variable-Size Compressibility","created":"2023-03-09","cited_by_count":9,"area":null},{"id":"2304.03757","title":"Replicability and stability in learning","created":"2023-04-07","cited_by_count":8,"area":null},{"id":"2306.06247","title":"Online Learning with Set-Valued Feedback","created":"2023-06-09","cited_by_count":7,"area":null},{"id":"2310.20102","title":"Sample-Conditioned Hypothesis Stability Sharpens Information-Theoretic Generalization Bounds","created":"2023-10-31","cited_by_count":6,"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":"2502.09496","title":"On Agnostic PAC Learning in the Small Error Regime","created":"2025-02-13","cited_by_count":5,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","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":"2202.03045","title":"Metric-valued regression","created":"2022-02-07","cited_by_count":3,"area":null},{"id":"2302.07409","title":"Quantum Learning Theory Beyond Batch Binary Classification","created":"2023-02-15","cited_by_count":3,"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":"2406.15916","title":"Credit Attribution and Stable Compression","created":"2024-06-22","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":"2509.25135","title":"Learning in an Echo Chamber: Online Learning with Replay Adversary","created":"2025-09-29","cited_by_count":3,"area":null},{"id":"2410.13012","title":"Sample Compression Scheme Reductions","created":"2024-10-16","cited_by_count":2,"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":"2502.15540","title":"Generalization Guarantees for Representation Learning via Data-Dependent Gaussian Mixture Priors","created":"2025-02-21","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":"2601.21462","title":"Partial Feedback Online Learning","created":"2026-01-29","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":"2206.08014","title":"On Error and Compression Rates for Prototype Rules","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2411.17898","title":"On the ERM Principle in Meta-Learning","created":"2024-11-26","cited_by_count":1,"area":null},{"id":"2504.18455","title":"Multiview Representation Learning via Distributed Joint Latent Space Structuring","created":"2025-04-25","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":"2603.18551","title":"Learning Decision-Sufficient Representations for Linear Optimization","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2608.21579","title":"Sorting from Counterexamples","created":"2026-08-21","cited_by_count":1,"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":"2605.06004","title":"A Fine-Grained Understanding of Uniform Convergence for Halfspaces","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.13426","title":"Strategic PAC Learnability via Geometric Definability","created":"2026-05-13","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.04686","title":"The Sample Complexity of Distributionally Robust PAC Learning under Cressie--Read Divergences","created":"2026-08-05","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.29503","title":"Adversarial Online Classification with a Preview","created":"2026-08-30","cited_by_count":0,"area":null},{"id":"2609.21445","title":"Optimal Randomized Proper Online Learning","created":"2026-09-18","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.36030","title":"Preferent Compression Bounds Are Tight","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.13442","title":"Learning by Compression: Risk Estimates Attain the Law-of-Large-Numbers Rate","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}