arXiv Computer Vision By Mingyu Wang, Wei Jiang, Haojie Liu, Zhiyong Li, Weijie Mao

Beyond Discrete Samples: High Information Density Replay for Efficient Lifelong Person Re-Identification

Read the original on arXiv Computer Vision →

The paper introduces HiDeR, a High Information Density Replay framework for Lifelong Person Re-Identification that replaces discrete sample selection with information compression. It uses a complexity‑aware memory allocation based on intra‑class variance and a metric‑guided condensation objective to preserve essential identity topologies, while a cross‑modality adaptation strategy bridges synthetic and real styles to improve training. Experiments show HiDeR outperforms state‑of‑the‑art methods in knowledge retention and generalization, and reduces cumulative replay cost.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

arXiv Machine Learning
Aug 31

Unsupervised Continual Learning with Growing Self-Organizing Maps and Synthetic Replay

The paper introduces a generative continual learning framework that uses growing self‑organizing maps (GSOMs) enhanced with learned distributional statistics and encoder‑decoder models for class‑incremental learning. GSOM units store mean, variance, and covariance estimates to synthesize replay samples, enabling exemplar‑free training without raw data or explicit task boundaries. Experiments on multiple benchmarks show that the unsupervised method competes with supervised memory‑based approaches and outperforms memory‑free baselines, especially in single‑class incremental scenarios, and provides baseline results for TinyImageNet and MiniImageNet.

By Pujan Thapa, Alexander Ororbia, Travis Desell
arXiv Machine Learning
Oct 5

Fisher-Guided Submodular Data Selection for Continual Pre-Training of Large Language Models

The paper introduces a Fisher-guided submodular data selection method for continual pre‑training of large language models, addressing the forgetting problem that arises when a target‑domain corpus overwrites pretrained knowledge. By decomposing candidate gradients into anchor and frontier components and optimizing a log‑determinant submodular objective, the method selects data that both improves target‑domain performance and limits forgetting. Experiments on TinyLlama‑1.1B and Llama‑3.1‑8B show that the selector achieves superior adaptation and forgetting control while using ten times fewer tokens than traditional replay strategies.

By Zhenghao Zhao, Gaowen Liu, Zhiling Lan, Yan Yan
arXiv Machine Learning
Jul 31

Continual Learning for VLMs: A Survey and Taxonomy Beyond Forgetting

arXiv:2508. 04227v3 Announce Type: replace-cross Abstract: Vision-language models (VLMs), spanning predictive architectures to generative Multimodal Large Language Models (MLLMs), have revolutionized artificial intelligence through powerful cross-modal alignment and zero-shot generalization.

By Yuyang Liu, Qiuhe Hong, Linlan Huang, Alexandra Gomez-Villa, Dipam Goswami, Tiantian Peng, Xialei Liu, Joost van de Weijer, Yonghong Tian