{"url":"/task/generalization-bounds","name":"Generalization Bounds","slug":"generalization-bounds","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":686,"papers_with_code":161,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":161,"tagged_in_all":686,"items":[{"url":"/paper/bridging-theory-and-algorithm-for-domain","title":"Bridging Theory and Algorithm for Domain Adaptation","date":"2019-04-11","arxiv_id":"1904.05801","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/domain-generalization-needs-stochastic-weight","title":"SWAD: Domain Generalization by Seeking Flat Minima","date":"2021-02-17","arxiv_id":"2102.08604","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/stable-sample-compression-schemes-new","title":"Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound","date":"2020-11-09","arxiv_id":"2011.04586","repositories_listed":4,"syntology":null},{"url":"/paper/estimating-individual-treatment-effect","title":"Estimating individual treatment effect: generalization bounds and algorithms","date":"2016-06-13","arxiv_id":"1606.03976","repositories_listed":4,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/robust-fine-tuning-of-deep-neural-networks","title":"Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guarantees","date":"2022-06-06","arxiv_id":"2206.02659","repositories_listed":3,"syntology":{"n":11,"n_ran":7,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/learning-an-explicit-hyperparameter","title":"Learning an Explicit Hyperparameter Prediction Function Conditioned on Tasks","date":"2021-07-06","arxiv_id":"2107.02378","repositories_listed":3,"syntology":null},{"url":"/paper/pacoh-bayes-optimal-meta-learning-with-pac","title":"PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees","date":"2020-02-13","arxiv_id":"2002.05551","repositories_listed":3,"syntology":null},{"url":"/paper/a-surprising-linear-relationship-predicts","title":"A Surprising Linear Relationship Predicts Test Performance in Deep Networks","date":"2018-07-25","arxiv_id":"1807.09659","repositories_listed":3,"syntology":null},{"url":"/paper/optimal-auctions-through-deep-learning","title":"Optimal Auctions through Deep Learning: Advances in Differentiable Economics","date":"2017-06-12","arxiv_id":"1706.03459","repositories_listed":3,"syntology":null},{"url":"/paper/computing-nonvacuous-generalization-bounds","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","date":"2017-03-31","arxiv_id":"1703.11008","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":2}},{"url":"/paper/theoretical-insights-into-fine-tuning","title":"Theoretical Insights into Fine-Tuning Attention Mechanism: Generalization and Optimization","date":"2024-10-03","arxiv_id":"2410.02247","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/learning-to-warm-start-fixed-point","title":"Learning to Warm-Start Fixed-Point Optimization Algorithms","date":"2023-09-14","arxiv_id":"2309.07835","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/generalization-in-graph-neural-networks","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","date":"2023-02-09","arxiv_id":"2302.04451","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_unverified":6,"n_pointer_only":0}},{"url":"/paper/transformers-as-algorithms-generalization-and","title":"Transformers as Algorithms: Generalization and Stability in In-context Learning","date":"2023-01-17","arxiv_id":"2301.07067","repositories_listed":2,"syntology":null},{"url":"/paper/nico-towards-better-benchmarking-for-domain","title":"NICO++: Towards Better Benchmarking for Domain Generalization","date":"2022-04-17","arxiv_id":"2204.08040","repositories_listed":2,"syntology":null},{"url":"/paper/fast-interpretable-greedy-tree-sums-figs","title":"Fast Interpretable Greedy-Tree Sums","date":"2022-01-28","arxiv_id":"2201.11931","repositories_listed":2,"syntology":null},{"url":"/paper/personalized-federated-learning-through-local","title":"Personalized Federated Learning through Local Memorization","date":"2021-11-17","arxiv_id":"2111.09360","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":2}},{"url":"/paper/robust-generalization-despite-distribution","title":"Robust Generalization despite Distribution Shift via Minimum Discriminating Information","date":"2021-06-08","arxiv_id":"2106.04443","repositories_listed":2,"syntology":null},{"url":"/paper/provable-guarantees-for-self-supervised-deep","title":"Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Loss","date":"2021-06-08","arxiv_id":"2106.04156","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/function-approximation-via-sparse-random","title":"Generalization Bounds for Sparse Random Feature Expansions","date":"2021-03-04","arxiv_id":"2103.03191","repositories_listed":2,"syntology":null},{"url":"/paper/intrinsic-dimensionality-explains-the","title":"Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuning","date":"2020-12-22","arxiv_id":"2012.13255","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/minimax-classification-with-0-1-loss-and","title":"Minimax Classification with 0-1 Loss and Performance Guarantees","date":"2020-10-15","arxiv_id":"2010.07964","repositories_listed":2,"syntology":null},{"url":"/paper/generalization-guarantees-for-multi-modal","title":"Generalization Guarantees for Imitation Learning","date":"2020-08-05","arxiv_id":"2008.01913","repositories_listed":2,"syntology":null},{"url":"/paper/multi-task-reinforcement-learning-as-a-hidden","title":"Learning Robust State Abstractions for Hidden-Parameter Block MDPs","date":"2020-07-14","arxiv_id":"2007.07206","repositories_listed":2,"syntology":null},{"url":"/paper/pac-confidence-sets-for-deep-neural-networks-1","title":"PAC Confidence Sets for Deep Neural Networks via Calibrated Prediction","date":"2019-12-31","arxiv_id":"2001.00106","repositories_listed":2,"syntology":{"n":11,"n_ran":0,"n_unverified":11,"n_pointer_only":0}},{"url":"/paper/globally-convergent-newton-methods-for-ill","title":"Globally Convergent Newton Methods for Ill-conditioned Generalized Self-concordant Losses","date":"2019-07-03","arxiv_id":"1907.01771","repositories_listed":2,"syntology":null},{"url":"/paper/deep-multi-wasserstein-unsupervised-domain","title":"Deep multi-Wasserstein unsupervised domain adaptation","date":"2019-04-30","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-and-the-information-bottleneck","title":"Deep Learning and the Information Bottleneck Principle","date":"2015-03-09","arxiv_id":"1503.02406","repositories_listed":2,"syntology":null},{"url":"/paper/learning-where-to-learn-training-distribution","title":"Learning Where to Learn: Training Distribution Selection for Provable OOD Performance","date":"2025-05-27","arxiv_id":"2505.21626","repositories_listed":1,"syntology":null},{"url":"/paper/operator-learning-for-schrodinger-equation","title":"Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization","date":"2025-05-23","arxiv_id":"2505.18288","repositories_listed":1,"syntology":null}],"syntology_records":12,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}