paper-with-me

Papers

Beyond Real Weights: Hypercomplex Representations for Stable Quantization

2025-12-09 · Jawad Ibn Ahad, Maisha Rahman, Amrijit Biswas, Muhammad Rafsan Kabir, Robin Krambroeckers, Sifat Momen, Nabeel Mohammed, Shafin Rahman arxiv

Multimodal language models (MLLMs) require large parameter capacity to align high-dimensional visual features with linguistic representations, making them computationally heavy and difficult to deploy efficiently. We introduce a progressive reparameterization strategy that compresses these models by gradually replacing dense feed-forward network blocks with compact Parameterized Hypercomplex Multiplication (PHM) layers. A residual interpolation schedule, together with lightweight reconstruction and knowledge distillation losses, ensures that the PHM modules inherit the functional behavior of their dense counterparts during training. This transition yields substantial parameter and FLOP reductions while preserving strong multimodal alignment, enabling faster inference without degrading output quality. We evaluate the approach on multiple vision-language models (VLMs). Our method maintains performance comparable to the base models while delivering significant reductions in model size and inference latency. Progressive PHM substitution thus offers an architecture-compatible path toward more efficient multimodal reasoning and complements existing low-bit quantization techniques.

📄 PDF Abstract BibTeX arXiv:2512.08524

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge DistillationMultimodal Reasoning

Similar Papers 제목 키워드 기반

Quaternion Knowledge Graph Embeddings

2019-04-23 · NeurIPS 2019 12 · Shuai Zhang, Yi Tay, Lina Yao, Qi Liu

In this work, we move beyond the traditional complex-valued representations, introducing more expressive hypercomplex representations to model entities and relations for knowledge graph embeddings. More specifically, qua…

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graph Embeddings+3

A Nature-Inspired Feature Selection Approach based on Hypercomplex Information

2021-01-14 · Gustavo H. de Rosa, João Paulo Papa, Xin-She Yang

Feature selection for a given model can be transformed into an optimization task. The essential idea behind it is to find the most suitable subset of features according to some criterion. Nature-inspired optimization can…

feature selection

Beyond Fully-Connected Layers with Quaternions: Parameterization of Hypercomplex Multiplications with $1/n$ Parameters

2021-02-17 · Aston Zhang, Yi Tay, Shuai Zhang, Alvin Chan 외

Recent works have demonstrated reasonable success of representation learning in hypercomplex space. Specifically, "fully-connected layers with Quaternions" (4D hypercomplex numbers), which replace real-valued matrix mult…

Machine TranslationNatural Language InferenceRepresentation LearningStyle Transfer+2

CDRec: Cayley-Dickson Recommender

2021-12-16 · Anchen Li, Bo Yang, Huan Huo, Farookh Hussain

In this paper, we propose a recommendation framework named Cayley-Dickson Recommender. We introduce Cayley-Dickson construction which uses a recursive process to define hypercomplex algebras and their mathematical operat…

Temporal Knowledge Graph Completion with Time-sensitive Relations in Hypercomplex Space

2024-03-02 · Li Cai, Xin Mao, Zhihong Wang, Shangqing Zhao 외

Temporal knowledge graph completion (TKGC) aims to fill in missing facts within a given temporal knowledge graph at a specific time. Existing methods, operating in real or complex spaces, have demonstrated promising perf…

Knowledge Graph CompletionTemporal Knowledge Graph Completion