{"total":25,"rows":[{"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":"2403.08831","title":"Majority-of-Three: The Simplest Optimal Learner?","created":"2024-03-12","cited_by_count":17,"area":null},{"id":"2206.14800","title":"Understanding Generalization via Leave-One-Out Conditional Mutual Information","created":"2022-06-29","cited_by_count":16,"area":null},{"id":"2103.00671","title":"Robust learning under clean-label attack","created":"2021-03-01","cited_by_count":15,"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":"2207.05377","title":"On the Generalization for Transfer Learning: An Information-Theoretic Analysis","created":"2022-07-12","cited_by_count":11,"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.13119","title":"Adversarial Resilience in Sequential Prediction via Abstention","created":"2023-06-22","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":"2205.03131","title":"Fast Rate Generalization Error Bounds: Variations on a Theme","created":"2022-05-06","cited_by_count":6,"area":null},{"id":"2303.14658","title":"Fast Rate Information-theoretic Bounds on Generalization Errors","created":"2023-03-26","cited_by_count":5,"area":null},{"id":"2306.17151","title":"Local Risk Bounds for Statistical Aggregation","created":"2023-06-29","cited_by_count":3,"area":null},{"id":"2405.02745","title":"Understanding Server-Assisted Federated Learning in the Presence of Incomplete Client Participation","created":"2024-05-04","cited_by_count":3,"area":null},{"id":"2412.02810","title":"Universal Rates of Empirical Risk Minimization","created":"2024-12-03","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":"2411.17898","title":"On the ERM Principle in Meta-Learning","created":"2024-11-26","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":"2606.04423","title":"The price of multi-group transductive learning","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2606.18236","title":"Sign-Rank, Index, and List Replicability: Connections and Separations","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2605.13426","title":"Strategic PAC Learnability via Geometric Definability","created":"2026-05-13","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.14020","title":"When Does More Correct Data Hurt? Insertion-Stability and the Limits of Dimension-Based Theory","created":"2026-08-14","cited_by_count":0,"area":null},{"id":"2610.17956","title":"Learning Distributions from Samples and Qualities","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}