CILMP: Multifunctional Incremental Learning

• CILMP is a contextual label encompassing methods such as class-incremental learning with memorization and privacy, CLIP-based continual adaptation, and conditional intervention for medical prompt tuning.
• Each approach under CILMP deploys distinct adaptation strategies, including analytic linear heads, low-rank prompt interventions, or hierarchical multi-layer matching to mitigate catastrophic forgetting.
• The methods focus on preserving prior knowledge via compressed memory objects and largely frozen backbones while tailoring updates to domain-specific applications.

Searching arXiv for papers mentioning “CILMP” and the provided identifiers to ground the article. CILMP is not a single standardized term in recent arXiv literature. Instead, it appears in several distinct technical contexts: as Class-Incremental Learning with Memorization and Privacy in analytic continual learning, as an informal label for CLIP-based class-incremental learning with prompting or with multi-pretrained models, and as the formal method name Conditional Intervention of LLMs for Prompt Tuning in medical image classification (Zhuang et al., 2022, Wen et al., 26 Sep 2025, Du et al., 16 Nov 2025). Because these usages differ in objective, architecture, and evaluation protocol, the meaning of CILMP must be resolved from the surrounding research program rather than from the acronym alone.

1. Terminological scope and disambiguation

The recent literature supports a disambiguated reading of the acronym.

Usage in literature	Expansion or role	Representative source
Analytic continual learning	Class-Incremental Learning with Memorization and Privacy	(Zhuang et al., 2022)
CLIP-based continual learning	Informal shorthand for CLIP-based CIL with prompting or multi-pretrained models	(Wen et al., 26 Sep 2025, Chen et al., 14 Nov 2025, Li et al., 14 Nov 2025)
Medical VLM prompt tuning	Conditional Intervention of LLMs for Prompt Tuning	(Du et al., 16 Nov 2025)
Notational confusion	Misspelling or confusion with CLIMP	(Shabtay et al., 11 Jan 2026)

In the broader literature on Collaborative Interactive Learning, the acronym itself is not established: a clarification paper on CIL explicitly notes that “CILMP” does not appear there, and any expansion would therefore be speculative in that context (Hanika et al., 2019). A separate 2026 vision-language paper further cautions that “CILMP” is sometimes used when the intended term is CLIMP, short for “Contrastive Language-Image Mamba Pretraining,” which is a different model family entirely (Shabtay et al., 11 Jan 2026).

A common misconception is therefore to assume that CILMP denotes a unique algorithm. The papers instead indicate a polysemous acronym whose interpretation depends on whether the surrounding topic is analytic class-incremental learning, CLIP-based continual adaptation, or medical prompt tuning.

2. CILMP as Class-Incremental Learning with Memorization and Privacy

In the ACIL framework, CILMP denotes Class-Incremental Learning with Memorization and Privacy and refers to a class-incremental regime in which the incremental learner should match the result of joint learning while avoiding storage of historical raw data (Zhuang et al., 2022). The setting is standard class-incremental learning with disjoint class sets across phases, evaluation on all classes seen so far, and no access to past training samples once a phase has ended. ACIL realizes this regime by combining a backbone trained on base classes with a frozen feature extractor and an analytic linear head updated by recursive least squares–type formulas.

The central object is the regularized feature autocorrelation matrix,

$$\mathbf{R}_{k-1} = \left(\sum_{i=0}^{k-1}\mathbf{X}_i^{\text{(fe)T}}\mathbf{X}_i^{\text{(fe)}} + \gamma \mathbf{I}\right)^{-1},$$

which functions as a compressed sufficient statistic for all previously seen phases. Given phase-$k$ features $\mathbf{X}_k^{\text{(fe)}}$, ACIL updates this statistic by a Sherman–Morrison–Woodbury recursion and then updates the classifier weights so that the resulting solution is mathematically identical to the ridge-regression solution that would have been obtained by joint training on all data up to phase $k$. This equality is the paper’s notion of absolute memorization.

Privacy, in this formulation, means that no raw images, per-sample historical features, or old labels are stored or revisited during incremental training. What persists are the current classifier weights and the dense second-order statistic $\mathbf{R}_k$. The paper argues that this is privacy-preserving in the CIL sense because it avoids exemplar storage and direct sample retention, even though the stored object is still a data-dependent statistic.

The empirical behavior is aligned with this formulation. On CIFAR-100, ACIL’s average incremental accuracy remains nearly constant as the number of phases increases, specifically $$66.30 \rightarrow 66.07 \rightarrow 65.95 \rightarrow 66.01$$ for $K=5,10,25,50$; on ImageNet-Full the corresponding trajectory is $$65.34 \rightarrow 64.84 \rightarrow 64.63 \rightarrow 64.35$$. The paper interprets this stability as practical evidence that forgetting introduced by the incremental procedure itself is eliminated at the classifier-head level, and that residual degradation is primarily due to class competition rather than recursive updating (Zhuang et al., 2022).

3. CILMP in CLIP-based class-incremental learning

