{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/generalization-bounds/papers/ran/1","list_of":"/task/generalization-bounds","task":"Generalization Bounds","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,55],"of":55,"counts":{"archive_papers_tagged":686,"with_a_code_link":161,"where_syntology_ran_a_sample":55,"not_listed_spam_title":0,"listed":686,"listed_where_code_ran":55,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":45,"every_run_a_failure_of_syntologys_instrument":10,"listed_with_a_run_with_no_instrument_failure":45,"listed_every_run_a_failure_of_syntologys_instrument":10,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/generalization-bounds/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/unveiling-the-mechanisms-of-explicit-cot","slug":"unveiling-the-mechanisms-of-explicit-cot","title":"Unveiling the Mechanisms of Explicit CoT Training: How CoT Enhances Reasoning Generalization","date":"2025-02-07","arxiv_id":"2502.04667","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-the-mechanisms-of-explicit-cot#ran","syntology_url":"https://syntology.ai/paper/2502.04667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04667"}},"official":{"repos":["chen123ctrls/t-cotmechanism"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-complexity-dynamics-of-grokking","slug":"the-complexity-dynamics-of-grokking","title":"The Complexity Dynamics of Grokking","date":"2024-12-13","arxiv_id":"2412.09810","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-complexity-dynamics-of-grokking#ran","syntology_url":"https://syntology.ai/paper/2412.09810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09810"}},"official":{"repos":["brantondemoss/GrokkingComplexity"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-bounds-via-conditional-f","slug":"generalization-bounds-via-conditional-f","title":"Generalization Bounds via Conditional $f$-Information","date":"2024-10-30","arxiv_id":"2410.22887","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalization-bounds-via-conditional-f#ran","syntology_url":"https://syntology.ai/paper/2410.22887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22887"}},"official":{"repos":["ZiqiaoWangGeothe/Conditional-f-Information-Bound"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretical-insights-into-fine-tuning","slug":"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":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/theoretical-insights-into-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2410.02247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02247"}},"official":{"repos":["chen123ctrls/efficientft","chen123CtrlS/LightweightAtt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-in-context-learning-performance","slug":"enhancing-in-context-learning-performance","title":"Enhancing In-Context Learning Performance with just SVD-Based Weight Pruning: A Theoretical Perspective","date":"2024-06-06","arxiv_id":"2406.03768","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-in-context-learning-performance#ran","syntology_url":"https://syntology.ai/paper/2406.03768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03768"}},"official":{"repos":["chen123ctrls/enhancingicl_svdpruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-bound-and-new-algorithm-for","slug":"generalization-bound-and-new-algorithm-for","title":"Generalization Bound and New Algorithm for Clean-Label Backdoor Attack","date":"2024-06-02","arxiv_id":"2406.00588","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalization-bound-and-new-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2406.00588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00588"}},"official":{"repos":["hong-xian/backdoor-attack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-bayesian-generalization-bounds-for-2","slug":"pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","arxiv_id":"2405.06418","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pac-bayesian-generalization-bounds-for-2#ran","syntology_url":"https://syntology.ai/paper/2405.06418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06418"}},"official":{"repos":["bdi-lab/reed"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/do-generated-data-always-help-contrastive","slug":"do-generated-data-always-help-contrastive","title":"Do Generated Data Always Help Contrastive Learning?","date":"2024-03-19","arxiv_id":"2403.12448","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-generated-data-always-help-contrastive#ran","syntology_url":"https://syntology.ai/paper/2403.12448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12448"}},"official":{"repos":["pku-ml/adainf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/more-flexible-pac-bayesian-meta-learning-by","slug":"more-flexible-pac-bayesian-meta-learning-by","title":"More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms","date":"2024-02-06","arxiv_id":"2402.04054","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":2,"n_honours":7,"n_violates":0,"n_no_contract":0,"n_pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 7 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/more-flexible-pac-bayesian-meta-learning-by#ran","syntology_url":"https://syntology.ai/paper/2402.04054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04054"}},"official":{"repos":["hzakerinia/flexible-pac-bayes-meta-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-understanding-the-word-sensitivity-of","slug":"towards-understanding-the-word-sensitivity-of","title":"Towards Understanding the Word Sensitivity of Attention Layers: A Study via Random Features","date":"2024-02-05","arxiv_id":"2402.02969","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-understanding-the-word-sensitivity-of#ran","syntology_url":"https://syntology.ai/paper/2402.02969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02969"}},"official":{"repos":["simone-bombari/attention-sensitivity"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/minimum-description-length-and-generalization-1","slug":"minimum-description-length-and-generalization-1","title":"Minimum Description Length and Generalization Guarantees for Representation Learning","date":"2024-02-05","arxiv_id":"2402.03254","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/minimum-description-length-and-generalization-1#ran","syntology_url":"https://syntology.ai/paper/2402.03254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03254"}},"official":{"repos":["piotrkrasnowski/mdl_and_generalization_guarantees_for_representation_learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/non-vacuous-generalization-bounds-for-large","slug":"non-vacuous-generalization-bounds-for-large","title":"Non-Vacuous Generalization Bounds for Large Language Models","date":"2023-12-28","arxiv_id":"2312.17173","repositories_listed":1,"syntology":{"n":38,"n_ran":13,"n_constructed":7,"n_ran_checked":10,"n_instrument":3,"n_unverified":25,"n_honours":1,"n_violates":2,"n_no_contract":7,"n_pointer_only":0,"phrase":"13 ran (of which 7 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 25 unverified","sample_list":"/paper/non-vacuous-generalization-bounds-for-large#ran","syntology_url":"https://syntology.ai/paper/2312.17173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.17173"}},"official":{"repos":["sanaelotfi/sublora-bounds-for-llms"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":7,"n_ran_no_instrument_failure":10,"n_unverified":25,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-length-independent-norm-based","slug":"sequence-length-independent-norm-based","title":"Sequence Length Independent Norm-Based Generalization Bounds for Transformers","date":"2023-10-19","arxiv_id":"2310.13088","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-length-independent-norm-based#ran","syntology_url":"https://syntology.ai/paper/2310.13088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13088"}},"official":{"repos":["traugerjacob/transformer-gen-bounds"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-path-norm-toolkit-for-modern-networks","slug":"a-path-norm-toolkit-for-modern-networks","title":"A path-norm toolkit for modern networks: consequences, promises and challenges","date":"2023-10-02","arxiv_id":"2310.01225","repositories_listed":1,"syntology":{"n":20,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-path-norm-toolkit-for-modern-networks#ran","syntology_url":"https://syntology.ai/paper/2310.01225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01225"}},"official":{"repos":["agonon/pathnorm_toolkit"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-warm-start-fixed-point","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-warm-start-fixed-point#ran","syntology_url":"https://syntology.ai/paper/2309.07835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07835"}},"official":{"repos":["stellatogrp/l2ws_fixed_point"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/implicit-graph-neural-diffusion-based-on","slug":"implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","arxiv_id":"2308.03306","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graph-neural-diffusion-based-on#ran","syntology_url":"https://syntology.ai/paper/2308.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03306"}},"official":{"repos":["guoji-fu/dignn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-expressive-priors-for-generalization","slug":"learning-expressive-priors-for-generalization","title":"Learning Expressive Priors for Generalization and Uncertainty Estimation in Neural Networks","date":"2023-07-15","arxiv_id":"2307.07753","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-expressive-priors-for-generalization#ran","syntology_url":"https://syntology.ai/paper/2307.07753","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07753"}},"official":{"repos":["dlr-rm/bpnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/how-does-information-bottleneck-help-deep","slug":"how-does-information-bottleneck-help-deep","title":"How Does Information Bottleneck Help Deep Learning?","date":"2023-05-30","arxiv_id":"2305.18887","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/how-does-information-bottleneck-help-deep#ran","syntology_url":"https://syntology.ai/paper/2305.18887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18887"}},"official":{"repos":["xu-ji/information-bottleneck"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/energy-guided-entropic-neural-optimal","slug":"energy-guided-entropic-neural-optimal","title":"Energy-guided Entropic Neural Optimal Transport","date":"2023-04-12","arxiv_id":"2304.06094","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/energy-guided-entropic-neural-optimal#ran","syntology_url":"https://syntology.ai/paper/2304.06094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.06094"}},"official":{"repos":["petrmokrov/energy-guided-entropic-ot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/algorithm-dependent-bounds-for-representation","slug":"algorithm-dependent-bounds-for-representation","title":"Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptation","date":"2023-04-04","arxiv_id":"2304.02064","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/algorithm-dependent-bounds-for-representation#ran","syntology_url":"https://syntology.ai/paper/2304.02064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02064"}},"official":{"repos":["livreq/imda"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transformed-low-rank-parameterization-can","slug":"transformed-low-rank-parameterization-can","title":"Transformed Low-Rank Parameterization Can Help Robust Generalization for Tensor Neural Networks","date":"2023-03-01","arxiv_id":"2303.00196","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transformed-low-rank-parameterization-can#ran","syntology_url":"https://syntology.ai/paper/2303.00196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.00196"}},"official":{"repos":["pingzaiwang/Analysis4TNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-bayesian-generalization-bounds-for-1","slug":"pac-bayesian-generalization-bounds-for-1","title":"PAC-Bayesian Generalization Bounds for Adversarial Generative Models","date":"2023-02-17","arxiv_id":"2302.08942","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pac-bayesian-generalization-bounds-for-1#ran","syntology_url":"https://syntology.ai/paper/2302.08942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08942"}},"official":{"repos":["diarra2339/pac-bayes-wgan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-in-graph-neural-networks","slug":"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":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 4 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/generalization-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2302.04451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04451"}},"official":{"repos":["neu-statsml-research/generalization-in-graph-neural-networks","virtuosoresearch/generalization-in-graph-neural-networks"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tighter-information-theoretic-generalization","slug":"tighter-information-theoretic-generalization","title":"Tighter Information-Theoretic Generalization Bounds from Supersamples","date":"2023-02-05","arxiv_id":"2302.02432","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tighter-information-theoretic-generalization#ran","syntology_url":"https://syntology.ai/paper/2302.02432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02432"}},"official":{"repos":["ZiqiaoWangGeothe/ld-single-CMI"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text","unlocated"]}}},{"url":"/paper/pac-bayes-compression-bounds-so-tight-that","slug":"pac-bayes-compression-bounds-so-tight-that","title":"PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization","date":"2022-11-24","arxiv_id":"2211.13609","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pac-bayes-compression-bounds-so-tight-that#ran","syntology_url":"https://syntology.ai/paper/2211.13609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13609"}},"official":{"repos":["activatedgeek/tight-pac-bayes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/umix-improving-importance-weighting-for","slug":"umix-improving-importance-weighting-for","title":"UMIX: Improving Importance Weighting for Subpopulation Shift via Uncertainty-Aware Mixup","date":"2022-09-19","arxiv_id":"2209.08928","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/umix-improving-importance-weighting-for#ran","syntology_url":"https://syntology.ai/paper/2209.08928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08928"}},"official":{"repos":["tencentailabhealthcare/umix"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/integral-probability-metrics-pac-bayes-bounds","slug":"integral-probability-metrics-pac-bayes-bounds","title":"Integral Probability Metrics PAC-Bayes Bounds","date":"2022-07-01","arxiv_id":"2207.00614","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/integral-probability-metrics-pac-bayes-bounds#ran","syntology_url":"https://syntology.ai/paper/2207.00614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.00614"}},"official":{"repos":["ron-amit/pac_bayes_reg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/shedding-a-pac-bayesian-light-on-adaptive","slug":"shedding-a-pac-bayesian-light-on-adaptive","title":"Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein Distances","date":"2022-06-07","arxiv_id":"2206.03230","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/shedding-a-pac-bayesian-light-on-adaptive#ran","syntology_url":"https://syntology.ai/paper/2206.03230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03230"}},"official":{"repos":["rubenohana/pac-bayesian_sliced-wasserstein"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-fine-tuning-of-deep-neural-networks","slug":"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":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-fine-tuning-of-deep-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.02659","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02659"}},"official":{"repos":["nerdsresearch/robust-fine-tuning","neu-statsml-research/robust-fine-tuning","virtuosoresearch/robust-fine-tuning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/chaotic-regularization-and-heavy-tailed","slug":"chaotic-regularization-and-heavy-tailed","title":"Chaotic Regularization and Heavy-Tailed Limits for Deterministic Gradient Descent","date":"2022-05-23","arxiv_id":"2205.11361","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/chaotic-regularization-and-heavy-tailed#ran","syntology_url":"https://syntology.ai/paper/2205.11361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11361"}},"official":{"repos":["shoelim/mpgd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-stochastic-and-online-gradient","slug":"simple-stochastic-and-online-gradient","title":"Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise Learning","date":"2021-11-23","arxiv_id":"2111.12050","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-stochastic-and-online-gradient#ran","syntology_url":"https://syntology.ai/paper/2111.12050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12050"}},"official":{"repos":["zhenhuan-yang/simple-pairwise"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-the-generalization-benefit-of","slug":"understanding-the-generalization-benefit-of","title":"Understanding the Generalization Benefit of Model Invariance from a Data Perspective","date":"2021-11-10","arxiv_id":"2111.05529","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/understanding-the-generalization-benefit-of#ran","syntology_url":"https://syntology.ai/paper/2111.05529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05529"}},"official":{"repos":["bangann/understanding-invariance"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generalization-bounds-for-meta-learning-an","slug":"generalization-bounds-for-meta-learning-an","title":"Generalization Bounds For Meta-Learning: An Information-Theoretic Analysis","date":"2021-09-29","arxiv_id":"2109.14595","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalization-bounds-for-meta-learning-an#ran","syntology_url":"https://syntology.ai/paper/2109.14595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14595"}},"official":{"repos":["livreq/meta-sgld"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/provable-guarantees-for-self-supervised-deep","slug":"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_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/provable-guarantees-for-self-supervised-deep#ran","syntology_url":"https://syntology.ai/paper/2106.04156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04156"}},"official":null}},{"url":"/paper/measuring-generalization-with-optimal","slug":"measuring-generalization-with-optimal","title":"Measuring Generalization with Optimal Transport","date":"2021-06-07","arxiv_id":"2106.03314","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/measuring-generalization-with-optimal#ran","syntology_url":"https://syntology.ai/paper/2106.03314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03314"}},"official":{"repos":["chingyaoc/kV-Margin"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/ratt-leveraging-unlabeled-data-to-guarantee","slug":"ratt-leveraging-unlabeled-data-to-guarantee","title":"RATT: Leveraging Unlabeled Data to Guarantee Generalization","date":"2021-05-01","arxiv_id":"2105.00303","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/ratt-leveraging-unlabeled-data-to-guarantee#ran","syntology_url":"https://syntology.ai/paper/2105.00303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.00303"}},"official":{"repos":["acmi-lab/ratt_generalization_bound"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/self-bounding-majority-vote-learning","slug":"self-bounding-majority-vote-learning","title":"Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound","date":"2021-04-28","arxiv_id":"2104.13626","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-bounding-majority-vote-learning#ran","syntology_url":"https://syntology.ai/paper/2104.13626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.13626"}},"official":{"repos":["paulviallard/ecml21-pb-cbound"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-generalization-needs-stochastic-weight","slug":"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_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/domain-generalization-needs-stochastic-weight#ran","syntology_url":"https://syntology.ai/paper/2102.08604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08604"}},"official":{"repos":["khanrc/swad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/intrinsic-dimensionality-explains-the","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intrinsic-dimensionality-explains-the#ran","syntology_url":"https://syntology.ai/paper/2012.13255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.13255"}},"official":{"repos":["rabeehk/compacter"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/instance-based-generalization-in","slug":"instance-based-generalization-in","title":"Instance based Generalization in Reinforcement Learning","date":"2020-11-02","arxiv_id":"2011.01089","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":4,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/instance-based-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2011.01089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01089"}},"official":{"repos":["MartinBertran/InstanceAgnosticPolicyEnsembles"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/in-search-of-robust-measures-of","slug":"in-search-of-robust-measures-of","title":"In Search of Robust Measures of Generalization","date":"2020-10-22","arxiv_id":"2010.11924","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/in-search-of-robust-measures-of#ran","syntology_url":"https://syntology.ai/paper/2010.11924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11924"}},"official":{"repos":["nitarshan/robust-generalization-measures"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/selective-classification-via-one-sided","slug":"selective-classification-via-one-sided","title":"Selective Classification via One-Sided Prediction","date":"2020-10-15","arxiv_id":"2010.07853","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selective-classification-via-one-sided#ran","syntology_url":"https://syntology.ai/paper/2010.07853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07853"}},"official":{"repos":["anilkagak2/SelectiveClassification_One_Sided_Prediction"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/covariate-shift-adaptation-in-high","slug":"covariate-shift-adaptation-in-high","title":"Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptation","date":"2020-10-02","arxiv_id":"2010.01184","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/covariate-shift-adaptation-in-high#ran","syntology_url":"https://syntology.ai/paper/2010.01184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01184"}},"official":{"repos":["felipemaiapolo/infoselect"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/hausdorff-dimension-stochastic-differential","slug":"hausdorff-dimension-stochastic-differential","title":"Hausdorff Dimension, Heavy Tails, and Generalization in Neural Networks","date":"2020-06-16","arxiv_id":"2006.09313","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hausdorff-dimension-stochastic-differential#ran","syntology_url":"https://syntology.ai/paper/2006.09313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09313"}},"official":{"repos":["umutsimsekli/Hausdorff-Dimension-and-Generalization"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-generalization-by-controlling-label","slug":"improving-generalization-by-controlling-label","title":"Improving Generalization by Controlling Label-Noise Information in Neural Network Weights","date":"2020-02-19","arxiv_id":"2002.07933","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-generalization-by-controlling-label#ran","syntology_url":"https://syntology.ai/paper/2002.07933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07933"}},"official":{"repos":["hrayrhar/limit-label-memorization"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-predictor-on-linearly-generated-data","slug":"linear-predictor-on-linearly-generated-data","title":"Linear predictor on linearly-generated data with missing values: non consistency and solutions","date":"2020-02-03","arxiv_id":"2002.00658","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/linear-predictor-on-linearly-generated-data#ran","syntology_url":"https://syntology.ai/paper/2002.00658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00658"}},"official":{"repos":["marineLM/linear_predictor_missing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pac-confidence-sets-for-deep-neural-networks-1","slug":"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":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pac-confidence-sets-for-deep-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2001.00106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00106"}},"official":{"repos":["sangdon/PAC-confidence-set"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/improved-sample-complexities-for-deep","slug":"improved-sample-complexities-for-deep","title":"Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margin","date":"2019-10-09","arxiv_id":"1910.04284","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improved-sample-complexities-for-deep#ran","syntology_url":"https://syntology.ai/paper/1910.04284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04284"}},"official":{"repos":["cwein3/all-layer-margin-opt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/on-the-downstream-performance-of-compressed","slug":"on-the-downstream-performance-of-compressed","title":"On the Downstream Performance of Compressed Word Embeddings","date":"2019-09-03","arxiv_id":"1909.01264","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-downstream-performance-of-compressed#ran","syntology_url":"https://syntology.ai/paper/1909.01264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01264"}},"official":{"repos":["HazyResearch/smallfry"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-theory-and-algorithm-for-domain","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-theory-and-algorithm-for-domain#ran","syntology_url":"https://syntology.ai/paper/1904.05801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05801"}},"official":{"repos":["thuml/MDD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/sorting-out-lipschitz-function-approximation","slug":"sorting-out-lipschitz-function-approximation","title":"Sorting out Lipschitz function approximation","date":"2018-11-13","arxiv_id":"1811.05381","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sorting-out-lipschitz-function-approximation#ran","syntology_url":"https://syntology.ai/paper/1811.05381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05381"}},"official":null}},{"url":"/paper/learning-gaussian-processes-by-minimizing-pac","slug":"learning-gaussian-processes-by-minimizing-pac","title":"Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization Bounds","date":"2018-10-29","arxiv_id":"1810.12263","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-gaussian-processes-by-minimizing-pac#ran","syntology_url":"https://syntology.ai/paper/1810.12263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.12263"}},"official":{"repos":["boschresearch/PAC_GP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/non-vacuous-generalization-bounds-at-the","slug":"non-vacuous-generalization-bounds-at-the","title":"Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approach","date":"2018-04-16","arxiv_id":"1804.05862","repositories_listed":1,"syntology":{"n":15,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/non-vacuous-generalization-bounds-at-the#ran","syntology_url":"https://syntology.ai/paper/1804.05862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.05862"}},"official":{"repos":["wendazhou/nnet-compression-generalization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":13,"ran_from_kinds":["official"]}}},{"url":"/paper/computing-nonvacuous-generalization-bounds","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/computing-nonvacuous-generalization-bounds#ran","syntology_url":"https://syntology.ai/paper/1703.11008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.11008"}},"official":null}},{"url":"/paper/estimating-individual-treatment-effect","slug":"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":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/estimating-individual-treatment-effect#ran","syntology_url":"https://syntology.ai/paper/1606.03976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.03976"}},"official":null}}],"record_sha256":"6d8c8cc676745a5c653ccaab9c73bd1f560ae8c6addf09efafaa87526370bcec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}