Pith. sign in

REVIEW 5 cited by

Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2406.16797 v2 pith:7CG7CC47 submitted 2024-06-24 cs.CL cs.AI

Ashwinee Panda , Berivan Isik , Xiangyu Qi , Sanmi Koyejo , Tsachy Weissman , Prateek Mittal This is my paper · ORCID
classification cs.CLcs.AI
keywords tasksadaptationlotalotterymodelperformancesparsecatastrophic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Existing methods for adapting large language models (LLMs) to new tasks are not suited to multi-task adaptation because they modify all the model weights -- causing destructive interference between tasks. The resulting effects, such as catastrophic forgetting of earlier tasks, make it challenging to obtain good performance on multiple tasks at the same time. To mitigate this, we propose Lottery Ticket Adaptation (LoTA), a sparse adaptation method that identifies and optimizes only a sparse subnetwork of the model. We evaluate LoTA on a wide range of challenging tasks such as instruction following, reasoning, math, and summarization. LoTA obtains better performance than full fine-tuning and low-rank adaptation (LoRA), and maintains good performance even after training on other tasks -- thus, avoiding catastrophic forgetting. By extracting and fine-tuning over lottery tickets (or sparse task vectors), LoTA also enables model merging over highly dissimilar tasks. Our code is made publicly available at https://github.com/kiddyboots216/lottery-ticket-adaptation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. SelfAug: Mitigating Catastrophic Forgetting in Retrieval-Augmented Generation via Distribution Self-Alignment

    cs.CL 2025-09 conditional novelty 5.0 of 10

    Adding a KL penalty between fine-tuned and original model logits on input tokens during RAG fine-tuning reduces catastrophic forgetting while preserving downstream performance.

  2. Intrinsic Strain-Driven Topological Evolution in SrRuO3 via Flexural Strain Engineering

    cond-mat.mtrl-sci 2025-08 unverdicted novelty 5.0 of 10

    The abstract reports a 21% anomalous Hall conductivity increase in flexurally strained SrRuO3, but the submitted full text belongs to a different machine learning paper.

  3. Exploring Sparse Adapters for Scalable Merging of Parameter Efficient Experts

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Sparse adapters trained with max connection sensitivity outperform LoRA and full fine-tuning both alone and after merging 20 task experts, but still lag multitask training on unseen tasks.

  4. DeFTX: Denoised Sparse Fine-Tuning for Zero-Shot Cross-Lingual Transfer

    cs.CL 2025-05 conditional novelty 5.0 of 10

    DeFT-X applies SVD denoising to weight updates before magnitude pruning in composable sparse fine-tuning, showing small average gains over LT-SFT on NusaX and AmericasNLI.

  5. Mitigating Catastrophic Forgetting in Large Language Models with Forgetting-aware Pruning

    cs.LG 2025-09 conditional novelty 4.0 of 10

    FAPM prunes task vectors using a combined absolute and relative change magnitude criterion, reducing forgetting on general benchmarks to roughly a third of a percent while keeping downstream accuracy near the fine-tun...

Pith tools