Papers › Dash: Semi-Supervised Learning with Dynamic Thresholding
Dash: Semi-Supervised Learning with Dynamic Thresholding
Yi Xu, Lei Shang, Jinxing Ye, Qi Qian, Yu-Feng Li, Baigui Sun, Hao Li, Rong Jin
While semi-supervised learning (SSL) has received tremendous attentions in many machine learning tasks due to its successful use of unlabeled data, existing SSL algorithms use either all unlabeled examples or the unlabeled examples with a fixed high-confidence prediction during the training progress. However, it is possible that too many correct/wrong pseudo labeled examples are eliminated/selected. In this work we develop a simple yet powerful framework, whose key idea is to select a subset of training examples from the unlabeled data when performing existing SSL methods so that only the unlabeled examples with pseudo labels related to the labeled data will be used to train models. The selection is performed at each updating iteration by only keeping the examples whose losses are smaller than a given threshold that is dynamically adjusted through the iteration. Our proposed approach, Dash, enjoys its adaptivity in terms of unlabeled data selection and its theoretical guarantee. Specifically, we theoretically establish the convergence rate of Dash from the view of non-convex optimization. Finally, we empirically demonstrate the effectiveness of the proposed method in comparison with state-of-the-art over benchmarks.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Syntology holds a reference implementation of Dash, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: 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.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='Dash') (how to connect); the free check have('2109.00650') needs no token.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="2109.00650", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2109.00650")
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.
1 assembly on this paper: 0 harvested, 1 generated.
generated Assembly for Dash (graph method: Dash), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).
label matches by construction: the code was generated for this method (not judged by a model)
- compute_truncated_gradient entry · level 3 · ran · violated contract ·
8ee85ecf12dc5f380e91c86c20d4b197920fe487253059fddb6296200e967c36
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2109.00650") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Semi-Supervised Image Classification | CIFAR-10, 250 Labels | Dash (RA) | Percentage error | 4.56±0.13 | #5 of 27 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-10, 4000 Labels | Dash (RA, ours) | Percentage error | 4.08±0.06 | #9 of 49 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-100, 2500 Labels | Dash (RA, WRN-28-8) | Percentage error | 27.18±0.21 | #13 of 16 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-100, 400 Labels | Dash (RA, WRN-28-8) | Percentage error | 44.76±0.96 | #18 of 21 | Archive leaderboard | report |
| Semi-Supervised Image Classification | CIFAR-100, 400 Labels | Dash (CTA, WRN-28-8) | Percentage error | 44.83±1.36 | #19 of 21 | Archive leaderboard | report |
| Semi-Supervised Image Classification | cifar-100, 10000 Labels | Dash (RA, WRN-28-8) | Percentage error | 21.97±0.14 | #13 of 29 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
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