Pith. sign in

REVIEW 1 cited by

Tangent Transformers for Composition, Privacy and Removal

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.08122 v3 pith:HDT74OHI submitted 2023-07-16 cs.LG

classification cs.LG
keywords fine-tuningtangentnon-linearresultingtafttransformerscompositionoriginal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce Tangent Attention Fine-Tuning (TAFT), a method for fine-tuning linearized transformers obtained by computing a First-order Taylor Expansion around a pre-trained initialization. We show that the Jacobian-Vector Product resulting from linearization can be computed efficiently in a single forward pass, reducing training and inference cost to the same order of magnitude as its original non-linear counterpart, while using the same number of parameters. Furthermore, we show that, when applied to various downstream visual classification tasks, the resulting Tangent Transformer fine-tuned with TAFT can perform comparably with fine-tuning the original non-linear network. Since Tangent Transformers are linear with respect to the new set of weights, and the resulting fine-tuning loss is convex, we show that TAFT enjoys several advantages compared to non-linear fine-tuning when it comes to model composition, parallel training, machine unlearning, and differential privacy. Our code is available at: https://github.com/tianyu139/tangent-model-composition

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Interaction-Merged Motion Planning: Effectively Leveraging Diverse Motion Datasets for Robust Planning

    cs.RO 2025-07 conditional novelty 6.0 of 10

    A two-step model-merging method transfers interaction knowledge from multiple motion datasets to a target domain, outperforming ensembling and domain adaptation at the same inference cost.

Pith tools