atlas

Research map / Continual learning / Continual fine-tuning of LLMs

Scalable Language Model with Generalized Continual Learning

ICLR 2024 · Continual learning › Continual fine-tuning of LLMs · approach: Continual pretraining of language models · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Scalable Language Model (SLM), combining Joint Adaptive Re-Parameterization (JARe) with Dynamic Task-related Knowledge Retrieval (DTKR) so that LoRA-style weight increments are stored as key-value pairs and retrieved by query-key similarity for continual learning without replay, optimization constraints, or task-ID.

Problem

Continual learning for language models typically relies on experience replay, optimization constraints, or task-IDs at inference, which are impractical in real-world settings; most prior work also covers only single task types such as classification.

Approach

Store each task's low-rank weight increment as a value paired with a learned key that estimates the task distribution centroid; at inference, retrieve the K nearest keys to the input's query (Sentence-BERT features) and re-parameterize the frozen pretrained model with a similarity-weighted average of the retrieved increments. Group-based retrieval and random key masking address keys getting stuck

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use SLM instead of IDBRBERT-base continual learning · BERT benchmark (Orders 4–7, Avg)accuracy: 76.3 -> 79.1Helped
use SLM instead of LFPT5T5-large few-shot continual learning · T5 benchmark (Orders 1–3, Avg)accuracy: 52.7 -> 73.1Helped
use SLM instead of FinetuneLLaMA2-7B continual learning · LLaMA benchmark (Finance → MMLU → Medical), Financeaccuracy: 18.0 -> 89.0Helped
replace JARe weight increments with prompts (ablation)DTKR on BERT-base · BERT benchmark (Orders 4–6, Avg)accuracy: 79.0 -> 53.3Hurt
replace JARe weight increments with adapters (ablation)DTKR on BERT-base · BERT benchmark (Orders 4–6, Avg)accuracy: 79.0 -> 70.9Hurt
fine-tune tasks individually instead of continual learning (ablation)BERT-base · BERT benchmark (Orders 4–6, Avg)accuracy: 79.0 -> 79.8Helped
use out-layer attention weights rather than query, key, or value weights (ablation)BERT-base re-parameterization · BERT tasks (amazon, ag, yahoo, db; Average)accuracy: 82.3 -> 83.1Helped
remove random keys mask (ablation)group-based key retrieval on BERT-base · BERT benchmark (key retrieval accuracy, Avg)accuracy: 96.1 -> 94.6Hurt
remove group retrieval and random keys mask (ablation)key retrieval on BERT-base · BERT benchmark (key retrieval accuracy, Avg)accuracy: 96.1 -> 89.5Hurt
increase Rank from 2 to 4 (ablation)SLM on BERT-base · BERT benchmark (parameter-size ablation, Avg)accuracy: 77.8 -> 78.7Helped
increase TopK from 2 to 4 (ablation)SLM on BERT-base · BERT benchmark (parameter-size ablation, Avg)accuracy: 78.7 -> 79.1Helped
increase Rank from 8 to 12 (ablation)SLM on BERT-base · BERT benchmark (parameter-size ablation, Avg)accuracy: 79.7 -> 80.0Helped

Surprising findings

Limitations

Experimental setup

Datasets: AG News Yelp DBPedia Amazon Yahoo Answers MMLU Medical QA (ChatDoctor) Finance sentiment (tweets)

Benchmarks: AG News Yelp DBPedia Amazon Yahoo Answers MMLU Medical QA Finance sentiment ARC-c ARC-e PIQA WinoGrande

Metrics: accuracy BERTScore average accuracy forgetting

Baselines: Finetune Replay MBPA++ IDBR LFPT5 ProgPrompt EWC Prompt

Builds on: LoRA IDBR LFPT5 Sentence-BERT ProgPrompt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy