Skip to content
Preprint

Hypergraph-Regularized Gramian Volumes for Multimodal Retrieval

Sep 2026 · 0 citations · 63 references
Computer Science

TL;DR

This work introduces Hypergraph-Regularized Gramian Volumes (HyVol), a training-time module that incorporates semantic relations prior to evaluating the original volume loss of Gram, and removes the hypergraph after training, leaving the backbone-only architecture, original scoring function, and retrieval cost unchanged.

Abstract

Volume-based multimodal retrieval jointly scores a text query with a candidate's video, audio, and subtitle embeddings. While this approach captures higher-order within-candidate alignment, the score remains candidate-local, and semantically related training samples primarily serve as contrastive negatives. This work introduces Hypergraph-Regularized Gramian Volumes (HyVol), a training-time module that incorporates these semantic relations prior to evaluating the original volume loss. Document hyperedges connect the observed modalities of each candidate, whereas semantic hyperedges link candidates whose detached captions are mutual top-k neighbors. A shallow gated hyper-graph network applies residual corrections to the modality embeddings. Presence masks exclude unavailable streams from message passing, and identity padding preserves the determinant of the observed Gram submatrix without feature imputation. As refinement operates on embeddings rather than scores, the same construction applies to both Gram and HyperGram. We remove the hypergraph after training, leaving the backbone-only architecture, original scoring function, and retrieval cost unchanged. We train both backbones on a 150K-clip subset of VAST-27M and evaluate zero-shot performance on six benchmarks. Under the paired protocol, HyVol improves R@1 across all five retrieval benchmarks, with video-to-text gains reaching +8.3 on MSR-VTT and +7.6 on VATEX. Under missing-modality masking, the V2T margin remains positive in all experimental settings, although the T2V margin becomes slightly negative in four.

View source

Similar papers

Preprint Sep 2026

Beyond Similarity: Foundation Models as an Efficient Backbone for Training-Free Composed Video Retrieval

Results show that adaptively orchestrating foundation-model capabilities can combine scalable retrieval with fine-grained reasoning without task-specific training, and are shown to be state-of-the-art among training-free approaches.

Dmitry Demidov, Muhammad Zaigham Zaheer, Omkar Thawakar et al. · 0 citations
#computer vision Preprint Aug 2026

Hyper3-CLIP: Hierarchy-Conditioned Hyperbolic Vision-Language Training

Hyper3-CLIP is presented, a hierarchy-conditioned hyperbolic VLM that combines global, local, and global-local contrastive learning with query-conditioned visual pooling and improves R@5 and R@10 retrieval on COCO and Flickr, as well as multi-label classification on VOC and COCO, while remaining competitive on hierarch...

Matin Mahmood, Antonio Rueda-Toicen, Mohamed ElBassat et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ResComEmb: Effective and Efficient Multimodal Embedding via Residual Homogeneity Compression

ResComEmb is proposed, a trainable framework for effective and efficient universal multi-vector multimodal embedding that produces higher-quality universal multimodal embeddings than VLM2Vec-V2, and outperforms ColQwen2.5 in visual document retrieval.

Zi-Jing Cai, Yu-Zhe Wang, Jing-Xian Zhu et al. · 0 citations
Preprint Aug 2026

Hypergraph-based Multimodal Retrieval-Augmented Generation with Incremental Refinement

This paper formalizes the document structure as a Multimodal Hypergraph, utilizing hyperedges as unified semantic containers to encapsulate multi-way associations across text, images, and tables, thereby transcending point-to-point modeling and introducing an Anchor-driven Incremental Refinement mechanism.

Shenao Chen, Yidan Xu, Xiangmin Han et al. · 0 citations
Preprint Sep 2026

Generative Late-Interaction Embeddings For Visual Document Retrieval

Generative Late-Interaction Embeddings (GLIE): k<<N vectors per page learned from the normalized centroids to serve as both a lightweight index and a basis for regenerating the page's full embedding set, with the decoder as its main design surface.

M. Eltahir, Talal Aloushan, Rose Khairoalsendi et al. · 0 citations

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