{"total":25,"rows":[{"id":"2110.11216","title":"User-friendly introduction to PAC-Bayes bounds","created":"2021-10-21","cited_by_count":239,"area":null},{"id":"2106.09683","title":"PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes","created":"2021-06-17","cited_by_count":31,"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":"2302.03421","title":"A unified recipe for deriving (time-uniform) PAC-Bayes bounds","created":"2023-02-07","cited_by_count":25,"area":null},{"id":"2207.00614","title":"Integral Probability Metrics PAC-Bayes Bounds","created":"2022-07-01","cited_by_count":19,"area":null},{"id":"2212.13556","title":"Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization","created":"2022-12-27","cited_by_count":19,"area":null},{"id":"2302.04925","title":"Information Theoretic Lower Bounds for Information Theoretic Upper Bounds","created":"2023-02-09","cited_by_count":17,"area":null},{"id":"2305.14311","title":"Statistical Indistinguishability of Learning Algorithms","created":"2023-05-23","cited_by_count":17,"area":null},{"id":"2306.12214","title":"More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity","created":"2023-06-21","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":"2105.01747","title":"Information Complexity and Generalization Bounds","created":"2021-05-04","cited_by_count":14,"area":null},{"id":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","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":"2310.18428","title":"The Bayesian Stability Zoo","created":"2023-10-27","cited_by_count":13,"area":null},{"id":"2206.04743","title":"Strong Memory Lower Bounds for Learning Natural Models","created":"2022-06-09","cited_by_count":11,"area":null},{"id":"2206.13257","title":"Finite Littlestone Dimension Implies Finite Information Complexity","created":"2022-06-27","cited_by_count":7,"area":null},{"id":"2305.19243","title":"Improving Generalization of Complex Models under Unbounded Loss Using PAC-Bayes Bounds","created":"2023-05-30","cited_by_count":6,"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":"2506.01855","title":"Trade-offs in Data Memorization via Strong Data Processing Inequalities","created":"2025-06-02","cited_by_count":6,"area":null},{"id":"2304.03996","title":"A Unified Characterization of Private Learnability via Graph Theory","created":"2023-04-08","cited_by_count":5,"area":null},{"id":"2212.05050","title":"The unstable formula theorem revisited via algorithms","created":"2022-12-09","cited_by_count":4,"area":null},{"id":"2506.12856","title":"Private List Learnability vs. Online List Learnability","created":"2025-06-15","cited_by_count":2,"area":null},{"id":"2509.25979","title":"Reconcile Certified Robustness and Accuracy for DNN-based Smoothed Majority Vote Classifier","created":"2025-09-30","cited_by_count":2,"area":null},{"id":"2307.09379","title":"Generalization within in silico screening","created":"2023-07-18","cited_by_count":0,"area":null},{"id":"2610.13123","title":"Why Heavy-Tailed Weight Spectra Predict Model Quality","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}