When Kernels Multiply, Clusters Unify: Fusing Embeddings with the Kronecker Product
Not on the map. Why?
Abstract (arXiv)
State-of-the-art embeddings often capture distinct yet complementary discriminative features: For instance, one image embedding model may excel at distinguishing fine-grained textures, while another focuses on object-level structure. Motivated by this observation, we propose a principled approach to fuse such complementary representations through kernel multiplication. Multiplying the kernel similarity functions of two embeddings allows their discriminative structures to interact, producing a fused representation whose kernel encodes the union of the clusters identified by each parent embedding. This formulation also provides a natural way to construct joint kernels for paired multi-modal data (e.g., image-text tuples), where the product of modality-specific kernels inherits structure from both domains. We highlight that this kernel product is mathematically realized via the Kronecker product of the embedding feature maps, yielding our proposed KrossFuse framework for embedding fusion. To address the computational cost of the resulting high-dimensional Kronecker space, we further develop RP-KrossFuse, a scalable variant that leverages random projections for efficient approximation. As a key application, we use this framework to bridge the performance gap between cross-modal embeddings (e.g., CLIP, BLIP) and unimodal experts (e.g., DINOv2, E5). Experiments show that RP-KrossFuse effectively integrates these models, enhancing modality-specific performance while preserving cross-modal alignment. The project code is available at https://github.com/yokiwuuu/KrossFuse.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Jun 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 1; 2026: 5.
6 papers.
- 2025SPARKE: Scalable Prompt-Aware Diversity and Novelty Guidance in Diffusion Models via RKE Scorecited by 14
- 2026MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidancecited by 3
- 2026The Maximum von Neumann Entropy Principle: Theory and Applications in Machine Learningcited by 3
- 2026KODA: Contrastive Representation Comparison and Alignment for Vision-Language Foundation Modelscited by 2
- 2026Mixture-Greedy for Online Generative Model Selection: Is UCB Necessary in Diversity-Aware Multi-Armed Bandits?cited by 1
- 2026Exploring More to Solve More: Boosting Diversity in Text Diffusion Models via Entropy-Based Guidancecited by 1
- 2026Exploring More to Solve More: Boosting Diversity in Text Diffusion Models via Entropy-Based Guidance10 Jul 2026
- 2026KODA: Contrastive Representation Comparison and Alignment for Vision-Language Foundation Models2 Jun 2026
- 2026Mixture-Greedy for Online Generative Model Selection: Is UCB Necessary in Diversity-Aware Multi-Armed Bandits?23 Mar 2026
- 2026The Maximum von Neumann Entropy Principle: Theory and Applications in Machine Learning2 Feb 2026
- 2026MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidance13 Jan 2026
- 2025SPARKE: Scalable Prompt-Aware Diversity and Novelty Guidance in Diffusion Models via RKE Score11 Jun 2025