Pith. sign in

REVIEW 3 cited by

Optimizing Class Distribution in Memory for Multi-Label Online Continual Learning

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 2209.11469 v1 pith:MQCJLCW7 submitted 2022-09-23 cs.LG

classification cs.LG
keywords memoryclasscontinualdistributionlearningonlinemulti-labelmethods
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Online continual learning, especially when task identities and task boundaries are unavailable, is a challenging continual learning setting. One representative kind of methods for online continual learning is replay-based methods, in which a replay buffer called memory is maintained to keep a small part of past samples for overcoming catastrophic forgetting. When tackling with online continual learning, most existing replay-based methods focus on single-label problems in which each sample in the data stream has only one label. But multi-label problems may also happen in the online continual learning setting in which each sample may have more than one label. In the online setting with multi-label samples, the class distribution in data stream is typically highly imbalanced, and it is challenging to control class distribution in memory since changing the number of samples belonging to one class may affect the number of samples belonging to other classes. But class distribution in memory is critical for replay-based memory to get good performance, especially when the class distribution in data stream is highly imbalanced. In this paper, we propose a simple but effective method, called optimizing class distribution in memory (OCDM), for multi-label online continual learning. OCDM formulates the memory update mechanism as an optimization problem and updates the memory by solving this problem. Experiments on two widely used multi-label datasets show that OCDM can control the class distribution in memory well and can outperform other state-of-the-art methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. DeCLIP: Decoupled Prompting for Multi-Label Class-Incremental Learning with CLIP

    cs.CV 2025-09 conditional novelty 6.0 of 10

    DDP assigns per-class positive and negative prompts in both text and vision branches, plus a progressive temperature schedule, and reports the first replay-free 80% mAP on MS-COCO B40-C10.

  2. L3A: Label-Augmented Analytic Adaptation for Multi-Label Class Incremental Learning

    cs.CV 2025-06 conditional novelty 6.0 of 10

    L3A combines pseudo-label generation with a weighted analytic regression classifier to enable exemplar-free multi-label class-incremental learning.

  3. Cut out and Replay: A Simple yet Versatile Strategy for Multi-Label Online Continual Learning

    cs.LG 2025-05 conditional novelty 6.0 of 10

    CUTER replays cropped label-specific object regions instead of whole multi-label images, and regularizes patch-feature graphs to keep the cropping ability alive, improving multi-label online continual learning across ...

Pith tools