{"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/learning-theory","name":"Learning Theory","slug":"learning-theory","description_markdown":"Learning theory","categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":852,"papers_with_code":140,"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":9,"rows_per_page":100,"shown":100,"of":852,"of_with_code":140,"tagged_in_all":852,"counts":{"archive_papers_tagged":852,"with_a_code_link":140,"where_syntology_ran_a_sample":44,"not_listed_spam_title":0,"listed":852,"listed_where_code_ran":44,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":37,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":37,"listed_every_run_a_failure_of_syntologys_instrument":7,"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"},"items":[{"url":"/paper/a-contextual-bandit-approach-to-personalized","slug":"a-contextual-bandit-approach-to-personalized","title":"A Contextual-Bandit Approach to Personalized News Article Recommendation","date":"2010-02-28","arxiv_id":"1003.0146","repositories_listed":12,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-contextual-bandit-approach-to-personalized#ran","syntology_url":"https://syntology.ai/paper/1003.0146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1003.0146"}},"official":null}},{"url":"/paper/learning-an-explicit-hyperparameter","slug":"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/information-based-transductive-active","slug":"information-based-transductive-active","title":"Transductive Active Learning: Theory and Applications","date":"2024-02-13","arxiv_id":"2402.15898","repositories_listed":2,"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/information-based-transductive-active#ran","syntology_url":"https://syntology.ai/paper/2402.15898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15898"}},"official":null}},{"url":"/paper/stabilizing-sharpness-aware-minimization","slug":"stabilizing-sharpness-aware-minimization","title":"Stabilizing Sharpness-aware Minimization Through A Simple Renormalization Strategy","date":"2024-01-14","arxiv_id":"2401.07250","repositories_listed":2,"syntology":null},{"url":"/paper/quantifying-degeneracy-in-singular-models-via","slug":"quantifying-degeneracy-in-singular-models-via","title":"The Local Learning Coefficient: A Singularity-Aware Complexity Measure","date":"2023-08-23","arxiv_id":"2308.12108","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/quantifying-degeneracy-in-singular-models-via#ran","syntology_url":"https://syntology.ai/paper/2308.12108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12108"}},"official":{"repos":["edmundlth/scalable_learning_coefficient_with_sgld"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-strategic-framework-for-optimal-decisions","slug":"a-strategic-framework-for-optimal-decisions","title":"A Strategic Framework for Optimal Decisions in Football 1-vs-1 Shot-Taking Situations: An Integrated Approach of Machine Learning, Theory-Based Modeling, and Game Theory","date":"2023-07-27","arxiv_id":"2307.14732","repositories_listed":2,"syntology":null},{"url":"/paper/don-t-fear-the-unlabelled-safe-deep-semi","slug":"don-t-fear-the-unlabelled-safe-deep-semi","title":"Don't fear the unlabelled: safe semi-supervised learning via simple debiasing","date":"2022-03-14","arxiv_id":"2203.07512","repositories_listed":2,"syntology":null},{"url":"/paper/intrinsic-dimension-persistent-homology-and-1","slug":"intrinsic-dimension-persistent-homology-and-1","title":"Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks","date":"2021-11-25","arxiv_id":"2111.13171","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/intrinsic-dimension-persistent-homology-and-1#ran","syntology_url":"https://syntology.ai/paper/2111.13171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13171"}},"official":{"repos":["tolgabirdal/phdimgeneralization"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-optimal-interpolation-in-linear-regression","slug":"on-optimal-interpolation-in-linear-regression","title":"On Optimal Interpolation In Linear Regression","date":"2021-10-21","arxiv_id":"2110.11258","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/on-optimal-interpolation-in-linear-regression#ran","syntology_url":"https://syntology.ai/paper/2110.11258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.11258"}},"official":null}},{"url":"/paper/boosting-a-model-zoo-for-multi-task-and","slug":"boosting-a-model-zoo-for-multi-task-and","title":"Model Zoo: A Growing \"Brain\" That Learns Continually","date":"2021-06-06","arxiv_id":"2106.03027","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/boosting-a-model-zoo-for-multi-task-and#ran","syntology_url":"https://syntology.ai/paper/2106.03027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03027"}},"official":{"repos":["grasp-lyrl/modelzoo_continual","rahul13ramesh/modelzoo_continual"],"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/on-the-power-of-shallow-learning","slug":"on-the-power-of-shallow-learning","title":"Reverse Engineering the Neural Tangent Kernel","date":"2021-06-06","arxiv_id":"2106.03186","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-boolean-function-learnability","slug":"understanding-boolean-function-learnability","title":"Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic Models","date":"2020-09-13","arxiv_id":"2009.05908","repositories_listed":2,"syntology":null},{"url":"/paper/foreshadowing-the-benefits-of-incidental","slug":"foreshadowing-the-benefits-of-incidental","title":"Foreseeing the Benefits of Incidental Supervision","date":"2020-06-09","arxiv_id":"2006.05500","repositories_listed":2,"syntology":null},{"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/evolving-and-understanding-sparse-deep-neural","slug":"evolving-and-understanding-sparse-deep-neural","title":"A Brain-inspired Algorithm for Training Highly Sparse Neural Networks","date":"2019-03-17","arxiv_id":"1903.07138","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evolving-and-understanding-sparse-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1903.07138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07138"}},"official":{"repos":["joostPieterse/CosineSET","zahraatashgahi/ctre"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-learning-from-untrusted-sources","slug":"robust-learning-from-untrusted-sources","title":"Robust Learning from Untrusted Sources","date":"2019-01-29","arxiv_id":"1901.10310","repositories_listed":2,"syntology":null},{"url":"/paper/generalization-in-machine-learning-via","slug":"generalization-in-machine-learning-via","title":"Generalization in Machine Learning via Analytical Learning Theory","date":"2018-02-21","arxiv_id":"1802.07426","repositories_listed":2,"syntology":null},{"url":"/paper/learning-a-variational-network-for","slug":"learning-a-variational-network-for","title":"Learning a Variational Network for Reconstruction of Accelerated MRI Data","date":"2017-04-03","arxiv_id":"1704.00447","repositories_listed":2,"syntology":null},{"url":"/paper/a-semantic-change-detection-network-based-on","slug":"a-semantic-change-detection-network-based-on","title":"A Semantic Change Detection Network Based on Boundary Detection and Task Interaction for High-Resolution Remote Sensing Images","date":"2025-05-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-evolution-operator-learning","slug":"self-supervised-evolution-operator-learning","title":"Self-Supervised Evolution Operator Learning for High-Dimensional Dynamical Systems","date":"2025-05-24","arxiv_id":"2505.18671","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/self-supervised-evolution-operator-learning#ran","syntology_url":"https://syntology.ai/paper/2505.18671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.18671"}},"official":{"repos":["pietronvll/encoderops"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/auto-fpt-automating-free-probability-theory","slug":"auto-fpt-automating-free-probability-theory","title":"auto-fpt: Automating Free Probability Theory Calculations for Machine Learning Theory","date":"2025-04-14","arxiv_id":"2504.10754","repositories_listed":1,"syntology":null},{"url":"/paper/double-descent-in-quantum-machine-learning","slug":"double-descent-in-quantum-machine-learning","title":"Double descent in quantum machine learning","date":"2025-01-17","arxiv_id":"2501.10077","repositories_listed":1,"syntology":null},{"url":"/paper/gradient-equilibrium-in-online-learning","slug":"gradient-equilibrium-in-online-learning","title":"Gradient Equilibrium in Online Learning: Theory and Applications","date":"2025-01-14","arxiv_id":"2501.08330","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/gradient-equilibrium-in-online-learning#ran","syntology_url":"https://syntology.ai/paper/2501.08330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08330"}},"official":{"repos":["aangelopoulos/gradient-equilibrium"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ddim-sampling-for-generative-aibim-a-faster","slug":"ddim-sampling-for-generative-aibim-a-faster","title":"DDIM sampling for Generative AIBIM, a faster intelligent structural design framework","date":"2024-12-30","arxiv_id":"2412.20899","repositories_listed":1,"syntology":null},{"url":"/paper/nlprompt-noise-label-prompt-learning-for","slug":"nlprompt-noise-label-prompt-learning-for","title":"NLPrompt: Noise-Label Prompt Learning for Vision-Language Models","date":"2024-12-02","arxiv_id":"2412.01256","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/nlprompt-noise-label-prompt-learning-for#ran","syntology_url":"https://syntology.ai/paper/2412.01256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.01256"}},"official":{"repos":["qunovo/NLPrompt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-learning-from-vision-language","slug":"federated-learning-from-vision-language","title":"Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method","date":"2024-09-29","arxiv_id":"2409.19610","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":10,"phrase":"7 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; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-learning-from-vision-language#ran","syntology_url":"https://syntology.ai/paper/2409.19610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19610"}},"official":{"repos":["PanBikang/PromptFolio"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-guarantees-for-indirect-data","slug":"end-to-end-guarantees-for-indirect-data","title":"End-to-end guarantees for indirect data-driven control of bilinear systems with finite stochastic data","date":"2024-09-26","arxiv_id":"2409.18010","repositories_listed":1,"syntology":null},{"url":"/paper/ngd-converges-to-less-degenerate-solutions","slug":"ngd-converges-to-less-degenerate-solutions","title":"NGD converges to less degenerate solutions than SGD","date":"2024-09-07","arxiv_id":"2409.04913","repositories_listed":1,"syntology":null},{"url":"/paper/learning-confidence-bounds-for-classification","slug":"learning-confidence-bounds-for-classification","title":"Learning Confidence Bounds for Classification with Imbalanced Data","date":"2024-07-16","arxiv_id":"2407.11878","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-limitations-of-fractal-dimension-as-a","slug":"on-the-limitations-of-fractal-dimension-as-a","title":"On the Limitations of Fractal Dimension as a Measure of Generalization","date":"2024-06-04","arxiv_id":"2406.02234","repositories_listed":1,"syntology":null},{"url":"/paper/occam-gradient-descent","slug":"occam-gradient-descent","title":"Occam Gradient Descent","date":"2024-05-30","arxiv_id":"2405.20194","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-laws-for-the-value-of-individual-data","slug":"scaling-laws-for-the-value-of-individual-data","title":"Scaling Laws for the Value of Individual Data Points in Machine Learning","date":"2024-05-30","arxiv_id":"2405.20456","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":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) · 0 unverified","sample_list":"/paper/scaling-laws-for-the-value-of-individual-data#ran","syntology_url":"https://syntology.ai/paper/2405.20456","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20456"}},"official":{"repos":["iancovert/data-scaling"],"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/modl-multilearner-online-deep-learning","slug":"modl-multilearner-online-deep-learning","title":"MODL: Multilearner Online Deep Learning","date":"2024-05-28","arxiv_id":"2405.18281","repositories_listed":1,"syntology":null},{"url":"/paper/unveiling-the-cycloid-trajectory-of-em","slug":"unveiling-the-cycloid-trajectory-of-em","title":"Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regression","date":"2024-05-28","arxiv_id":"2405.18237","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unveiling-the-cycloid-trajectory-of-em#ran","syntology_url":"https://syntology.ai/paper/2405.18237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18237"}},"official":{"repos":["dassein/cycloid_em_mlr"],"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/data-error-scaling-in-machine-learning-on","slug":"data-error-scaling-in-machine-learning-on","title":"Data-Error Scaling in Machine Learning on Natural Discrete Combinatorial Mutation-prone Sets: Case Studies on Peptides and Small Molecules","date":"2024-05-08","arxiv_id":"2405.05167","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-llms-requires-more-than","slug":"understanding-llms-requires-more-than","title":"Position: Understanding LLMs Requires More Than Statistical Generalization","date":"2024-05-03","arxiv_id":"2405.01964","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-llms-requires-more-than#ran","syntology_url":"https://syntology.ai/paper/2405.01964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01964"}},"official":{"repos":["rpatrik96/llm-non-identifiability"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/data-driven-performance-guarantees-for","slug":"data-driven-performance-guarantees-for","title":"Data-Driven Performance Guarantees for Classical and Learned Optimizers","date":"2024-04-22","arxiv_id":"2404.13831","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/data-driven-performance-guarantees-for#ran","syntology_url":"https://syntology.ai/paper/2404.13831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13831"}},"official":{"repos":["stellatogrp/datadrivenoptimizerguarantees"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/active-test-time-adaptation-theoretical","slug":"active-test-time-adaptation-theoretical","title":"Active Test-Time Adaptation: Theoretical Analyses and An Algorithm","date":"2024-04-07","arxiv_id":"2404.05094","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/active-test-time-adaptation-theoretical#ran","syntology_url":"https://syntology.ai/paper/2404.05094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05094"}},"official":{"repos":["divelab/atta"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-inference-for-consistent-predictions","slug":"bayesian-inference-for-consistent-predictions","title":"Bayesian Inference for Consistent Predictions in Overparameterized Nonlinear Regression","date":"2024-04-06","arxiv_id":"2404.04498","repositories_listed":1,"syntology":null},{"url":"/paper/causal-stonet-causal-inference-for-high","slug":"causal-stonet-causal-inference-for-high","title":"Causal-StoNet: Causal Inference for High-Dimensional Complex Data","date":"2024-03-27","arxiv_id":"2403.18994","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":4,"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/causal-stonet-causal-inference-for-high#ran","syntology_url":"https://syntology.ai/paper/2403.18994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18994"}},"official":{"repos":["nixay/causal-stonet"],"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/hunting-attributes-context-prototype-aware","slug":"hunting-attributes-context-prototype-aware","title":"Hunting Attributes: Context Prototype-Aware Learning for Weakly Supervised Semantic Segmentation","date":"2024-03-12","arxiv_id":"2403.07630","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-diminishing-returns-of-width-for","slug":"on-the-diminishing-returns-of-width-for","title":"On the Diminishing Returns of Width for Continual Learning","date":"2024-03-11","arxiv_id":"2403.06398","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/on-the-diminishing-returns-of-width-for#ran","syntology_url":"https://syntology.ai/paper/2403.06398","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06398"}},"official":{"repos":["vihan-lakshman/diminishing-returns-wide-continual-learning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/leveraging-pac-bayes-theory-and-gibbs","slug":"leveraging-pac-bayes-theory-and-gibbs","title":"Leveraging PAC-Bayes Theory and Gibbs Distributions for Generalization Bounds with Complexity Measures","date":"2024-02-19","arxiv_id":"2402.13285","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-gradient-flow-dynamics-of-test","slug":"stochastic-gradient-flow-dynamics-of-test","title":"Stochastic Gradient Flow Dynamics of Test Risk and its Exact Solution for Weak Features","date":"2024-02-12","arxiv_id":"2402.07626","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-gradient-flow-dynamics-of-test#ran","syntology_url":"https://syntology.ai/paper/2402.07626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07626"}},"official":{"repos":["rodsveiga/sgf_dyn"],"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/estimating-the-local-learning-coefficient-at","slug":"estimating-the-local-learning-coefficient-at","title":"Estimating the Local Learning Coefficient at Scale","date":"2024-02-06","arxiv_id":"2402.03698","repositories_listed":1,"syntology":null},{"url":"/paper/information-leakage-detection-through","slug":"information-leakage-detection-through","title":"Information Leakage Detection through Approximate Bayes-optimal Prediction","date":"2024-01-25","arxiv_id":"2401.14283","repositories_listed":1,"syntology":null},{"url":"/paper/the-definitive-guide-to-policy-gradients-in","slug":"the-definitive-guide-to-policy-gradients-in","title":"The Definitive Guide to Policy Gradients in Deep Reinforcement Learning: Theory, Algorithms and Implementations","date":"2024-01-24","arxiv_id":"2401.13662","repositories_listed":1,"syntology":null},{"url":"/paper/harmonics-of-learning-universal-fourier","slug":"harmonics-of-learning-universal-fourier","title":"Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks","date":"2023-12-13","arxiv_id":"2312.08550","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/harmonics-of-learning-universal-fourier#ran","syntology_url":"https://syntology.ai/paper/2312.08550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.08550"}},"official":{"repos":["sophiaas/spectral-universality"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-augment-distributions-for-out-of-1","slug":"learning-to-augment-distributions-for-out-of-1","title":"Learning to Augment Distributions for Out-of-Distribution Detection","date":"2023-11-03","arxiv_id":"2311.01796","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-augment-distributions-for-out-of-1#ran","syntology_url":"https://syntology.ai/paper/2311.01796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01796"}},"official":{"repos":["tmlr-group/dal"],"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/bi-discriminator-domain-adversarial-neural","slug":"bi-discriminator-domain-adversarial-neural","title":"Bi-discriminator Domain Adversarial Neural Networks with Class-Level Gradient Alignment","date":"2023-10-21","arxiv_id":"2310.13959","repositories_listed":1,"syntology":null},{"url":"/paper/spade-sparsity-guided-debugging-for-deep","slug":"spade-sparsity-guided-debugging-for-deep","title":"SPADE: Sparsity-Guided Debugging for Deep Neural Networks","date":"2023-10-06","arxiv_id":"2310.04519","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/spade-sparsity-guided-debugging-for-deep#ran","syntology_url":"https://syntology.ai/paper/2310.04519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04519"}},"official":{"repos":["ist-daslab/spade"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/why-do-we-need-weight-decay-in-modern-deep","slug":"why-do-we-need-weight-decay-in-modern-deep","title":"Why Do We Need Weight Decay in Modern Deep Learning?","date":"2023-10-06","arxiv_id":"2310.04415","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/why-do-we-need-weight-decay-in-modern-deep#ran","syntology_url":"https://syntology.ai/paper/2310.04415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04415"}},"official":{"repos":["tml-epfl/why-weight-decay"],"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/learnable-extended-activation-function-leaf","slug":"learnable-extended-activation-function-leaf","title":"Learnable Extended Activation Function (LEAF) for Deep Neural Networks","date":"2023-09-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improved-learning-theory-for-kernel","slug":"improved-learning-theory-for-kernel","title":"Improved learning theory for kernel distribution regression with two-stage sampling","date":"2023-08-28","arxiv_id":"2308.14335","repositories_listed":1,"syntology":null},{"url":"/paper/learning-in-cooperative-multiagent-systems","slug":"learning-in-cooperative-multiagent-systems","title":"Learning in Cooperative Multiagent Systems Using Cognitive and Machine Models","date":"2023-08-18","arxiv_id":"2308.09219","repositories_listed":1,"syntology":null},{"url":"/paper/deep-projection-networks-for-learning-time","slug":"deep-projection-networks-for-learning-time","title":"Learning invariant representations of time-homogeneous stochastic dynamical systems","date":"2023-07-19","arxiv_id":"2307.09912","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/deep-projection-networks-for-learning-time#ran","syntology_url":"https://syntology.ai/paper/2307.09912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09912"}},"official":{"repos":["pietronvll/DPNets"],"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/scaling-mlps-a-tale-of-inductive-bias-1","slug":"scaling-mlps-a-tale-of-inductive-bias-1","title":"Scaling MLPs: A Tale of Inductive Bias","date":"2023-06-23","arxiv_id":"2306.13575","repositories_listed":1,"syntology":null},{"url":"/paper/a-primal-dual-data-driven-method-for","slug":"a-primal-dual-data-driven-method-for","title":"A primal-dual data-driven method for computational optical imaging with a photonic lantern","date":"2023-06-20","arxiv_id":"2306.11679","repositories_listed":1,"syntology":null},{"url":"/paper/improving-energy-conserving-descent-for","slug":"improving-energy-conserving-descent-for","title":"Improving Energy Conserving Descent for Machine Learning: Theory and Practice","date":"2023-06-01","arxiv_id":"2306.00352","repositories_listed":1,"syntology":null},{"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/stability-generalization-and-privacy-precise","slug":"stability-generalization-and-privacy-precise","title":"How Spurious Features Are Memorized: Precise Analysis for Random and NTK Features","date":"2023-05-20","arxiv_id":"2305.12100","repositories_listed":1,"syntology":null},{"url":"/paper/long-term-instabilities-of-deep-learning","slug":"long-term-instabilities-of-deep-learning","title":"Challenges of learning multi-scale dynamics with AI weather models: Implications for stability and one solution","date":"2023-04-14","arxiv_id":"2304.07029","repositories_listed":1,"syntology":null},{"url":"/paper/double-descent-demystified-identifying","slug":"double-descent-demystified-identifying","title":"Double Descent Demystified: Identifying, Interpreting & Ablating the Sources of a Deep Learning Puzzle","date":"2023-03-24","arxiv_id":"2303.14151","repositories_listed":1,"syntology":null},{"url":"/paper/variational-bayesian-neural-networks-via","slug":"variational-bayesian-neural-networks-via","title":"Variational Bayesian Neural Networks via Resolution of Singularities","date":"2023-02-13","arxiv_id":"2302.06035","repositories_listed":1,"syntology":null},{"url":"/paper/generalization-bounds-with-data-dependent","slug":"generalization-bounds-with-data-dependent","title":"Generalization Bounds with Data-dependent Fractal Dimensions","date":"2023-02-06","arxiv_id":"2302.02766","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-of-continual-learning","slug":"a-comprehensive-survey-of-continual-learning","title":"A Comprehensive Survey of Continual Learning: Theory, Method and Application","date":"2023-01-31","arxiv_id":"2302.00487","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-based-nystrom-approximation-and","slug":"sampling-based-nystrom-approximation-and","title":"Sampling-based Nyström Approximation and Kernel Quadrature","date":"2023-01-23","arxiv_id":"2301.09517","repositories_listed":1,"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":3,"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/sampling-based-nystrom-approximation-and#ran","syntology_url":"https://syntology.ai/paper/2301.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09517"}},"official":{"repos":["satoshi-hayakawa/kernel-quadrature"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-mechanics-of-generalization-in-1","slug":"statistical-mechanics-of-generalization-in-1","title":"Homophily modulates double descent generalization in graph convolution networks","date":"2022-12-26","arxiv_id":"2212.13069","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-model-for-regular-grammar-induction","slug":"a-neural-model-for-regular-grammar-induction","title":"A Neural Model for Regular Grammar Induction","date":"2022-09-23","arxiv_id":"2209.11628","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-neural-model-for-regular-grammar-induction#ran","syntology_url":"https://syntology.ai/paper/2209.11628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11628"}},"official":{"repos":["pbelcak/neregrain"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-fundamental-limits-of-formally-dis","slug":"on-the-fundamental-limits-of-formally-dis","title":"Proof-of-Learning is Currently More Broken Than You Think","date":"2022-08-06","arxiv_id":"2208.03567","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-non-cooperative-dialogue-theoretical","slug":"modeling-non-cooperative-dialogue-theoretical","title":"Modeling Non-Cooperative Dialogue: Theoretical and Empirical Insights","date":"2022-07-15","arxiv_id":"2207.07255","repositories_listed":1,"syntology":null},{"url":"/paper/gray-learning-from-non-iid-data-with-out-of","slug":"gray-learning-from-non-iid-data-with-out-of","title":"Gray Learning from Non-IID Data with Out-of-distribution Samples","date":"2022-06-19","arxiv_id":"2206.09375","repositories_listed":1,"syntology":null},{"url":"/paper/straggler-resilient-personalized-federated","slug":"straggler-resilient-personalized-federated","title":"Straggler-Resilient Personalized Federated Learning","date":"2022-06-05","arxiv_id":"2206.02078","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/straggler-resilient-personalized-federated#ran","syntology_url":"https://syntology.ai/paper/2206.02078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02078"}},"official":{"repos":["shenzebang/SRPFL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-accuracy-generalization-properties-of","slug":"beyond-accuracy-generalization-properties-of","title":"Beyond accuracy: generalization properties of bio-plausible temporal credit assignment rules","date":"2022-06-02","arxiv_id":"2206.00823","repositories_listed":1,"syntology":null},{"url":"/paper/an-analytic-framework-for-robust-training-of","slug":"an-analytic-framework-for-robust-training-of","title":"An Analytic Framework for Robust Training of Artificial Neural Networks","date":"2022-05-26","arxiv_id":"2205.13502","repositories_listed":1,"syntology":null},{"url":"/paper/training-relu-networks-to-high-uniform","slug":"training-relu-networks-to-high-uniform","title":"Learning ReLU networks to high uniform accuracy is intractable","date":"2022-05-26","arxiv_id":"2205.13531","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/training-relu-networks-to-high-uniform#ran","syntology_url":"https://syntology.ai/paper/2205.13531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13531"}},"official":{"repos":["juliusberner/theory2practice"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/universal-caching","slug":"universal-caching","title":"Universal Caching","date":"2022-05-10","arxiv_id":"2205.04860","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-generalization-by-controlling","slug":"investigating-generalization-by-controlling","title":"Investigating Generalization by Controlling Normalized Margin","date":"2022-05-08","arxiv_id":"2205.03940","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-hybrid-activation-function-for-deep","slug":"adaptive-hybrid-activation-function-for-deep","title":"Adaptive hybrid activation function for deep neural networks","date":"2022-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/risk-consistent-multi-class-learning-from","slug":"risk-consistent-multi-class-learning-from","title":"Learning from Label Proportions with Instance-wise Consistency","date":"2022-03-24","arxiv_id":"2203.12836","repositories_listed":1,"syntology":null},{"url":"/paper/learning-curves-for-the-multi-class-teacher","slug":"learning-curves-for-the-multi-class-teacher","title":"Learning curves for the multi-class teacher-student perceptron","date":"2022-03-22","arxiv_id":"2203.12094","repositories_listed":1,"syntology":null},{"url":"/paper/pactran-pac-bayesian-metrics-for-estimating","slug":"pactran-pac-bayesian-metrics-for-estimating","title":"PACTran: PAC-Bayesian Metrics for Estimating the Transferability of Pretrained Models to Classification Tasks","date":"2022-03-10","arxiv_id":"2203.05126","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/pactran-pac-bayesian-metrics-for-estimating#ran","syntology_url":"https://syntology.ai/paper/2203.05126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05126"}},"official":{"repos":["google-research/pactran_metrics"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-unified-view-of-unsupervised-non","slug":"towards-a-unified-view-of-unsupervised-non","title":"Towards a unified view of unsupervised non-local methods for image denoising: the NL-Ridge approach","date":"2022-03-01","arxiv_id":"2203.00570","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-in-random-neural-fields","slug":"deep-learning-in-random-neural-fields","title":"Deep Learning in Random Neural Fields: Numerical Experiments via Neural Tangent Kernel","date":"2022-02-10","arxiv_id":"2202.05254","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalization-bounds-for-deep-networks","slug":"on-generalization-bounds-for-deep-networks","title":"On generalization bounds for deep networks based on loss surface implicit regularization","date":"2022-01-12","arxiv_id":"2201.04545","repositories_listed":1,"syntology":null},{"url":"/paper/a-structured-dictionary-perspective-on","slug":"a-structured-dictionary-perspective-on","title":"A Structured Dictionary Perspective on Implicit Neural Representations","date":"2021-12-03","arxiv_id":"2112.01917","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/a-structured-dictionary-perspective-on#ran","syntology_url":"https://syntology.ai/paper/2112.01917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01917"}},"official":{"repos":["gortizji/inr_dictionaries"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/speedyibl-a-solution-to-the-curse-of","slug":"speedyibl-a-solution-to-the-curse-of","title":"SpeedyIBL: A Comprehensive, Precise, and Fast Implementation of Instance-Based Learning Theory","date":"2021-11-19","arxiv_id":"2111.10268","repositories_listed":1,"syntology":null},{"url":"/paper/causal-forecasting-generalization-bounds-for","slug":"causal-forecasting-generalization-bounds-for","title":"Causal Forecasting:Generalization Bounds for Autoregressive Models","date":"2021-11-18","arxiv_id":"2111.09831","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/causal-forecasting-generalization-bounds-for#ran","syntology_url":"https://syntology.ai/paper/2111.09831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.09831"}},"official":{"repos":["amazon-research/causal-forecasting"],"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/latent-equilibrium-a-unified-learning-theory","slug":"latent-equilibrium-a-unified-learning-theory","title":"Latent Equilibrium: A unified learning theory for arbitrarily fast computation with arbitrarily slow neurons","date":"2021-10-27","arxiv_id":"2110.14549","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/latent-equilibrium-a-unified-learning-theory#ran","syntology_url":"https://syntology.ai/paper/2110.14549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14549"}},"official":null}},{"url":"/paper/understanding-dimensional-collapse-in-1","slug":"understanding-dimensional-collapse-in-1","title":"Understanding Dimensional Collapse in Contrastive Self-supervised Learning","date":"2021-10-18","arxiv_id":"2110.09348","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-dimensional-collapse-in-1#ran","syntology_url":"https://syntology.ai/paper/2110.09348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09348"}},"official":{"repos":["facebookresearch/directclr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/neural-tangent-kernel-eigenvalues-accurately","slug":"neural-tangent-kernel-eigenvalues-accurately","title":"The Eigenlearning Framework: A Conservation Law Perspective on Kernel Regression and Wide Neural Networks","date":"2021-10-08","arxiv_id":"2110.03922","repositories_listed":1,"syntology":null},{"url":"/paper/comparing-text-representations-a-theory","slug":"comparing-text-representations-a-theory","title":"Comparing Text Representations: A Theory-Driven Approach","date":"2021-09-15","arxiv_id":"2109.07458","repositories_listed":1,"syntology":null},{"url":"/paper/on-tilted-losses-in-machine-learning-theory","slug":"on-tilted-losses-in-machine-learning-theory","title":"On Tilted Losses in Machine Learning: Theory and Applications","date":"2021-09-13","arxiv_id":"2109.06141","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-machine-learning-of-model","slug":"a-framework-for-machine-learning-of-model","title":"A Framework for Machine Learning of Model Error in Dynamical Systems","date":"2021-07-14","arxiv_id":"2107.06658","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-vs-discrete-optimization-of-deep","slug":"continuous-vs-discrete-optimization-of-deep","title":"Continuous vs. Discrete Optimization of Deep Neural Networks","date":"2021-07-14","arxiv_id":"2107.06608","repositories_listed":1,"syntology":null},{"url":"/paper/learning-bounds-for-open-set-learning","slug":"learning-bounds-for-open-set-learning","title":"Learning Bounds for Open-Set Learning","date":"2021-06-30","arxiv_id":"2106.15792","repositories_listed":1,"syntology":null},{"url":"/paper/f-domain-adversarial-learning-theory-and-1","slug":"f-domain-adversarial-learning-theory-and-1","title":"f-Domain-Adversarial Learning: Theory and Algorithms","date":"2021-06-21","arxiv_id":"2106.11344","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/f-domain-adversarial-learning-theory-and-1#ran","syntology_url":"https://syntology.ai/paper/2106.11344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11344"}},"official":null}},{"url":"/paper/on-anytime-learning-at-macroscale","slug":"on-anytime-learning-at-macroscale","title":"On Anytime Learning at Macroscale","date":"2021-06-17","arxiv_id":"2106.09563","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-anytime-learning-at-macroscale#ran","syntology_url":"https://syntology.ai/paper/2106.09563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09563"}},"official":{"repos":["facebookresearch/alma"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/solving-pdes-on-unknown-manifolds-with","slug":"solving-pdes-on-unknown-manifolds-with","title":"Solving PDEs on Unknown Manifolds with Machine Learning","date":"2021-06-12","arxiv_id":"2106.06682","repositories_listed":1,"syntology":null},{"url":"/paper/representation-mitosis-in-wide-neural","slug":"representation-mitosis-in-wide-neural","title":"Redundant representations help generalization in wide neural networks","date":"2021-06-07","arxiv_id":"2106.03485","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/representation-mitosis-in-wide-neural#ran","syntology_url":"https://syntology.ai/paper/2106.03485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03485"}},"official":{"repos":["diegodoimo/redundant_representation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}}],"syntology_records":38,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":44,"papers_where_code_ran_first_page":"/task/learning-theory/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":9,"url":"/task/learning-theory/papers/2","json":"/task/learning-theory/papers/2.json","rows":100},{"order":"archive","page":3,"of":9,"url":"/task/learning-theory/papers/3","json":"/task/learning-theory/papers/3.json","rows":100},{"order":"archive","page":4,"of":9,"url":"/task/learning-theory/papers/4","json":"/task/learning-theory/papers/4.json","rows":100},{"order":"archive","page":5,"of":9,"url":"/task/learning-theory/papers/5","json":"/task/learning-theory/papers/5.json","rows":100},{"order":"archive","page":6,"of":9,"url":"/task/learning-theory/papers/6","json":"/task/learning-theory/papers/6.json","rows":100},{"order":"archive","page":7,"of":9,"url":"/task/learning-theory/papers/7","json":"/task/learning-theory/papers/7.json","rows":100},{"order":"archive","page":8,"of":9,"url":"/task/learning-theory/papers/8","json":"/task/learning-theory/papers/8.json","rows":100},{"order":"archive","page":9,"of":9,"url":"/task/learning-theory/papers/9","json":"/task/learning-theory/papers/9.json","rows":52},{"order":"ran","page":1,"of":1,"url":"/task/learning-theory/papers/ran/1","json":"/task/learning-theory/papers/ran/1.json","rows":44}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"59f6458dbcbe4d68bf0863f267173014ca29fce0c4003faeaee2010eb447030b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}