Methods › General › Domain Adaptation › DANCE
Domain Adaptative Neighborhood Clustering via Entropy Optimization
DANCE
Introduced by Kuniaki Saito et al. in Universal Domain Adaptation through Self Supervision
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
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.
In Syntology 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.
From the lookup's note on this name: 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. For arXiv:2009.06237: ask the lookup about it.
Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.
- DISCO-DANCE · shares_name_tokens (shares name tokens with this name; a different method) · level V3 · retrieve with
get_reference_implementation(name='DISCO-DANCE')
Origin paper of this answer, arXiv:2406.01063 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 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 (of 18 harvested samples) · 18 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “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)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “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.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).
Papers archive 2025-07-28
archive papers tagged: 10 · with a code link: 6 · where Syntology ran a sample: 3 (2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (3 of 10 tagged: 2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 10 of 10, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Dataset Distillers Are Good Label Denoisers In the Wild 18 Nov 2024 · 1 repository · arXiv:2411.11924Syntology official (archive's flag): 17 ran · 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 (of 19 harvested samples) · 19 pointer-only (licence)
-
DANCE: Deep Learning-Assisted Analysis of Protein Sequences Using Chaos Enhanced Kaleidoscopic Images 10 Sep 2024 · 0 repositories · arXiv:2409.06694
-
Improving Commonsense in Vision-Language Models via Knowledge Graph Riddles 29 Nov 2022 · 1 repository · arXiv:2211.16504
-
Graph Neural Networks for Multimodal Single-Cell Data Integration 3 Mar 2022 · 1 repository · arXiv:2203.01884Syntology official (archive's flag): 3 ran · 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 (of 3 harvested samples)
-
Domain Adaptation of Networks for Camera Pose Estimation: Learning Camera Pose Estimation Without Pose Labels 29 Nov 2021 · 1 repository · arXiv:2111.14741
-
DANCE: DAta-Network Co-optimization for Efficient Segmentation Model Training and Inference 16 Jul 2021 · 0 repositories · arXiv:2107.07706
-
More Robust Dense Retrieval with Contrastive Dual Learning 16 Jul 2021 · 1 repository · arXiv:2107.07773Syntology official (archive's flag): 1 ran · 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 (of 1 harvested sample) · 1 pointer-only (licence)
-
Decorrelating Adversarial Nets for Clustering Mobile Network Data 11 Mar 2021 · 0 repositories · arXiv:2103.08348
-
DANCE: Differentiable Accelerator/Network Co-Exploration 14 Sep 2020 · 0 repositories · arXiv:2009.06237
-
Universal Domain Adaptation through Self Supervision 19 Feb 2020 · 1 repository · arXiv:2002.07953
Tasks archive 2025-07-28
20 shown of 26 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections