Skip to content

Hyperbolic Multimodal Continual Learning: A Closest-Admissible Solution

Sep 2026 · 0 citations · 82 references
Computer Science

TL;DR

Across a unified 16-task classification-retrieval stream with three hyperbolic backbones, HMCL improves final performance and backward transfer over sequential fine-tuning and four continual-learning baselines; HMCL-CA gives the highest Overall score on every backbone.

Abstract

Existing continual-learning methods protect parameters, replayed examples, or Euclidean feature subspaces. When applied to hyperbolic multimodal models, they do not explicitly preserve the Lorentz geometry that jointly encodes within-modality similarity, cross-modal correspondence, and semantic hierarchy; sequential updates can therefore retain task scores while still distorting previously learned relations. We address this gap with Hyperbolic Multimodal Continual Learning (HMCL). We show that preserving the old multimodal geometry amounts to restricting all modalities to one shared hyperbolic isometry, which induces a family of admissible first-order parameter changes. We formulate a joint closest-admissible (CA) correction that retains the shared rotation best matching the candidate modal updates; its minimal-rotation (MR) special case fixes this rotation to zero. Both variants correct the displacement realized by AdamW, and task anchoring bounds within-task accumulation while preserving learning freedom. Across a unified 16-task classification-retrieval stream with three hyperbolic backbones, HMCL improves final performance and backward transfer over sequential fine-tuning and four continual-learning baselines; HMCL-CA gives the highest Overall score on every backbone. A modality-extended stream confirms the retrieval gains. Representation analyses find 81.2 to 95.5 percent less radial, angular, cross-modal, and paired-distance drift; ImageNet-WordNet results show better semantic ancestry and radial hierarchy.

View source

Similar papers

Preprint Aug 2026

Hyperbolic Multimodal Continual Learning

Hyperbolic geometry has recently emerged as a powerful representation space for multimodal learning, as it naturally captures hierarchical semantic structure across modalities. Despite this progress, how such representations behave under continual learning poses fundamentally different challenges that remain underexplo...

Jia-Hong Liu, Ming Shen, Xiao-Hao Liu et al. · 2 citations
Open access Sep 2026

Mixture of Lie-Group Kernels for Equivariance-Inspired Feature Learning.

MoLiegroup is introduced, a framework that embeds multiple Lie-group priors as specialized kernel experts and adaptively fuses them via a geometry-aware gating mechanism to learn equivariance-inspired geometric features and supplies a practical, architecture-agnostic geometric inductive bias that improves expressivity...

Yao-Xian Yang, Guipeng Lan, Shuai Xiao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Geometry-Aware Hyperbolic Residual-Quantized Variational Autoencoders

Evaluations on hierarchical prediction, recommendation, image tokenization, and neural audio coding tasks show that the proposed geometry-aware hyperbolic residual quantization improves the stability and structural organization of hyperbolic residual codes over naive hyperbolic baselines.

Alessio Colombo, M. Ayoughi · 0 citations
#machine learning Preprint Oct 2026

MuLoRA: Spectrally Balanced Low-Rank Adaptation for Continual Learning

A historical whitening identifies input directions with strong current-task response relative to accumulated historical response, yielding a task-adaptive basis that remains fixed during training, and an orthonormal basis connects these mechanisms by transferring the factor-update spectrum exactly to the induced weight...

Jun-Kang Liu · 1 citation
#machine learning Preprint Sep 2026

Minimal-Norm Univariate Two-Layer ReLU Classification: Exact Solutions and Global Optimality with Skip Connections

It is shown that adding a free affine skip connection leaves these function-space solutions unchanged but fundamentally improves the parameter-space landscape: every KKT point of the constrained problem becomes globally optimal, whereas suboptimal KKT points can occur without the skip connection.

Karolina Drabik, Ben Lewis, Antoni Puch et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Riemannian--Lorentz Fusion of Vision Transformers and State-Space Models

Scaling deep learning faces critical bottlenecks: data exhaustion, exponential training costs, and resource concentration. Model merging combines pre-trained checkpoints without gradient descent, offering orders-of-magnitude savings versus retraining. Combining independently trained vision models is difficult when thei...

B. Patro, V. Agneeswaran · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.