arXiv Machine Learning

Early Learning Shapes Later Directions Of Representation Change In Continual Learning

arXiv AI
Jun 17

Dimensionality Controls When Modularity Helps in Continual Learning

arXiv:2606. 17889v1 Announce Type: cross Abstract: Compositional learning systems must balance plasticity, the ability to acquire new knowledge, with stability, the preservation of previously learned components, especially when tasks share structure and risk interference.

By Kathrin Korte, Christian Medeiros Adriano, Joachim Winther Pedersen, Eleni Nisioti, Sebastian Risi
arXiv Computer Vision
Aug 27

A Visual Dependence-Aware Framework for Multimodal Unsupervised Continual Post-Training

The paper introduces a new task called Multimodal Unsupervised Continual Post-Training (MU‑CPT), which allows multimodal large language models (MLLMs) to continuously learn from streaming unlabeled data. It identifies token‑level visual dependence (VD) as essential for MU‑CPT, using its structural distortion to detect cross‑modal forgetting and its heterogeneity to guide new‑task learning. The proposed Visual Dependence‑Aware (VDA) framework includes Visually Constrained Optimal Transport (VC‑OT) to mitigate forgetting and Visually Modulated Adaptation (VMA) to enhance new‑task plasticity, achieving a balance between stability and adaptability in MU‑CPT.

By Kaichen Li, Zhilin Zhu, Jianhao Huang, Zhengqin Lai, Baochen Xiong, Zibo Shao, Yaguang Song, Linhui Xiao, Xiaoshan Yang, Changsheng Xu
arXiv Machine Learning
Oct 3

Localizing Transfer Between Memorization Tasks

The paper investigates how pre‑training on random input‑output mappings (memorization tasks) can transfer to downstream tasks. It discovers two unexpected patterns: equivalent transfer, where each pre‑training epoch saves roughly one fine‑tuning epoch, and non‑equivalent transfer, where pre‑training on a mismatched task can be more efficient than training directly on the downstream task. Ablation studies reveal that transfer consists of a trivial magnitude‑driven effect in the last layer and a non‑trivial structure‑driven effect linked to covariance in other layers.

By Yimiao Yu, Florentin Guth
arXiv Machine Learning
Sep 2

How Temporal Correlations Shape Memory in Linear Recurrent Neural Networks

The paper analyzes how temporal correlations in input sequences affect memory formation in linear recurrent neural networks (LRNNs). By solving the learning dynamics for correlated inputs, it shows that correlation introduces a cost to retaining past information, reshaping the learning trajectory and reducing the network’s memory of past inputs. Key findings include a correlation‑dependent threshold for memory retention, the influence of input similarity on memory usefulness, and the emergence of a feedthrough path when zero error is required.

By Arnol Manuel Fokam, Fasseu Sieyondji Akpevwoghene, Edem Fiifi Dawson
arXiv Machine Learning
Oct 28

FlowGenesis: Representation-Driven Self-Organization of Neural Architectures

FlowGenesis is a framework that lets neural networks self‑organize their architecture during training by adding or removing neurons based on a local statistic called Representation Flux. Neurons with high Flux are split to preserve function, while low‑Flux, low‑activity neurons are pruned. Experiments on image and text classification show that networks starting from different sizes converge to similar neuron counts and performance, and the method also improves continual learning by reducing parameters for new tasks without sacrificing accuracy.

By Maksim A Kazanskii
arXiv AI
Nov 5

Drift-adaptive Representation Preservation for Domain-Incremental Learning

The paper proposes a drift‑adaptive method for Domain‑Incremental Learning that tracks representation drift for each past domain‑class pair. By measuring how much a concept’s current representation deviates from a fixed anchor, the method assigns stronger preservation to high‑drift pairs and down‑weights highly drifted domains during prototype construction. Experiments on DomainNet, Office‑Home, CORe50, and CDDB‑Hard show that this approach maintains a strong accuracy‑forgetting balance while using less training memory and the smallest storage compared to other methods.

By Hyunmin Kong, Gyutae Oh, Jitae Shin