Papers › RanPAC: Random Projections and Pre-trained Models for Continual Learning

RanPAC: Random Projections and Pre-trained Models for Continual Learning

5 Jul 2023NeurIPS 2023 11arXiv:2307.02251archive 2025-07-28

Mark D. McDonnell, Dong Gong, Amin Parveneh, Ehsan Abbasnejad, Anton Van Den Hengel

Continual learning (CL) aims to incrementally learn different tasks (such as classification) in a non-stationary data stream without forgetting old ones. Most CL works focus on tackling catastrophic forgetting under a learning-from-scratch paradigm. However, with the increasing prominence of foundation models, pre-trained models equipped with informative representations have become available for various downstream requirements. Several CL methods based on pre-trained models have been explored, either utilizing pre-extracted features directly (which makes bridging distribution gaps challenging) or incorporating adaptors (which may be subject to forgetting). In this paper, we propose a concise and effective approach for CL with pre-trained models. Given that forgetting occurs during parameter updating, we contemplate an alternative approach that exploits training-free random projectors and class-prototype accumulation, which thus bypasses the issue. Specifically, we inject a frozen Random Projection layer with nonlinear activation between the pre-trained model's feature representations and output head, which captures interactions between features with expanded dimensionality, providing enhanced linear separability for class-prototype-based CL. We also demonstrate the importance of decorrelating the class-prototypes to reduce the distribution disparity when using pre-trained representations. These techniques prove to be effective and circumvent the problem of forgetting for both class- and domain-incremental continual learning. Compared to previous methods applied to pre-trained ViT-B/16 models, we reduce final error rates by between 20% and 62% on seven class-incremental benchmarks, despite not using any rehearsal memory. We conclude that the full potential of pre-trained models for simple, effective, and fast CL has not hitherto been fully tapped. Code is at github.com/RanPAC/RanPAC.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2307.02251")

Code

Syntology Ran 9 of 15 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 3 ran · honoured contract; 4 ran · our draft was wrong; 2 ran with no contract checked.

By repository: official repository: 15 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ranpac/ranpac officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested; 9 ran; 3 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran · honoured contract
4ran · our draft was wrong
2ran
6unverified

Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ranpac/ranpac. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

build_transform ranpac/ranpac/utils/data.py official repository ran MIT (permissive) · 8425222b4660e321 · report
conv1x1 ranpac/ranpac/resnet.py official repository ran · our draft was wrong MIT (permissive) · d9def42110729a85 · report
conv3x3 ranpac/ranpac/resnet.py official repository ran · our draft was wrong MIT (permissive) · 160bb14bd76201b4 · report
count_parameters ranpac/ranpac/utils/toolkit.py official repository ran · honoured contract MIT (permissive) · 6bdbe3d6368c4cde · report
get_init_weights_vit ranpac/ranpac/petl/vision_transformer_ssf.py official repository ran MIT (permissive) · def23f7d7d042968 · report
init_ssf_scale_shift ranpac/ranpac/petl/vision_transformer_ssf.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 896b5eec245f1bab · report
ssf_ada ranpac/ranpac/petl/vision_transformer_ssf.py official repository ran · honoured contract fingerprinted MIT (permissive) · 61e8364b7e9bcb70 · report
target2onehot ranpac/ranpac/utils/toolkit.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 284e2e0345abe291 · report
tensor2numpy ranpac/ranpac/utils/toolkit.py official repository ran · honoured contract MIT (permissive) · 929c76a2fa2e8c42 · report
build_promptmodel ranpac/ranpac/petl/vpt.py official repository unverified MIT (permissive) · caf426ace8f9b740 · report
get_convnet ranpac/ranpac/inc_net.py official repository unverified MIT (permissive) · 2edd6df79bc77668 · report
pil_loader ranpac/ranpac/utils/data_manager.py official repository unverified MIT (permissive) · 66b63ed4f327a712 · report
resnet18 ranpac/ranpac/resnet.py official repository unverified MIT (permissive) · d48a8b0d2e61f5f7 · report
vit_base_patch16_224_adapter ranpac/ranpac/petl/vision_transformer_adapter.py official repository unverified MIT (permissive) · f51aa4aca78dae1d · report
vit_base_patch16_224_in21k_adapter ranpac/ranpac/petl/vision_transformer_adapter.py official repository unverified MIT (permissive) · 606a5e08f74e25f2 · report

Tasks

Continual Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Focus

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections