Pith. sign in

REVIEW 2 cited by

HiDe-PET: Continual Learning via Hierarchical Decomposition of Parameter-Efficient Tuning

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 2407.05229 v2 pith:YJE32S25 submitted 2024-07-07 cs.LG

classification cs.LG
keywords hierarchicalknowledgelearningpre-trainedptmsapproachcontinualdecomposition
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The deployment of pre-trained models (PTMs) has greatly advanced the field of continual learning (CL), enabling positive knowledge transfer and resilience to catastrophic forgetting. To sustain these advantages for sequentially arriving tasks, a promising direction involves keeping the pre-trained backbone frozen while employing parameter-efficient tuning (PET) techniques to instruct representation learning. Despite the popularity of Prompt-based PET for CL, its empirical design often leads to sub-optimal performance in our evaluation of different PTMs and target tasks. To this end, we propose a unified framework for CL with PTMs and PET that provides both theoretical and empirical advancements. We first perform an in-depth theoretical analysis of the CL objective in a pre-training context, decomposing it into hierarchical components namely within-task prediction, task-identity inference and task-adaptive prediction. We then present Hierarchical Decomposition PET (HiDe-PET), an innovative approach that explicitly optimizes the decomposed objective through incorporating task-specific and task-shared knowledge via mainstream PET techniques along with efficient recovery of pre-trained representations. Leveraging this framework, we delve into the distinct impacts of implementation strategy, PET technique and PET architecture, as well as adaptive knowledge accumulation amidst pronounced distribution changes. Finally, across various CL scenarios, our approach demonstrates remarkably superior performance over a broad spectrum of recent strong baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A gradient-similarity tree of LoRA adapters, searched by an LCB bandit algorithm, delivers state-of-the-art continual learning accuracy with up to 3.2x faster training on ViTs and 2.4x on LLMs.

  2. Scalable Strategies for Continual Learning with Replay

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A replay-based continual learning toolkit that combines low-rank adaptation, a post-task consolidation phase, and sequential weight merging to cut replay sample usage by up to 65% at matched accuracy.

Pith tools