A different usage emerges in the 2025 CLIP-based CIL literature, where CILMP functions less as a fixed acronym expansion than as a label for CLIP-centric class-incremental learning with prompt tuning, adapters, replayed feature statistics, or other PEFT-style mechanisms. One paper explicitly describes DMC and DMC-OT as CLIP-based CIL with prompting, “what you call ‘CILMP’,” while another frames BOFA as advancing CIL with multi-pretrained models (Chen et al., 14 Nov 2025, Li et al., 14 Nov 2025).

Within this line of work, the underlying task is usually rehearsal-free or exemplar-free class-incremental learning with a frozen or mostly frozen CLIP backbone. An image encoder $g_v$ and text encoder $g_t$ define a shared space, the label set grows over tasks, and forgetting often appears as degraded alignment between old visual features and text prototypes. Typical mitigation strategies include learning small prompt or adapter modules instead of fine-tuning the full backbone, using Gaussian feature statistics for replay, or stabilizing a small subset of trainable parameters (Wen et al., 26 Sep 2025).

The HERMAN paper formalizes two limitations of prior CLIP-based CIL approaches that it characterizes as “CILMP-like.” First, the text side is flat: methods rely on class names plus simple templates such as “a photo of a [CLASS]” and do not encode explicit hierarchy. Second, the vision side typically uses only the last-layer CLS representation, ignoring intermediate-layer hierarchy. HERMAN addresses these limitations by matching hierarchical textual descriptors to multi-layer CLS features and routing them adaptively across layers (Wen et al., 26 Sep 2025).

This usage of CILMP is therefore best understood as a contextual label for a family of CLIP-based continual-learning designs rather than as a uniquely defined acronym. The papers suggest a research area centered on how pre-trained vision-LLMs can be incrementally adapted without catastrophic loss of old cross-modal structure.

4. Representative CLIP-based CILMP mechanisms

Three representative mechanisms illustrate how this CLIP-based usage has evolved.

HERMAN introduces HiErarchical Representation MAtchiNg for CLIP-based CIL. For each class $k$0, an LLM generates a sequence of hierarchical descriptors $k$1 ranging from coarse to fine. CLIP text embeddings of these descriptors are matched against CLS tokens extracted from all transformer layers, not just the last one. At each layer $k$2, cosine similarities select a top-$k$3 subset, and their weighted aggregation yields a layer-specific textual summary $k$4. A router with parameter $k$5 then computes soft weights over layers, producing

$k$6

To prevent forgetting in the router itself, HERMAN performs an SVD of $k$7, defines an “old routing subspace,” and projects future router updates into a stability–plasticity mixture controlled by $k$8. The method also uses feature-level generative replay by maintaining Gaussian statistics over CLS features. Across all datasets and both base settings, the paper reports consistent gains over the strongest baselines, typically about $k$9–$\mathbf{X}_k^{\text{(fe)}}$0 in both average and final accuracy, and attributes these gains to hierarchical descriptors, multi-layer matching, and projection-constrained routing (Wen et al., 26 Sep 2025).

BOFA localizes all adaptation to CLIP’s existing image-side bridge-layer $\mathbf{X}_k^{\text{(fe)}}$1, the linear projection from high-dimensional visual features into the shared embedding space. It constructs an Orthogonal Safe Subspace from the smallest-eigenvalue directions of the past feature scatter matrix and constrains each new low-rank bridge-layer update to lie in that subspace: $\mathbf{X}_k^{\text{(fe)}}$2 This Orthogonal Low-Rank Fusion is intended to reduce the interference term $\mathbf{X}_k^{\text{(fe)}}$3 and thereby suppress forgetting without replay. BOFA further introduces a cross-modal hybrid prototype

$\mathbf{X}_k^{\text{(fe)}}$4

which combines stable textual prototypes with visual prototypes computed through the adapted bridge-layer. The paper emphasizes that adaptation adds no extra parameters or inference cost because it reuses an existing CLIP layer, and it reports best or near-best $\mathbf{X}_k^{\text{(fe)}}$5 and $\mathbf{X}_k^{\text{(fe)}}$6 on nine datasets while remaining exemplar-free (Li et al., 14 Nov 2025).

DMC and DMC-OT instead decouple visual and textual adaptation into two stages. Stage 1 updates only the vision encoder under a CLIP-style contrastive loss while freezing the text encoder, so that text acts as a semantic anchor. Stage 2 freezes the vision encoder and trains class-specific soft prompts by cross-entropy, using class-wise Gaussian replay in feature space. DMC-OT extends this design by estimating an affine optimal-transport map between pre- and post-update Gaussian statistics on the current task and transporting old-class Gaussian memories into the evolved feature space: $\mathbf{X}_k^{\text{(fe)}}$7 It also adds task-specific prompts with an orthogonality regularizer to enhance inter-task separability. In a 10-task setting, DMC-OT reaches $\mathbf{X}_k^{\text{(fe)}}$8 on CIFAR-100, $\mathbf{X}_k^{\text{(fe)}}$9 on ImageNet-R, $k$0 on CUB-200, and $k$1 on UCF-101, with an average gain of $k$2 over DMC (Chen et al., 14 Nov 2025).

