Methods › General › Domain Adaptation › DANCE

Domain Adaptative Neighborhood Clustering via Entropy Optimization

DANCE

10 papers tagged archive 2025-07-28

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.

PaperSource

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.

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.

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.

TaskPapers
Clustering2
Domain Adaptation2
Retrieval2
Camera Pose Estimation1
Contrastive Learning1
Data Augmentation1
Data Integration1
Dataset Distillation1
Deep Clustering1
Deep Learning1
Denoising1
Diagnostic1
GPU1
Graph Neural Network1
Image Generation1
Image-to-Image Translation1
Information Retrieval1
Neural Architecture Search1
Partial Domain Adaptation1
Pose Estimation1

Usage over time archive 2025-07-28

Papers per year tagged with DANCE: 2020 to 2024, peak 4 4 0 2020: 2 papers 2020 2021: 4 papers 2021 2022: 2 papers 2022 2023: 0 papers 2023 2024: 2 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (10 dated). Bars are counts, not a trend claim.

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

Domain Adaptation

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