Pith. sign in

REVIEW 1 cited by

Side-Tuning: A Baseline for Network Adaptation via Additive Side Networks

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 1912.13503 v4 pith:ZVAMQYHQ submitted 2019-12-31 cs.LG cs.CVcs.NEcs.RO

classification cs.LGcs.CVcs.NEcs.RO
keywords networklearningside-tuningpre-trainedwhenadaptationtrainingapproaches
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

When training a neural network for a desired task, one may prefer to adapt a pre-trained network rather than starting from randomly initialized weights. Adaptation can be useful in cases when training data is scarce, when a single learner needs to perform multiple tasks, or when one wishes to encode priors in the network. The most commonly employed approaches for network adaptation are fine-tuning and using the pre-trained network as a fixed feature extractor, among others. In this paper, we propose a straightforward alternative: side-tuning. Side-tuning adapts a pre-trained network by training a lightweight "side" network that is fused with the (unchanged) pre-trained network via summation. This simple method works as well as or better than existing solutions and it resolves some of the basic issues with fine-tuning, fixed features, and other common approaches. In particular, side-tuning is less prone to overfitting, is asymptotically consistent, and does not suffer from catastrophic forgetting in incremental learning. We demonstrate the performance of side-tuning under a diverse set of scenarios, including incremental learning (iCIFAR, iTaskonomy), reinforcement learning, imitation learning (visual navigation in Habitat), NLP question-answering (SQuAD v2), and single-task transfer learning (Taskonomy), with consistently promising results.

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. LARA: Lightweight Adapters in the Residual Stream for Composable Adaptation and Alignment

    cs.LG 2026-07 conditional novelty 4.0 of 10

    Low-rank residual-stream adapters match LoRA at near-equal parameter counts on code fine-tuning and DPO, and support inference-time scaling plus per-token routing of seven behaviors on one frozen 1.5B model.

Pith tools