Taken together, these methods show that CLIP-based CILMP has become a design space organized around three recurring axes: where adaptation is placed, how cross-modal alignment is preserved, and how old-task structure is summarized without raw-image replay.

5. CILMP as Conditional Intervention of LLMs for Prompt Tuning

In a separate research line, CILMP is the formal name of a medical VLM method: Conditional Intervention of LLMs for Prompt Tuning (Du et al., 16 Nov 2025). This CILMP addresses medical image classification, not class-incremental learning. Its aim is to inject disease-specific knowledge from a frozen LLM into a frozen CLIP-like vision-LLM through low-rank, image-conditioned prompt construction.

For each disease class $k$3, the method queries LLaMA3-8B with the prompt “In an image, describe the distinctive visual features of $k$4.” It then extracts the EOS-token hidden state from every LLM layer, producing

$k$5

These representations are not used directly. Instead, each selected layer representation is combined with the image embedding $k$6 through a relationship descriptor

$k$7

and then edited by a low-rank conditional intervention

$k$8

Only prefix and suffix segments of the LLM representation are intervened upon, a bilateral strategy intended to balance adaptation with preservation of original knowledge. The intervened LLM representations are projected into CLIP prompt space via a low-rank factorization $k$9 and concatenated with learned prompt tokens: $\mathbf{R}_k$0

The resulting prompts are disease-specific and instance-adaptive. Both the VLM and the LLM remain frozen; the trainable part consists of prompt tokens, intervention parameters, and low-rank projection matrices, totaling about $\mathbf{R}_k$1M parameters. The paper reports that, averaged over 11 medical datasets, this CILMP outperforms DCPL by $\mathbf{R}_k$2 ACC, $\mathbf{R}_k$3 F1, $\mathbf{R}_k$4 AUC, and $\mathbf{R}_k$5 Kappa, while approaching the performance of fully fine-tuned medical VLMs with roughly $\mathbf{R}_k$6–$\mathbf{R}_k$7 fewer trainable parameters (Du et al., 16 Nov 2025).

Despite sharing the acronym, this method belongs to a different problem class from the continual-learning usages above. Its defining contribution is not memorization or catastrophic-forgetting mitigation, but LLM-mediated knowledge injection into prompts for medical visual discrimination.

6. Shared motifs, distinctions, and open issues

Across these otherwise distinct usages, several motifs recur. First, CILMP often denotes methods that keep large pretrained backbones frozen or nearly frozen and shift adaptation into small trainable objects: analytic linear heads in ACIL, routers or bridge-layers in CLIP-based CIL, and low-rank prompt interventions in medical prompt tuning. Second, many formulations replace raw-sample retention with compressed memory objects: $\mathbf{R}_k$8 in ACIL, Gaussian feature statistics in DMC and HERMAN, or scatter matrices and class means in BOFA. Third, semantic anchoring is recurrent: fixed text prototypes in CLIP-based CIL and disease-specific LLM representations in medical CILMP both serve as stabilizing structures.

The distinctions are equally important. ACIL’s CILMP is a precise theoretical regime with a joint-learning equivalence theorem and a privacy argument grounded in sufficient statistics (Zhuang et al., 2022). CLIP-based CILMP is a looser methodological label focused on cross-modal continual adaptation, prompt bias, replay in feature space, and architectural placement of PEFT modules (Wen et al., 26 Sep 2025, Chen et al., 14 Nov 2025, Li et al., 14 Nov 2025). Medical CILMP is a named prompt-tuning method for static supervised classification, and its core unit of adaptation is a conditional intervention on LLM hidden states rather than an incremental class stream (Du et al., 16 Nov 2025).

The explicit limitations reported by the papers also differ. ACIL is limited by its frozen backbone and linear-head assumptions (Zhuang et al., 2022). HERMAN notes dependence on LLM descriptor quality, lack of patch-level alignment, and computational overhead from multi-layer descriptor matching (Wen et al., 26 Sep 2025). DMC-OT identifies drift in feature memories when the encoder changes and treats OT calibration as a remedy rather than a complete resolution (Chen et al., 14 Nov 2025). BOFA incurs scatter-matrix storage and depends on a suitable low-rank choice and a CLIP architecture with a distinct bridge-layer (Li et al., 14 Nov 2025). Medical CILMP points to LLM extraction cost, latent interpretability, and potential demographic or corpus biases in medical knowledge injection (Du et al., 16 Nov 2025).

These usages suggest that CILMP is best treated as a contextual research label rather than a canonical method family. In contemporary arXiv practice, it can denote a privacy-preserving analytic formulation of class-incremental learning, a cluster of CLIP-based continual-learning strategies, or a medical prompt-tuning method grounded in conditional LLM intervention. Any rigorous use of the term therefore requires explicit expansion and domain specification.