{"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/nice","slug":"nice","name":"NICE","full_name":"Non-linear Independent Component Estimation","full_name_withheld":false,"description_markdown":"**NICE**, or **Non-Linear Independent Components Estimation** is a framework for modeling complex high-dimensional densities. It is based on the idea that a good representation is one in which the data has a distribution that is easy to model. For this purpose, a non-linear deterministic transformation of the data is learned that maps it to a latent space so as to make the transformed data conform to a factorized distribution, i.e., resulting in independent latent variables.  The transformation is parameterised so that computing the determinant of the Jacobian and inverse Jacobian is trivial, yet it maintains the ability to learn complex non-linear transformations, via a composition of simple building blocks, each based on a deep neural network. The training criterion is simply the exact log-likelihood. The transformation used in NICE is the [affine coupling](https://paperswithcode.com/method/affine-coupling) layer without the scale term, known as additive coupling layer:\r\n\r\n$$ y\\_{I\\_{2}} = x\\_{I\\_{2}} + m\\left(x\\_{I\\_{1}}\\right) $$\r\n\r\n$$ x\\_{I\\_{2}} = y\\_{I\\_{2}} + m\\left(y\\_{I\\_{1}}\\right) $$","description_state":"present","introduced_year":null,"introduced_by":{"title":"NICE: Non-linear Independent Components Estimation","paper":"/paper/nice-non-linear-independent-components","first_author":"Laurent Dinh","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/nice-non-linear-independent-components"},"source":{"url":"http://arxiv.org/abs/1410.8516v6","title":"NICE: Non-linear Independent Components Estimation","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/paultsw/nice_pytorch/blob/15cfc543fc3dc81ee70398b8dfc37b67269ede95/nice/models.py#L20","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Likelihood-Based Generative Models","url":"/methods/category/likelihood-based-generative-models","pwc_aliases":[]},{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Models","url":"/methods/category/generative-models","pwc_aliases":[]}],"n_papers_tagged":22,"archive_num_papers":22,"papers_newest_first":[{"paper":null,"slug":"towards-conversational-ai-for-disease","title":"Towards Conversational AI for Disease Management","date":"2025-03-08","arxiv_id":"2503.06074","n_code_links":0,"syntology":null},{"paper":null,"slug":"i-see-therefore-i-do-estimating-causal","title":"I See, Therefore I Do: Estimating Causal Effects for Image Treatments","date":"2024-11-28","arxiv_id":"2412.06810","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-methods-for-the-noniterative","title":"Deep Learning Methods for the Noniterative Conditional Expectation G-Formula for Causal Inference from Complex Observational Data","date":"2024-10-28","arxiv_id":"2410.21531","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-solution-for-the-cvpr2024-nice-image","title":"The Solution for the CVPR2024 NICE Image Captioning Challenge","date":"2024-04-19","arxiv_id":"2404.12739","n_code_links":0,"syntology":null},{"paper":"/paper/nice-neurogenesis-inspired-contextual","slug":"nice-neurogenesis-inspired-contextual","title":"NICE: Neurogenesis Inspired Contextual Encoding for Replay-free Class Incremental Learning","date":"2024-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/nice-improving-panoptic-narrative-detection","slug":"nice-improving-panoptic-narrative-detection","title":"NICE: Improving Panoptic Narrative Detection and Segmentation with Cascading Collaborative Learning","date":"2023-10-17","arxiv_id":"2310.10975","n_code_links":1,"syntology":null},{"paper":"/paper/towards-feasible-counterfactual-explanations","slug":"towards-feasible-counterfactual-explanations","title":"Towards Feasible Counterfactual Explanations: A Taxonomy Guided Template-based NLG Method","date":"2023-10-03","arxiv_id":"2310.02019","n_code_links":1,"syntology":null},{"paper":"/paper/nice-noise-modulated-consistency","slug":"nice-noise-modulated-consistency","title":"NICE: NoIse-modulated Consistency rEgularization for Data-Efficient GANs","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"nice-2023-zero-shot-image-captioning","title":"NICE: CVPR 2023 Challenge on Zero-shot Image Captioning","date":"2023-09-05","arxiv_id":"2309.01961","n_code_links":0,"syntology":null},{"paper":"/paper/non-iterative-coarse-to-fine-transformer","slug":"non-iterative-coarse-to-fine-transformer","title":"Non-iterative Coarse-to-fine Transformer Networks for Joint Affine and Deformable Image Registration","date":"2023-07-07","arxiv_id":"2307.03421","n_code_links":1,"syntology":null},{"paper":null,"slug":"introduction-to-non-invasive-current","title":"Introduction to Non-Invasive Current Estimation (NICE)","date":"2023-01-17","arxiv_id":"2301.10237","n_code_links":0,"syntology":null},{"paper":null,"slug":"protein-co-enrichment-analysis-of","title":"Protein Co-Enrichment Analysis of Extracellular Vesicles","date":"2023-01-10","arxiv_id":"2301.04051","n_code_links":0,"syntology":null},{"paper":null,"slug":"focusing-on-context-is-nice-improving","title":"Focusing on Context is NICE: Improving Overshadowed Entity Disambiguation","date":"2022-10-12","arxiv_id":"2210.06164","n_code_links":0,"syntology":null},{"paper":null,"slug":"nicest-noisy-label-correction-and-training","title":"NICEST: Noisy Label Correction and Training for Robust Scene Graph Generation","date":"2022-07-27","arxiv_id":"2207.13316","n_code_links":0,"syntology":null},{"paper":"/paper/the-devil-is-in-the-labels-noisy-label-1","slug":"the-devil-is-in-the-labels-noisy-label-1","title":"The Devil is in the Labels: Noisy Label Correction for Robust Scene Graph Generation","date":"2022-06-07","arxiv_id":"2206.03014","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["muktilin/nice"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"deep-learning-based-prediction-of-msi-in","title":"Deep Learning based Prediction of MSI using MMR Markers in Colorectal Cancer","date":"2022-02-24","arxiv_id":"2203.00449","n_code_links":0,"syntology":null},{"paper":"/paper/nice-robust-scheduling-through-reinforcement","slug":"nice-robust-scheduling-through-reinforcement","title":"NICE: Robust Scheduling through Reinforcement Learning-Guided Integer Programming","date":"2021-09-24","arxiv_id":"2109.12171","n_code_links":1,"syntology":null},{"paper":null,"slug":"approximation-capabilities-of-measure","title":"Approximation capabilities of measure-preserving neural networks","date":"2021-06-21","arxiv_id":"2106.10911","n_code_links":0,"syntology":null},{"paper":"/paper/nice-an-algorithm-for-nearest-instance","slug":"nice-an-algorithm-for-nearest-instance","title":"NICE: An Algorithm for Nearest Instance Counterfactual Explanations","date":"2021-04-15","arxiv_id":"2104.07411","n_code_links":3,"syntology":null},{"paper":null,"slug":"generative-time-series-modeling-with-fourier","title":"Generative Time-series Modeling with Fourier Flows","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/invariant-representation-learning-for","slug":"invariant-representation-learning-for","title":"Invariant Representation Learning for Treatment Effect Estimation","date":"2020-11-24","arxiv_id":"2011.12379","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["claudiashi57/nice"],"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","unlocated"]}}},{"paper":"/paper/nice-non-linear-independent-components","slug":"nice-non-linear-independent-components","title":"NICE: Non-linear Independent Components Estimation","date":"2014-10-30","arxiv_id":"1410.8516","n_code_links":19,"syntology":{"ran":24,"of":27,"n_ran_checked":19,"n_instrument":5,"unverified":3,"pointer_only":0,"phrase":"24 ran (of which 16 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","official":null}}],"papers_shown":22,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":22,"with_a_code_link":10,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"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"},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/method/nice/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/nice/papers/ran/1","json":"/method/nice/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/causal-inference","name":"Causal Inference","papers":2},{"task":"/task/graph-generation","name":"Graph Generation","papers":2},{"task":"/task/image-captioning","name":"Image Captioning","papers":2},{"task":"/task/scene-graph-generation","name":"Scene Graph Generation","papers":2},{"task":null,"name":"counterfactual","papers":2},{"task":"/task/all","name":"All","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/causal-identification","name":"Causal Identification","papers":1},{"task":"/task/class-incremental-learning","name":"Class Incremental Learning","papers":1},{"task":"/task/clinical-knowledge","name":"Clinical Knowledge","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/diagnostic","name":"Diagnostic","papers":1},{"task":"/task/entity-disambiguation","name":"Entity Disambiguation","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1},{"task":null,"name":"Hippocampus","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/image-registration","name":"Image Registration","papers":1},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1}],"tasks_shown":20,"n_tasks":39,"usage_by_year":[{"year":"2014","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":4},{"year":"2022","papers":4},{"year":"2023","papers":7},{"year":"2024","papers":4},{"year":"2025","papers":1}],"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/nice"},"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=NICE","read_at":"2026-10-05T00:59:38+00:00","query":"NICE","kind":"method","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":{"method":"NICE","origin_arxiv_id":"2206.03014"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1410.8516","repositories":{"listed":5,"in_graph":21,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":8,"served":{"arxiv_id":"2206.03014","citations":111},"leading_other_bearer":{"arxiv_id":"2104.07411","title":"NICE: An Algorithm for Nearest Instance Counterfactual Explanations","citations":108,"named_by":["title_prefix"],"bearer_name":"NICE: An Algorithm for Nearest Instance Counterfactual Explanations","ask_with":"have('2104.07411')"},"n_other_bearers_listed":5,"note":"7 other thing(s) here are also called 'NICE', 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":"2206.03014","page":"/paper/the-devil-is-in-the-labels-noisy-label-1","syntology_url":"https://syntology.ai/paper/2206.03014","in_graph_layer":true,"samples":2,"ran":1,"n_ran_checked":0,"n_instrument":1,"unverified":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2206.03014: repository known, no verified implementation (declared_code; repositories: 5 listed of 21 in the graph, strongest link: official). About another paper: this answer is about arXiv:2206.03014, while the archive credits arXiv:1410.8516.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"796788696da6afa7a4af89fb3ff73945a12a47e930be602aae2b7b56fb27a63f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}