paper-with-me

홈 › Papers

A Differentiable Semantic Metric Approximation in Probabilistic Embedding for Cross-Modal Retrieval

2022-12-06 · NeurIPS 2022 2022 12 · Hao Li, Jingkuan Song, Lianli Gao, Pengpeng Zeng, Haonan Zhang, Gongfu Li

Cross-modal retrieval aims to build correspondence between multiple modalities by learning a common representation space. Typically, an image can match multiple texts semantically and vice versa, which significantly increases the difficulty of this task. To address this problem, probabilistic embedding is proposed to quantify these many-to-many relationships. However, existing datasets (e.g., MS-COCO) and metrics (e.g., Recall@K) cannot fully represent these diversity correspondences due to non-exhaustive annotations. Based on this observation, we utilize semantic correlation computed by CIDEr to find the potential correspondences. Then we present an effective metric, named Average Semantic Precision (ASP), which can measure the ranking precision of semantic correlation for retrieval sets. Additionally, we introduce a novel and concise objective, coined Differentiable ASP Approximation (DAA). Concretely, DAA can optimize ASP directly by making the ranking function of ASP differentiable through a sigmoid function. To verify the effectiveness of our approach, extensive experiments are conducted on MS-COCO, CUB Captions, and Flickr30K, which are commonly used in cross-modal retrieval. The results show that our approach obtains superior performance over the state-of-the-art approaches on all metrics. The code and trained models are released at https://github.com/leolee99/2022-NeurIPS-DAA.

📄 PDF Abstract BibTeX

Code (2)

VL-Group/2022-NeurIPS-DAA 공식 구현 pytorch
leolee99/2022-neurips-daa pytorch

Tasks

Cross-Modal RetrievalImage-text matchingImage-to-Text RetrievalRetrieval

Similar Papers 제목 키워드 기반

Differentiable Neuro-Symbolic Reasoning on Large-Scale Knowledge Graphs

2023-09-21 · NeurIPS 2023 11

Knowledge graph (KG) reasoning utilizes two primary techniques, i.e., rule-based and KG-embedding based. The former provides precise inferences, but inferring via concrete rules is not scalable. The latter enables effici…

ANDRE: An Attention-based Neuro-symbolic Differentiable Rule Extractor for Inductive Logic Programming

2026-05-05 · Iman Sharifi, Peng Wei, Saber Fallah arxiv

Inductive Logic Programming (ILP) aims to learn interpretable first-order rules from data, but existing symbolic and neuro-symbolic approaches struggle to scale to noisy and probabilistic settings. Classical ILP relies o…

Inductive logic programming

Differentiable Product Quantization for Learning Compact Embedding Layers

2020-01-01 · ICML 2020 1 · Ting Chen, Lala Li, Yizhou Sun

Embedding layers are commonly used to map discrete symbols into continuous embedding vectors that reflect their semantic meanings. Despite their effectiveness, the number of parameters in an embedding layer increases lin…

Quantization

Learning Compact Embedding Layers via Differentiable Product Quantization

2019-09-25 · Ting Chen, Lala Li, Yizhou Sun

Embedding layers are commonly used to map discrete symbols into continuous embedding vectors that reflect their semantic meanings. Despite their effectiveness, the number of parameters in an embedding layer increases lin…

Quantization

Differentiable Product Quantization for End-to-End Embedding Compression

2019-08-26 · Ting Chen, Lala Li, Yizhou Sun

Embedding layers are commonly used to map discrete symbols into continuous embedding vectors that reflect their semantic meanings. Despite their effectiveness, the number of parameters in an embedding layer increases lin…

Quantization