{"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":"/method/nam","slug":"nam","name":"NAM","full_name":"Neural Additive Model","full_name_withheld":false,"description_markdown":"**Neural Additive Models (NAMs)** make restrictions on the structure of neural networks, which yields a family of models that are inherently interpretable while suffering little loss in prediction accuracy when applied to tabular data. Methodologically, NAMs belong to a larger model family called Generalized Additive Models (GAMs). \r\n\r\nNAMs learn a linear combination of networks that each attend to a single input feature: each $f\\_{i}$ in the traditional GAM formulationis parametrized by a neural network. These networks are trained jointly using backpropagation and can learn arbitrarily complex shape functions. Interpreting NAMs is easy as the impact of a feature on the prediction does not rely on the other features and can be understood by visualizing its corresponding shape function (e.g., plotting $f\\_{i}\\left(x\\_{i}\\right)$ vs. $x\\_{i}$).","description_state":"present","introduced_year":null,"introduced_by":{"title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","paper":"/paper/neural-additive-models-interpretable-machine","first_author":"Rishabh Agarwal","n_authors":7,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/neural-additive-models-interpretable-machine"},"source":{"url":"https://arxiv.org/abs/2004.13912v2","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/google-research/google-research/tree/master/neural_additive_models","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Interpretability","url":"/methods/category/interpretability","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Generalized Additive Models","url":"/methods/category/generalized-additive-models","pwc_aliases":[]}],"n_papers_tagged":18,"archive_num_papers":18,"papers_newest_first":[{"paper":null,"slug":"nam-a-normalization-attention-model-for","title":"NAM: A Normalization Attention Model for Personalized Product Search In Fliggy","date":"2025-06-10","arxiv_id":"2506.08382","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimally-supervised-hierarchical-domain","title":"Minimally Supervised Hierarchical Domain Intent Learning for CRS","date":"2025-05-04","arxiv_id":"2505.02209","n_code_links":0,"syntology":null},{"paper":null,"slug":"mt-nam-an-efficient-and-adaptive-model-for","title":"MT-NAM: An Efficient and Adaptive Model for Epileptic Seizure Detection","date":"2025-03-11","arxiv_id":"2503.08251","n_code_links":0,"syntology":null},{"paper":null,"slug":"advancing-nam-to-speech-conversion-with-novel","title":"Advancing NAM-to-Speech Conversion with Novel Methods and the MultiNAM Dataset","date":"2024-12-25","arxiv_id":"2412.18839","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-improving-nam-to-speech-synthesis","title":"Towards Improving NAM-to-Speech Synthesis Intelligibility using Self-Supervised Speech Models","date":"2024-07-26","arxiv_id":"2407.18541","n_code_links":0,"syntology":null},{"paper":null,"slug":"explainable-automatic-grading-with-neural","title":"Explainable Automatic Grading with Neural Additive Models","date":"2024-05-01","arxiv_id":"2405.00489","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/paper/no-service-rail-surface-defect-segmentation","slug":"no-service-rail-surface-defect-segmentation","title":"No-Service Rail Surface Defect Segmentation via Normalized Attention and Dual-scale Interaction","date":"2023-06-27","arxiv_id":"2306.15442","n_code_links":1,"syntology":null},{"paper":null,"slug":"minimizing-energy-consumption-in-mu-mimo-via","title":"Minimizing Energy Consumption in MU-MIMO via Antenna Muting by Neural Networks with Asymmetric Loss","date":"2023-06-08","arxiv_id":"2306.05162","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"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","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"]}}},{"paper":null,"slug":"neural-attention-memory","title":"Neural Attention Memory","date":"2023-02-18","arxiv_id":"2302.09422","n_code_links":0,"syntology":null},{"paper":null,"slug":"extending-the-neural-additive-model-for","title":"Extending the Neural Additive Model for Survival Analysis with EHR Data","date":"2022-11-15","arxiv_id":"2211.07814","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"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","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"]}}},{"paper":null,"slug":"neural-additive-models-for-nowcasting","title":"Neural Additive Models for Nowcasting","date":"2022-05-20","arxiv_id":"2205.10020","n_code_links":0,"syntology":null},{"paper":null,"slug":"physics-to-the-rescue-deep-non-line-of-sight","title":"Physics to the Rescue: Deep Non-line-of-sight Reconstruction for High-speed Imaging","date":"2022-05-03","arxiv_id":"2205.01679","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-neural-additive-model-interpretable","title":"Sparse Neural Additive Model: Interpretable Deep Learning with Feature Selection via Group Sparsity","date":"2022-02-25","arxiv_id":"2202.12482","n_code_links":0,"syntology":null},{"paper":null,"slug":"survnam-the-machine-learning-survival-model","title":"SurvNAM: The machine learning survival model explanation","date":"2021-04-18","arxiv_id":"2104.08903","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":8,"syntology":{"ran":26,"of":33,"n_ran_checked":26,"n_instrument":0,"unverified":7,"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","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"]}}}],"papers_shown":18,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":18,"with_a_code_link":5,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/nam/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/nam/papers/ran/1","json":"/method/nam/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/additive-models","name":"Additive models","papers":8},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":3},{"task":"/task/interpretable-machine-learning","name":"Interpretable Machine Learning","papers":3},{"task":"/task/decision-making","name":"Decision Making","papers":2},{"task":"/task/survival-analysis","name":"Survival Analysis","papers":2},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/combinatorial-optimization","name":"Combinatorial Optimization","papers":1},{"task":"/task/conversational-recommendation","name":"Conversational Recommendation","papers":1},{"task":"/task/eeg-1","name":"EEG","papers":1},{"task":"/task/explainable-models","name":"Explainable Models","papers":1},{"task":"/task/explainable-artificial-intelligence","name":"Explainable artificial intelligence","papers":1},{"task":"/task/feature-engineering","name":"Feature Engineering","papers":1},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":1},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":1},{"task":"/task/segmentation","name":"Segmentation","papers":1},{"task":"/task/seizure-detection","name":"Seizure Detection","papers":1}],"tasks_shown":20,"n_tasks":35,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":5},{"year":"2023","papers":4},{"year":"2024","papers":4},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/nam"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=NAM","read_at":"2026-10-05T00:59:30+00:00","query":"NAM","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2111.12419"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2004.13912","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2111.12419","citations":211},"leading_other_bearer":{"arxiv_id":"2609.01014","title":"Low-Quality Face Recognition using Center Aligned Representations and Local Margin Constraints","citations":null,"named_by":["acronym_expansion"],"bearer_name":"Nested Attention Module (NAM)","ask_with":"have('2609.01014')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'NAM', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2111.12419","page":"/paper/nam-normalization-based-attention-module","syntology_url":"https://syntology.ai/paper/2111.12419","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2111.12419: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:2111.12419, not a method entry. About another paper: this answer is about arXiv:2111.12419, while the archive credits arXiv:2004.13912.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"677dda06d42b81f886a2fb183f2ea2c111b0de1d930e8b4d12b0ac4fa65895db","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}