arXiv Machine Learning
Effective Graph and Rank-based Contextual Embeddings for Textual and Multimedia Data
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 1
Context-Aware Interpretable Representations for Retrieval and Graph Convolutional Network Classification
The paper introduces an unsupervised framework that merges manifold learning with rank‑based interpretable graph embeddings to address the Geometric and Interpretability Gaps in visual representation learning. By first analyzing contextual information on the dataset manifold and then producing sparse, self‑explainable embeddings, the method achieves dimensionality reduction while preserving or improving performance in image retrieval and semi‑supervised Graph Convolutional Network classification. Experiments across varied datasets confirm that these context‑aware representations maintain high downstream effectiveness.
arXiv Computer Vision
Sep 3
Aggregating Neighbor Embedding Projection and Rank-Based Manifold Learning for Image Retrieval
The paper introduces a new image retrieval framework that merges neighbor embedding projections with rank-based manifold learning via rank aggregation. It uses UMAP to create low‑dimensional feature representations and combines ranked lists from UMAP and rank‑based re‑ranking methods using the Borda Count strategy. Experiments on public datasets with ResNet152, Swin Transformer, and DINOv2 features show that this combined approach improves retrieval performance, especially in scenarios where baseline representations have low precision.
arXiv AI
Jul 13
Integrating Large Language Models and Graph Convolutional Networks for Semi-Supervised Image Classification
arXiv:2607. 09104v1 Announce Type: cross Abstract: While the growing availability of image data has driven significant advances, labeling datasets remains costly and time-consuming.
arXiv Machine Learning
Jul 7
Graph Classification via Network Usable Information: From Representation Evaluation to Structure Selection
arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.
arXiv AI
Jul 21
RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion
arXiv:2604. 25693v2 Announce Type: replace Abstract: Most multi-modal knowledge graph completion (MMKGC) models use one embedding scorer to conduct both retrieval over the full entity set and final link prediction.
arXiv AI
Sep 4
CORE: Improving Compositional Reasoning in MLLM Embedding via Reranker Distillation
CORE improves compositional reasoning in multimodal language models by distilling a cross‑attentive reranker’s fine‑grained judgments into the embedding model. It generates candidate lists across five compositional matching levels and trains with a Rank‑KL objective to replicate the reranker’s ranking. Experiments on COLA, SUGARCREPE++, and NEGBENCH show CORE‑RERANKER‑8B outperforms Jina‑Reranker by 10.7 points, while CORE‑EMBED‑8B achieves the best overall average among evaluated embeddings, with gains also transferring to the MCMR benchmark without harming COCO or Flickr30K retrieval.