{"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/additive-models/papers/ran/1","list_of":"/task/additive-models","task":"Additive models","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,22],"of":22,"counts":{"archive_papers_tagged":252,"with_a_code_link":95,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":252,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/additive-models/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/interpretable-generalized-additive-models-for","slug":"interpretable-generalized-additive-models-for","title":"Interpretable Generalized Additive Models for Datasets with Missing Values","date":"2024-12-03","arxiv_id":"2412.02646","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/interpretable-generalized-additive-models-for#ran","syntology_url":"https://syntology.ai/paper/2412.02646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.02646"}},"official":{"repos":["jdonnelly36/m-gam"],"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/a-functional-extension-of-semi-structured","slug":"a-functional-extension-of-semi-structured","title":"A Functional Extension of Semi-Structured Networks","date":"2024-10-07","arxiv_id":"2410.05430","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"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 2 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/a-functional-extension-of-semi-structured#ran","syntology_url":"https://syntology.ai/paper/2410.05430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05430"}},"official":{"repos":["neural-structured-additive-learning/funnel"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-level-additive-modeling-for-structured","slug":"multi-level-additive-modeling-for-structured","title":"Multi-Level Additive Modeling for Structured Non-IID Federated Learning","date":"2024-05-26","arxiv_id":"2405.16472","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-level-additive-modeling-for-structured#ran","syntology_url":"https://syntology.ai/paper/2405.16472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16472"}},"official":{"repos":["shutong043/femam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/shape-arithmetic-expressions-advancing","slug":"shape-arithmetic-expressions-advancing","title":"Shape Arithmetic Expressions: Advancing Scientific Discovery Beyond Closed-Form Equations","date":"2024-04-15","arxiv_id":"2404.09788","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":7,"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/shape-arithmetic-expressions-advancing#ran","syntology_url":"https://syntology.ai/paper/2404.09788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.09788"}},"official":{"repos":["krzysztof-kacprzyk/shares"],"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/gaussian-process-neural-additive-models","slug":"gaussian-process-neural-additive-models","title":"Gaussian Process Neural Additive Models","date":"2024-02-19","arxiv_id":"2402.12518","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/gaussian-process-neural-additive-models#ran","syntology_url":"https://syntology.ai/paper/2402.12518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12518"}},"official":{"repos":["wei2624/gpnam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-well-do-feature-additive-explainers","slug":"how-well-do-feature-additive-explainers","title":"How Well Do Feature-Additive Explainers Explain Feature-Additive Predictors?","date":"2023-10-27","arxiv_id":"2310.18496","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"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) · 4 unverified","sample_list":"/paper/how-well-do-feature-additive-explainers#ran","syntology_url":"https://syntology.ai/paper/2310.18496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18496"}},"official":{"repos":["craymichael/PostHocExplainerEvaluation"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/laplace-approximated-neural-additive-models","slug":"laplace-approximated-neural-additive-models","title":"Improving Neural Additive Models with Bayesian Principles","date":"2023-05-26","arxiv_id":"2305.16905","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"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 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) · 1 unverified","sample_list":"/paper/laplace-approximated-neural-additive-models#ran","syntology_url":"https://syntology.ai/paper/2305.16905","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16905"}},"official":{"repos":["fortuinlab/la-nam"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/curve-your-enthusiasm-concurvity","slug":"curve-your-enthusiasm-concurvity","title":"Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models","date":"2023-05-19","arxiv_id":"2305.11475","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":0,"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/curve-your-enthusiasm-concurvity#ran","syntology_url":"https://syntology.ai/paper/2305.11475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11475"}},"official":{"repos":["merantix-momentum/concurvity-regularization"],"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/gam-coach-towards-interactive-and-user","slug":"gam-coach-towards-interactive-and-user","title":"GAM Coach: Towards Interactive and User-centered Algorithmic Recourse","date":"2023-02-27","arxiv_id":"2302.14165","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":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/gam-coach-towards-interactive-and-user#ran","syntology_url":"https://syntology.ai/paper/2302.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.14165"}},"official":{"repos":["poloclub/gam-coach"],"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/higher-order-neural-additive-models-an","slug":"higher-order-neural-additive-models-an","title":"Higher-order Neural Additive Models: An Interpretable Machine Learning Model with Feature Interactions","date":"2022-09-30","arxiv_id":"2209.15409","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/higher-order-neural-additive-models-an#ran","syntology_url":"https://syntology.ai/paper/2209.15409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15409"}},"official":{"repos":["gim4855744/honam"],"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/emb-gam-an-interpretable-and-efficient","slug":"emb-gam-an-interpretable-and-efficient","title":"Augmenting Interpretable Models with LLMs during Training","date":"2022-09-23","arxiv_id":"2209.11799","repositories_listed":4,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"8 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/emb-gam-an-interpretable-and-efficient#ran","syntology_url":"https://syntology.ai/paper/2209.11799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11799"}},"official":{"repos":["csinva/emb-gam","csinva/imodelsX","microsoft/augmented-interpretable-models"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deletion-and-insertion-tests-in-regression","slug":"deletion-and-insertion-tests-in-regression","title":"Deletion and Insertion Tests in Regression Models","date":"2022-05-25","arxiv_id":"2205.12423","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/deletion-and-insertion-tests-in-regression#ran","syntology_url":"https://syntology.ai/paper/2205.12423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12423"}},"official":null}},{"url":"/paper/fast-sparse-classification-for-generalized","slug":"fast-sparse-classification-for-generalized","title":"Fast Sparse Classification for Generalized Linear and Additive Models","date":"2022-02-23","arxiv_id":"2202.11389","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/fast-sparse-classification-for-generalized#ran","syntology_url":"https://syntology.ai/paper/2202.11389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11389"}},"official":{"repos":["jiachangliu/fastSparse"],"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/gam-changer-editing-generalized-additive","slug":"gam-changer-editing-generalized-additive","title":"GAM Changer: Editing Generalized Additive Models with Interactive Visualization","date":"2021-12-06","arxiv_id":"2112.03245","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/gam-changer-editing-generalized-additive#ran","syntology_url":"https://syntology.ai/paper/2112.03245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03245"}},"official":{"repos":["interpretml/gam-changer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/node-gam-neural-generalized-additive-model","slug":"node-gam-neural-generalized-additive-model","title":"NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learning","date":"2021-06-03","arxiv_id":"2106.01613","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":5,"n_ran_checked":8,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"9 ran (of which 5 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) · 6 unverified","sample_list":"/paper/node-gam-neural-generalized-additive-model#ran","syntology_url":"https://syntology.ai/paper/2106.01613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01613"}},"official":{"repos":["zzzace2000/nodegam"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/testing-directed-acyclic-graph-via-structural","slug":"testing-directed-acyclic-graph-via-structural","title":"Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning","date":"2021-06-02","arxiv_id":"2106.01474","repositories_listed":1,"syntology":{"n":19,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/testing-directed-acyclic-graph-via-structural#ran","syntology_url":"https://syntology.ai/paper/2106.01474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01474"}},"official":{"repos":["yunzhe-zhou/sugar"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/how-interpretable-and-trustworthy-are-gams","slug":"how-interpretable-and-trustworthy-are-gams","title":"How Interpretable and Trustworthy are GAMs?","date":"2020-06-11","arxiv_id":"2006.06466","repositories_listed":2,"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/how-interpretable-and-trustworthy-are-gams#ran","syntology_url":"https://syntology.ai/paper/2006.06466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06466"}},"official":{"repos":["zzzace2000/GAMs"],"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/neural-additive-models-interpretable-machine","slug":"neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","arxiv_id":"2004.13912","repositories_listed":8,"syntology":{"n":33,"n_ran":26,"n_constructed":14,"n_ran_checked":26,"n_instrument":0,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":21,"n_pointer_only":14,"phrase":"26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-additive-models-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2004.13912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13912"}},"official":{"repos":["lemeln/nam"],"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":["listed","official"]}}},{"url":"/paper/a-unifying-network-architecture-for-semi","slug":"a-unifying-network-architecture-for-semi","title":"Semi-Structured Distributional Regression -- Extending Structured Additive Models by Arbitrary Deep Neural Networks and Data Modalities","date":"2020-02-13","arxiv_id":"2002.05777","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/a-unifying-network-architecture-for-semi#ran","syntology_url":"https://syntology.ai/paper/2002.05777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05777"}},"official":{"repos":["davidruegamer/semi-structured_distributional_regression"],"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/robust-aggregation-for-federated-learning","slug":"robust-aggregation-for-federated-learning","title":"Robust Aggregation for Federated Learning","date":"2019-12-31","arxiv_id":"1912.13445","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/robust-aggregation-for-federated-learning#ran","syntology_url":"https://syntology.ai/paper/1912.13445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13445"}},"official":{"repos":["krishnap25/RFA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/purifying-interaction-effects-with-the","slug":"purifying-interaction-effects-with-the","title":"Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Models","date":"2019-11-12","arxiv_id":"1911.04974","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":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) · 1 unverified","sample_list":"/paper/purifying-interaction-effects-with-the#ran","syntology_url":"https://syntology.ai/paper/1911.04974","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04974"}},"official":{"repos":["microsoft/interpret"],"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/ibreakdown-uncertainty-of-model-explanations","slug":"ibreakdown-uncertainty-of-model-explanations","title":"Do Not Trust Additive Explanations","date":"2019-03-27","arxiv_id":"1903.11420","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/ibreakdown-uncertainty-of-model-explanations#ran","syntology_url":"https://syntology.ai/paper/1903.11420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11420"}},"official":{"repos":["ModelOriented/iBreakDown"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"0aa30b7b12c8f79ad007a56a5bd8958bcb6d94d03bfa79f48f15d31df20e79e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}