{"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","name":"Additive models","slug":"additive-models","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":252,"papers_with_code":95,"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":3,"rows_per_page":100,"shown":100,"of":252,"of_with_code":95,"tagged_in_all":252,"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"},"items":[{"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/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/neuralgam-explainable-generalized-additive","slug":"neuralgam-explainable-generalized-additive","title":"neuralGAM: Explainable generalized additive neural networks with independent neural network training","date":"2024-07-08","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/the-intelligible-and-effective-graph-neural","slug":"the-intelligible-and-effective-graph-neural","title":"The Intelligible and Effective Graph Neural Additive Networks","date":"2024-06-03","arxiv_id":"2406.01317","repositories_listed":2,"syntology":null},{"url":"/paper/interpretability-then-what-editing-machine","slug":"interpretability-then-what-editing-machine","title":"Interpretability, Then What? Editing Machine Learning Models to Reflect Human Knowledge and Values","date":"2022-06-30","arxiv_id":"2206.15465","repositories_listed":2,"syntology":null},{"url":"/paper/gam-e-changer-or-not-an-evaluation-of","slug":"gam-e-changer-or-not-an-evaluation-of","title":"GAM(e) changer or not? An evaluation of interpretable machine learning models based on additive model constraints","date":"2022-04-19","arxiv_id":"2204.09123","repositories_listed":2,"syntology":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/fast-interpretable-greedy-tree-sums-figs","slug":"fast-interpretable-greedy-tree-sums-figs","title":"Fast Interpretable Greedy-Tree Sums","date":"2022-01-28","arxiv_id":"2201.11931","repositories_listed":2,"syntology":null},{"url":"/paper/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/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/gami-net-an-explainable-neural-network-based","slug":"gami-net-an-explainable-neural-network-based","title":"GAMI-Net: An Explainable Neural Network based on Generalized Additive Models with Structured Interactions","date":"2020-03-16","arxiv_id":"2003.07132","repositories_listed":2,"syntology":null},{"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/interpretml-a-unified-framework-for-machine","slug":"interpretml-a-unified-framework-for-machine","title":"InterpretML: A Unified Framework for Machine Learning Interpretability","date":"2019-09-19","arxiv_id":"1909.09223","repositories_listed":2,"syntology":null},{"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"]}}},{"url":"/paper/additive-approximations-in-high-dimensional","slug":"additive-approximations-in-high-dimensional","title":"Additive Approximations in High Dimensional Nonparametric Regression via the SALSA","date":"2016-01-31","arxiv_id":"1602.00287","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-shrinkage-estimation-for","slug":"adaptive-shrinkage-estimation-for","title":"Adaptive Shrinkage Estimation For Personalized Deep Kernel Regression In Modeling Brain Trajectories","date":"2025-04-10","arxiv_id":"2504.08840","repositories_listed":1,"syntology":null},{"url":"/paper/forecasting-time-series-with-constraints","slug":"forecasting-time-series-with-constraints","title":"Forecasting time series with constraints","date":"2025-02-14","arxiv_id":"2502.10485","repositories_listed":1,"syntology":null},{"url":"/paper/how-your-location-relates-to-health-variable","slug":"how-your-location-relates-to-health-variable","title":"How Your Location Relates to Health: Variable Importance and Interpretable Machine Learning for Environmental and Sociodemographic Data","date":"2025-01-03","arxiv_id":"2501.02111","repositories_listed":1,"syntology":null},{"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":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 0 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/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":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dnamite-interpretable-calibrated-survival","slug":"dnamite-interpretable-calibrated-survival","title":"DNAMite: Interpretable Calibrated Survival Analysis with Discretized Additive Models","date":"2024-11-08","arxiv_id":"2411.05923","repositories_listed":1,"syntology":null},{"url":"/paper/transparent-networks-for-multivariate-time","slug":"transparent-networks-for-multivariate-time","title":"Transparent Networks for Multivariate Time Series","date":"2024-10-14","arxiv_id":"2410.10535","repositories_listed":1,"syntology":null},{"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/protonam-prototypical-neural-additive-models","slug":"protonam-prototypical-neural-additive-models","title":"ProtoNAM: Prototypical Neural Additive Models for Interpretable Deep Tabular Learning","date":"2024-10-07","arxiv_id":"2410.04723","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-the-performance-interpretability","slug":"challenging-the-performance-interpretability","title":"Challenging the Performance-Interpretability Trade-off: An Evaluation of Interpretable Machine Learning Models","date":"2024-09-22","arxiv_id":"2409.14429","repositories_listed":1,"syntology":null},{"url":"/paper/neurcam-interpretable-neural-clustering-via","slug":"neurcam-interpretable-neural-clustering-via","title":"NeurCAM: Interpretable Neural Clustering via Additive Models","date":"2024-08-23","arxiv_id":"2408.13361","repositories_listed":1,"syntology":null},{"url":"/paper/cat-interpretable-concept-based-taylor","slug":"cat-interpretable-concept-based-taylor","title":"CAT: Interpretable Concept-based Taylor Additive Models","date":"2024-06-25","arxiv_id":"2406.17931","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mid-term-forecasting-of-hourly","slug":"efficient-mid-term-forecasting-of-hourly","title":"Efficient mid-term forecasting of hourly electricity load using generalized additive models","date":"2024-05-27","arxiv_id":"2405.17070","repositories_listed":1,"syntology":null},{"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/attention-mechanisms-don-t-learn-additive","slug":"attention-mechanisms-don-t-learn-additive","title":"Attention Mechanisms Don't Learn Additive Models: Rethinking Feature Importance for Transformers","date":"2024-05-22","arxiv_id":"2405.13536","repositories_listed":1,"syntology":null},{"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/igann-sparse-bridging-sparsity-and","slug":"igann-sparse-bridging-sparsity-and","title":"IGANN Sparse: Bridging Sparsity and Interpretability with Non-linear Insight","date":"2024-03-17","arxiv_id":"2403.11363","repositories_listed":1,"syntology":null},{"url":"/paper/data-science-with-llms-and-interpretable","slug":"data-science-with-llms-and-interpretable","title":"Data Science with LLMs and Interpretable Models","date":"2024-02-22","arxiv_id":"2402.14474","repositories_listed":1,"syntology":null},{"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/modeling-non-linear-effects-with-neural","slug":"modeling-non-linear-effects-with-neural","title":"Modeling non-linear Effects with Neural Networks in Relational Event Models","date":"2023-12-19","arxiv_id":"2312.12357","repositories_listed":1,"syntology":null},{"url":"/paper/geoshapley-a-game-theory-approach-to","slug":"geoshapley-a-game-theory-approach-to","title":"GeoShapley: A Game Theory Approach to Measuring Spatial Effects in Machine Learning Models","date":"2023-12-06","arxiv_id":"2312.03675","repositories_listed":1,"syntology":null},{"url":"/paper/modular-neural-networks-for-time-series","slug":"modular-neural-networks-for-time-series","title":"FocusLearn: Fully-Interpretable, High-Performance Modular Neural Networks for Time Series","date":"2023-11-28","arxiv_id":"2311.16834","repositories_listed":1,"syntology":null},{"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/regionally-additive-models-explainable-by","slug":"regionally-additive-models-explainable-by","title":"Regionally Additive Models: Explainable-by-design models minimizing feature interactions","date":"2023-09-21","arxiv_id":"2309.12215","repositories_listed":1,"syntology":null},{"url":"/paper/can-local-explanation-techniques-explain","slug":"can-local-explanation-techniques-explain","title":"Can local explanation techniques explain linear additive models?","date":"2023-09-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/llms-understand-glass-box-models-discover","slug":"llms-understand-glass-box-models-discover","title":"LLMs Understand Glass-Box Models, Discover Surprises, and Suggest Repairs","date":"2023-08-02","arxiv_id":"2308.01157","repositories_listed":1,"syntology":null},{"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/the-structurally-complex-with-additive-parent","slug":"the-structurally-complex-with-additive-parent","title":"The Structurally Complex with Additive Parent Causality (SCARY) Dataset","date":"2023-04-27","arxiv_id":"2304.14109","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-and-interacting-with-the-set-of-1","slug":"exploring-and-interacting-with-the-set-of-1","title":"Exploring and Interacting with the Set of Good Sparse Generalized Additive Models","date":"2023-03-28","arxiv_id":"2303.16047","repositories_listed":1,"syntology":null},{"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/structural-neural-additive-models-enhanced","slug":"structural-neural-additive-models-enhanced","title":"Structural Neural Additive Models: Enhanced Interpretable Machine Learning","date":"2023-02-18","arxiv_id":"2302.09275","repositories_listed":1,"syntology":null},{"url":"/paper/nowcasting-the-2022-mpox-outbreak-in-england","slug":"nowcasting-the-2022-mpox-outbreak-in-england","title":"Nowcasting the 2022 mpox outbreak in England","date":"2023-02-17","arxiv_id":"2302.09076","repositories_listed":1,"syntology":null},{"url":"/paper/neural-additive-models-for-location-scale-and","slug":"neural-additive-models-for-location-scale-and","title":"Neural Additive Models for Location Scale and Shape: A Framework for Interpretable Neural Regression Beyond the Mean","date":"2023-01-27","arxiv_id":"2301.11862","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-multi-quantile-adaptively-flexible","slug":"ensemble-multi-quantile-adaptively-flexible","title":"Ensemble Multi-Quantiles: Adaptively Flexible Distribution Prediction for Uncertainty Quantification","date":"2022-11-26","arxiv_id":"2211.14545","repositories_listed":1,"syntology":null},{"url":"/paper/additive-covariance-matrix-models-modelling","slug":"additive-covariance-matrix-models-modelling","title":"Additive Covariance Matrix Models: Modelling Regional Electricity Net-Demand in Great Britain","date":"2022-11-14","arxiv_id":"2211.07451","repositories_listed":1,"syntology":null},{"url":"/paper/individualized-and-global-feature","slug":"individualized-and-global-feature","title":"Individualized and Global Feature Attributions for Gradient Boosted Trees in the Presence of $\\ell_2$ Regularization","date":"2022-11-08","arxiv_id":"2211.04409","repositories_listed":1,"syntology":null},{"url":"/paper/the-projected-covariance-measure-for","slug":"the-projected-covariance-measure-for","title":"The Projected Covariance Measure for assumption-lean variable significance testing","date":"2022-11-03","arxiv_id":"2211.02039","repositories_listed":1,"syntology":null},{"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/from-shapley-values-to-generalized-additive","slug":"from-shapley-values-to-generalized-additive","title":"From Shapley Values to Generalized Additive Models and back","date":"2022-09-08","arxiv_id":"2209.04012","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-partially-interpretable-framework","slug":"a-unifying-partially-interpretable-framework","title":"Regression modelling of spatiotemporal extreme U.S. wildfires via partially-interpretable neural networks","date":"2022-08-16","arxiv_id":"2208.07581","repositories_listed":1,"syntology":null},{"url":"/paper/controlburn-nonlinear-feature-selection-with","slug":"controlburn-nonlinear-feature-selection-with","title":"ControlBurn: Nonlinear Feature Selection with Sparse Tree Ensembles","date":"2022-07-08","arxiv_id":"2207.03935","repositories_listed":1,"syntology":null},{"url":"/paper/an-additive-instance-wise-approach-to-multi","slug":"an-additive-instance-wise-approach-to-multi","title":"An Additive Instance-Wise Approach to Multi-class Model Interpretation","date":"2022-07-07","arxiv_id":"2207.03113","repositories_listed":1,"syntology":null},{"url":"/paper/how-trial-to-trial-learning-shapes-mappings","slug":"how-trial-to-trial-learning-shapes-mappings","title":"How trial-to-trial learning shapes mappings in the mental lexicon: Modelling Lexical Decision with Linear Discriminative Learning","date":"2022-07-01","arxiv_id":"2207.00430","repositories_listed":1,"syntology":null},{"url":"/paper/using-generalized-additive-models-to","slug":"using-generalized-additive-models-to","title":"Using generalized additive models to decompose time series and waveforms, and dissect heart-lung interaction physiology","date":"2022-06-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-basis-models-for-interpretability","slug":"neural-basis-models-for-interpretability","title":"Neural Basis Models for Interpretability","date":"2022-05-27","arxiv_id":"2205.14120","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-interpretability-via-polynomials","slug":"scalable-interpretability-via-polynomials","title":"Scalable Interpretability via Polynomials","date":"2022-05-27","arxiv_id":"2205.14108","repositories_listed":1,"syntology":null},{"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/kasam-spline-additive-models-for-function","slug":"kasam-spline-additive-models-for-function","title":"KASAM: Spline Additive Models for Function Approximation","date":"2022-05-12","arxiv_id":"2205.06376","repositories_listed":1,"syntology":null},{"url":"/paper/shrimp-sparser-random-feature-models-via","slug":"shrimp-sparser-random-feature-models-via","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","date":"2021-12-07","arxiv_id":"2112.04002","repositories_listed":1,"syntology":null},{"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/hierarchical-transfer-learning-with","slug":"hierarchical-transfer-learning-with","title":"Hierarchical transfer learning with applications for electricity load forecasting","date":"2021-11-16","arxiv_id":"2111.08512","repositories_listed":1,"syntology":null},{"url":"/paper/spike-and-slab-generalized-additive-models","slug":"spike-and-slab-generalized-additive-models","title":"Spike-and-Slab LASSO Generalized Additive Models and Scalable Algorithms for High-Dimensional Data Analysis","date":"2021-10-27","arxiv_id":"2110.14449","repositories_listed":1,"syntology":null},{"url":"/paper/partial-order-finding-consensus-among","slug":"partial-order-finding-consensus-among","title":"Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set","date":"2021-10-26","arxiv_id":"2110.13369","repositories_listed":1,"syntology":null},{"url":"/paper/a-cautionary-tale-on-fitting-decision-trees","slug":"a-cautionary-tale-on-fitting-decision-trees","title":"A cautionary tale on fitting decision trees to data from additive models: generalization lower bounds","date":"2021-10-18","arxiv_id":"2110.09626","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-census-survey-response-rates-via","slug":"predicting-census-survey-response-rates-via","title":"Predicting Census Survey Response Rates With Parsimonious Additive Models and Structured Interactions","date":"2021-08-24","arxiv_id":"2108.11328","repositories_listed":1,"syntology":null},{"url":"/paper/model-compression-as-constrained-optimization-2","slug":"model-compression-as-constrained-optimization-2","title":"Model compression as constrained optimization, with application to neural nets. Part V: combining compressions","date":"2021-07-09","arxiv_id":"2107.04380","repositories_listed":1,"syntology":null},{"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/on-approximation-in-deep-convolutional","slug":"on-approximation-in-deep-convolutional","title":"Approximation and Learning with Deep Convolutional Models: a Kernel Perspective","date":"2021-02-19","arxiv_id":"2102.10032","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-via-3","slug":"high-dimensional-bayesian-optimization-via-3","title":"High-Dimensional Bayesian Optimization via Tree-Structured Additive Models","date":"2020-12-24","arxiv_id":"2012.13088","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-non-parametric-modeling-using","slug":"flexible-non-parametric-modeling-using","title":"Flexible, Non-parametric Modeling Using Regularized Neural Networks","date":"2020-12-18","arxiv_id":"2012.11369","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-for-individual-heterogeneity","slug":"deep-learning-for-individual-heterogeneity","title":"Deep Learning for Individual Heterogeneity","date":"2020-10-28","arxiv_id":"2010.14694","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-machine-learning-with-an","slug":"interpretable-machine-learning-with-an","title":"Interpretable Machine Learning with an Ensemble of Gradient Boosting Machines","date":"2020-10-14","arxiv_id":"2010.07388","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-complex-predictive-models-with","slug":"understanding-complex-predictive-models-with","title":"Understanding complex predictive models with Ghost Variables","date":"2019-12-13","arxiv_id":"1912.06407","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-time-series-classification","slug":"benchmarking-time-series-classification","title":"Benchmarking time series classification -- Functional data vs machine learning approaches","date":"2019-11-18","arxiv_id":"1911.07511","repositories_listed":1,"syntology":null},{"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/grounding-learning-of-modifier-dynamics-an","slug":"grounding-learning-of-modifier-dynamics-an","title":"Grounding learning of modifier dynamics: An application to color naming","date":"2019-09-17","arxiv_id":"1909.07586","repositories_listed":1,"syntology":null},{"url":"/paper/a-factored-generalized-additive-model-for","slug":"a-factored-generalized-additive-model-for","title":"A Factored Generalized Additive Model for Clinical Decision Support in the Operating Room","date":"2019-07-29","arxiv_id":"1907.12596","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-minkowski-sets-for-the","slug":"generalized-minkowski-sets-for-the","title":"Generalized Minkowski sets for the regularization of inverse problems","date":"2019-03-10","arxiv_id":"1903.03942","repositories_listed":1,"syntology":null},{"url":"/paper/interpretability-is-harder-in-the-multiclass","slug":"interpretability-is-harder-in-the-multiclass","title":"Axiomatic Interpretability for Multiclass Additive Models","date":"2018-10-22","arxiv_id":"1810.09092","repositories_listed":1,"syntology":null},{"url":"/paper/structured-nonlinear-variable-selection","slug":"structured-nonlinear-variable-selection","title":"Structured nonlinear variable selection","date":"2018-05-16","arxiv_id":"1805.06258","repositories_listed":1,"syntology":null},{"url":"/paper/performance-evaluation-and-hyperparameter","slug":"performance-evaluation-and-hyperparameter","title":"Performance evaluation and hyperparameter tuning of statistical and machine-learning models using spatial data","date":"2018-03-29","arxiv_id":"1803.11266","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-via","slug":"high-dimensional-bayesian-optimization-via","title":"High-Dimensional Bayesian Optimization via Additive Models with Overlapping Groups","date":"2018-02-20","arxiv_id":"1802.07028","repositories_listed":1,"syntology":null},{"url":"/paper/learning-global-additive-explanations-for","slug":"learning-global-additive-explanations-for","title":"Considerations When Learning Additive Explanations for Black-Box Models","date":"2018-01-26","arxiv_id":"1801.08640","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-hierarchical-interaction-learning-with","slug":"sparse-hierarchical-interaction-learning-with","title":"Sparse hierarchical interaction learning with epigraphical projection","date":"2017-05-22","arxiv_id":"1705.07817","repositories_listed":1,"syntology":null},{"url":"/paper/stability-selection-for-component-wise","slug":"stability-selection-for-component-wise","title":"Stability selection for component-wise gradient boosting in multiple dimensions","date":"2016-11-30","arxiv_id":"1611.10171","repositories_listed":1,"syntology":null},{"url":"/paper/chained-gaussian-processes","slug":"chained-gaussian-processes","title":"Chained Gaussian Processes","date":"2016-04-18","arxiv_id":"1604.05263","repositories_listed":1,"syntology":null},{"url":"/paper/hamiltonian-monte-carlo-acceleration-using","slug":"hamiltonian-monte-carlo-acceleration-using","title":"Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Bases","date":"2015-06-18","arxiv_id":"1506.05555","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-partially-linear-additive-models","slug":"sparse-partially-linear-additive-models","title":"Sparse Partially Linear Additive Models","date":"2014-07-17","arxiv_id":"1407.4729","repositories_listed":1,"syntology":null},{"url":"/paper/additive-gaussian-processes-1","slug":"additive-gaussian-processes-1","title":"Additive Gaussian Processes","date":"2011-12-19","arxiv_id":"1112.4394","repositories_listed":1,"syntology":null},{"url":null,"slug":"the-most-important-features-in-generalized","title":"The Most Important Features in Generalized Additive Models Might Be Groups of Features","date":"2025-06-24","arxiv_id":"2506.19937","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimized-franz-parisi-criterion-and-its","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","date":"2025-06-06","arxiv_id":"2506.06259","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-joint-interventional-effects-from","title":"Learning Joint Interventional Effects from Single-Variable Interventions in Additive Models","date":"2025-06-05","arxiv_id":"2506.04945","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuralgam-an-r-package-for-fitting","title":"neuralGAM: An R Package for Fitting Generalized Additive Neural Networks","date":"2025-05-13","arxiv_id":"2505.08610","repositories_listed":0,"syntology":null},{"url":null,"slug":"navigating-the-rashomon-effect-how","title":"Navigating the Rashomon Effect: How Personalization Can Help Adjust Interpretable Machine Learning Models to Individual Users","date":"2025-05-11","arxiv_id":"2505.07100","repositories_listed":0,"syntology":null}],"syntology_records":22,"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":22,"papers_where_code_ran_first_page":"/task/additive-models/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":3,"url":"/task/additive-models/papers/2","json":"/task/additive-models/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/additive-models/papers/3","json":"/task/additive-models/papers/3.json","rows":52},{"order":"ran","page":1,"of":1,"url":"/task/additive-models/papers/ran/1","json":"/task/additive-models/papers/ran/1.json","rows":22}],"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":"0349055ef54b5ad8d389f8d71d2bb597e3051b10d0c2bb4bac3f507663747ca2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}