Methods › General › Deep Tabular Learning › SCARF
SCARF
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
SCARF is a simple, widely-applicable technique for contrastive learning, where views are formed by corrupting a random subset of features. When applied to pre-train deep neural networks on the 69 real-world, tabular classification datasets from the OpenML-CC18 benchmark, SCARF not only improves classification accuracy in the fully-supervised setting but does so also in the presence of label noise and in the semi-supervised setting where only a fraction of the available training data is labeled.
In Syntology verified reference implementation at level V3; retrieve with get_reference_implementation(name='SCARF'). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2106.15147) is about this method is not checked.
Origin paper of this answer, arXiv:2106.15147 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 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; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result (of 3 harvested samples). 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: 7 · with a code link: 4 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 7 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 7 of 7, 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.
-
A System for Comprehensive Assessment of RAG Frameworks 10 Apr 2025 · 1 repository · arXiv:2504.07803
-
Some Characterizations of TTC in Multiple-Object Reallocation Problems 7 Apr 2024 · 0 repositories · arXiv:2404.04822
-
House-Swapping with Objective Indifferences 15 Jun 2023 · 0 repositories · arXiv:2306.09529
-
Best of Both Worlds: Multimodal Contrastive Learning with Tabular and Imaging Data 24 Mar 2023 · 2 repositories · arXiv:2303.14080
-
Revealed Preferences of One-Sided Matching 25 Oct 2022 · 0 repositories · arXiv:2210.14388
-
Capturing and Animation of Body and Clothing from Monocular Video 4 Oct 2022 · 1 repository · arXiv:2210.01868
-
SCARF: Self-Supervised Contrastive Learning using Random Feature Corruption 29 Jun 2021 · 1 repository · arXiv:2106.15147Syntology 1 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; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result (of 3 harvested samples)
Tasks archive 2025-07-28
8 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Contrastive Learning | 2 |
| Combinatorial Optimization | 1 |
| RAG | 1 |
| Representation Learning | 1 |
| Retrieval | 1 |
| Retrieval-augmented Generation | 1 |
| Virtual Try-on | 1 |
| tabular-classification | 1 |
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