{"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/dance","slug":"dance","name":"DANCE","full_name":"Domain Adaptative Neighborhood Clustering via Entropy Optimization","full_name_withheld":false,"description_markdown":"**Domain Adaptive Neighborhood Clustering via Entropy Optimization (DANCE)** is a self-supervised clustering method that harnesses the cluster structure of the target domain using self-supervision. This is done with a neighborhood clustering technique that self-supervises feature learning in the target. At the same time, useful source features and class boundaries are preserved and adapted with a partial domain alignment loss that the authors refer to as entropy separation loss. This loss allows the model to either match each target example with the source, or reject it as unknown.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Universal Domain Adaptation through Self Supervision","paper":"/paper/universal-domain-adaptation-through-self","first_author":"Kuniaki Saito","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/universal-domain-adaptation-through-self"},"source":{"url":"https://arxiv.org/abs/2002.07953v3","title":"Universal Domain Adaptation through Self Supervision","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Domain Adaptation","url":"/methods/category/domain-adaptation","pwc_aliases":[]}],"n_papers_tagged":10,"archive_num_papers":10,"papers_newest_first":[{"paper":"/paper/dataset-distillers-are-good-label-denoisers","slug":"dataset-distillers-are-good-label-denoisers","title":"Dataset Distillers Are Good Label Denoisers In the Wild","date":"2024-11-18","arxiv_id":"2411.11924","n_code_links":1,"syntology":{"ran":17,"of":19,"n_ran_checked":7,"n_instrument":10,"unverified":2,"pointer_only":19,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 10 where Syntology's instrument failed) · 2 unverified","official":{"repos":["kciiiman/dd_lnl"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"dance-deep-learning-assisted-analysis-of","title":"DANCE: Deep Learning-Assisted Analysis of Protein Sequences Using Chaos Enhanced Kaleidoscopic Images","date":"2024-09-10","arxiv_id":"2409.06694","n_code_links":0,"syntology":null},{"paper":"/paper/improving-commonsense-in-vision-language","slug":"improving-commonsense-in-vision-language","title":"Improving Commonsense in Vision-Language Models via Knowledge Graph Riddles","date":"2022-11-29","arxiv_id":"2211.16504","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-networks-for-multimodal-single","slug":"graph-neural-networks-for-multimodal-single","title":"Graph Neural Networks for Multimodal Single-Cell Data Integration","date":"2022-03-03","arxiv_id":"2203.01884","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["omicsml/dance"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/domain-adaptation-of-networks-for-camera-pose","slug":"domain-adaptation-of-networks-for-camera-pose","title":"Domain Adaptation of Networks for Camera Pose Estimation: Learning Camera Pose Estimation Without Pose Labels","date":"2021-11-29","arxiv_id":"2111.14741","n_code_links":1,"syntology":null},{"paper":null,"slug":"dance-data-network-co-optimization-for","title":"DANCE: DAta-Network Co-optimization for Efficient Segmentation Model Training and Inference","date":"2021-07-16","arxiv_id":"2107.07706","n_code_links":0,"syntology":null},{"paper":"/paper/more-robust-dense-retrieval-with-contrastive","slug":"more-robust-dense-retrieval-with-contrastive","title":"More Robust Dense Retrieval with Contrastive Dual Learning","date":"2021-07-16","arxiv_id":"2107.07773","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["thunlp/DANCE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"decorrelating-adversarial-nets-for-clustering","title":"Decorrelating Adversarial Nets for Clustering Mobile Network Data","date":"2021-03-11","arxiv_id":"2103.08348","n_code_links":0,"syntology":null},{"paper":null,"slug":"dance-differentiable-accelerator-network-co","title":"DANCE: Differentiable Accelerator/Network Co-Exploration","date":"2020-09-14","arxiv_id":"2009.06237","n_code_links":0,"syntology":null},{"paper":"/paper/universal-domain-adaptation-through-self","slug":"universal-domain-adaptation-through-self","title":"Universal Domain Adaptation through Self Supervision","date":"2020-02-19","arxiv_id":"2002.07953","n_code_links":1,"syntology":null}],"papers_shown":10,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":10,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":10,"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/dance/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/dance/papers/ran/1","json":"/method/dance/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":2},{"task":"/task/retrieval","name":"Retrieval","papers":2},{"task":"/task/camera-pose-estimation","name":"Camera Pose Estimation","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/data-integration","name":"Data Integration","papers":1},{"task":"/task/dataset-distillation","name":"Dataset Distillation","papers":1},{"task":"/task/deep-clustering","name":"Deep Clustering","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/diagnostic","name":"Diagnostic","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/image-to-image-translation","name":"Image-to-Image Translation","papers":1},{"task":"/task/information-retrieval","name":"Information Retrieval","papers":1},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":1},{"task":"/task/partial-domain-adaptation","name":"Partial Domain Adaptation","papers":1},{"task":"/task/pose-estimation","name":"Pose Estimation","papers":1}],"tasks_shown":20,"n_tasks":26,"usage_by_year":[{"year":"2020","papers":2},{"year":"2021","papers":4},{"year":"2022","papers":2},{"year":"2024","papers":2}],"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/dance"},"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=DANCE","read_at":"2026-10-05T00:54:27+00:00","query":"DANCE","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":"DANCE","origin_arxiv_id":"2406.01063"},"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":"2002.07953","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":8,"served":{"arxiv_id":"2406.01063","citations":25},"leading_other_bearer":{"arxiv_id":"2009.06237","title":"DANCE: Differentiable Accelerator/Network Co-Exploration","citations":52,"named_by":["title_prefix"],"bearer_name":"DANCE: Differentiable Accelerator/Network Co-Exploration","ask_with":"have('2009.06237')"},"n_other_bearers_listed":5,"note":"'DANCE' is ALSO the name of the paper 'DANCE: Differentiable Accelerator/Network Co-Exploration' (arXiv:2009.06237, 52 citations), which is cited FAR more than the paper this answer is about (25). This answer may be about the wrong DANCE. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to the paper “DANCE: Differentiable Accelerator/Network Co-Exploration” (arXiv:2009.06237, 52 citations), which the lookup finds cited far more than the paper this answer is about (25 citations), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[{"name":"DISCO-DANCE","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='DISCO-DANCE')","origin_arxiv_id":"2310.20178"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2406.01063","page":"/paper/dance-dual-view-distribution-alignment-for","syntology_url":"https://syntology.ai/paper/2406.01063","in_graph_layer":true,"samples":18,"ran":16,"n_ran_checked":4,"n_instrument":12,"unverified":2,"phrase":"16 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; 12 where Syntology's instrument failed) · 2 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2406.01063: repository known, no verified implementation (declared_code; repositories: 3 listed of 3 in the graph, strongest link: official). About another paper: this answer is about arXiv:2406.01063, while the archive credits arXiv:2002.07953.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"60737164a9be1e7013e139e9233bc6a4a15f89b5230c66f34b724c6007446772","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}