Methods › General › Distributed Methods › Tofu
Tofu
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Tofu is an intra-layer model parallel system that partitions very large DNN models across multiple GPU devices to reduce per-GPU memory footprint. Tofu is designed to partition a dataflow graph of fine-grained tensor operators used by platforms like MXNet and TensorFlow. To optimally partition different operators in a dataflow graph, Tofu uses a recursive search algorithm that minimizes the total communication cost.
In Syntology repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: listed only). The lookup matched 'TOFU' ignoring case. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2607.11423) is about this method is not checked.
From the lookup's note on this name: The same name also belongs to the paper “TOFU: A Task of Fictitious Unlearning for LLMs” (arXiv:2401.06121, 554 citations), which the lookup finds cited far more than the paper this answer is about (0 citations), so this answer may be about a different sense of the name. For arXiv:2401.06121: its page on this site · ask the lookup about it.
Origin paper of this answer, arXiv:2607.11423 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 27 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 21 where Syntology's instrument failed) · 17 unverified (of 44 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.
Papers archive 2025-07-28
archive papers tagged: 19 · with a code link: 6 · where Syntology ran a sample: 2 (1 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 (2 of 19 tagged: 1 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 19 of 19, 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.
-
GUARD: Guided Unlearning and Retention via Data Attribution for Large Language Models 12 Jun 2025 · 0 repositories · arXiv:2506.10946
-
Constrained Entropic Unlearning: A Primal-Dual Framework for Large Language Models 5 Jun 2025 · 0 repositories · arXiv:2506.05314
-
UniErase: Unlearning Token as a Universal Erasure Primitive for Language Models 21 May 2025 · 1 repository · arXiv:2505.15674
-
GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection 19 May 2025 · 0 repositories · arXiv:2505.13312
-
UIPE: Enhancing LLM Unlearning by Removing Knowledge Related to Forgetting Targets 6 Mar 2025 · 0 repositories · arXiv:2503.04693
-
CE-U: Cross Entropy Unlearning 3 Mar 2025 · 0 repositories · arXiv:2503.01224
-
Towards Robust Evaluation of Unlearning in LLMs via Data Transformations 23 Nov 2024 · 1 repository · arXiv:2411.15477
-
Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate 29 Oct 2024 · 0 repositories · arXiv:2410.22086
-
LLM Unlearning via Loss Adjustment with Only Forget Data 14 Oct 2024 · 0 repositories · arXiv:2410.11143
-
Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning 9 Oct 2024 · 2 repositories · arXiv:2410.07163Syntology official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified (of 10 harvested samples) · 1 pointer-only (licence)
-
Answer When Needed, Forget When Not: Language Models Pretend to Forget via In-Context Knowledge Unlearning 1 Oct 2024 · 0 repositories · arXiv:2410.00382
-
Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs 13 Aug 2024 · 1 repository · arXiv:2408.06621Syntology official (archive's flag): 2 ran · 2 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; 2 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples)
-
Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference 12 Jun 2024 · 1 repository · arXiv:2406.08607
-
Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning 8 Apr 2024 · 1 repository · arXiv:2404.05868
-
Token Fusion: Bridging the Gap between Token Pruning and Token Merging 2 Dec 2023 · 0 repositories · arXiv:2312.01026
-
On High-dimensional and Low-rank Tensor Bandits 6 May 2023 · 0 repositories · arXiv:2305.03884
-
TOFU: Towards Obfuscated Federated Updates by Encoding Weight Updates into Gradients from Proxy Data 21 Jan 2022 · 0 repositories · arXiv:2201.08494
-
Topologically Consistent Multi-View Face Inference Using Volumetric Sampling 6 Oct 2021 · 0 repositories · arXiv:2110.02948
-
Supporting Very Large Models using Automatic Dataflow Graph Partitioning 24 Jul 2018 · 0 repositories · arXiv:1807.08887
Tasks archive 2025-07-28
18 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