paper-with-me

Papers

Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs

2024-06-24 · Ashwinee Panda, Berivan Isik, Xiangyu Qi, Sanmi Koyejo, Tsachy Weissman, Prateek Mittal

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.

📄 PDF Abstract BibTeX arXiv:2406.16797

Code (1)

kiddyboots216/lottery-ticket-adaptation 공식 구현 pytorch

Tasks

Instruction FollowingMath

Similar Papers 제목 키워드 기반

Communication-Efficient and Personalized Federated Lottery Ticket Learning

2021-04-26 · Sejin Seo, Seung-Woo Ko, Jihong Park, Seong-Lyun Kim 외

The lottery ticket hypothesis (LTH) claims that a deep neural network (i.e., ground network) contains a number of subnetworks (i.e., winning tickets), each of which exhibiting identically accurate inference capability as…

Federated LearningMulti-Task Learning

Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space

2026-05-18 · Alon Bebchuk, Nir Shavit arxiv

The lottery ticket hypothesis posits that dense networks contain sparse subnetworks, ``winning tickets,'' that, when rewound to their initial weights and retrained in isolation, match the performance of the full model. W…

KS-Lottery: Finding Certified Lottery Tickets for Multilingual Language Models

2024-02-05 · Fei Yuan, Chang Ma, Shuai Yuan, Qiushi Sun 외

The lottery ticket hypothesis posits the existence of ``winning tickets'' within a randomly initialized neural network. Do winning tickets exist for LLMs in fine-tuning scenarios? How can we find such winning tickets? In…

Translation

COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks

2022-12-24 · Md. Ismail Hossain, Mohammed Rakib, M. M. Lutfe Elahi, Nabeel Mohammed 외

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winnin…

Finding Strong Lottery Ticket Networks with Genetic Algorithms

2024-11-07 · Philipp Altmann, Julian Schönberger, Maximilian Zorn, Thomas Gabor

According to the Strong Lottery Ticket Hypothesis, every sufficiently large neural network with randomly initialized weights contains a sub-network which - still with its random weights - already performs as well for a g…

Binary Classification