arXiv AI

Logical Embeddings for Argument Analysis

arXiv:2608. 15325v1 Announce Type: cross Abstract: We propose a new framework for machine-learning-oriented argument analysis tasks.

arXiv Computation and Language
Aug 31

Embedding Models for Stance-Aware Argument Retrieval

The paper investigates how dense embedding models can be used for stance-aware argument retrieval, a task that requires both topic relevance and correct stance (support or attack) toward a claim. Experiments reveal that current models favor topical overlap and ignore stance, and that contrastive training to fix this bias leads to over-correction, where models focus too much on polarity keywords at the expense of topic relevance. To address this, the authors propose diagnostic word-ablation metrics and a data‑centric solution involving a balanced argument curriculum and LLM‑augmented stance‑inverted arguments, which helps powerful models learn deeper directional logic and improves stance‑aware retrieval performance.

By Angelo Sparacino, Francesca Toni, Adam Dejl
arXiv AI
Sep 2

Do General NLP Embeddings Capture Ontological Reasoning?

The paper introduces AVA, a framework that tests whether general NLP embeddings can differentiate logic-sensitive relational semantics in ontologies and knowledge graphs. AVA uses 171,007 contrastive triplets from 163 ontologies, each containing an ontology statement, a paraphrase, and a hard negative with contradictory meaning. Evaluation of over 25 embedding models shows significant limitations, with the best model achieving only 0.739 triplet accuracy and 0.135 for hard negatives; fine‑tuning helps but does not transfer well to downstream Semantic Web tasks.

By Hamed Babaei Giglou, Jennifer D'Souza, S\"oren Auer
arXiv AI
Jun 3

ReaLM: Residual Quantization Bridging Knowledge Graph Embeddings and Large Language Models

arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.

By Wenbin Guo, Xin Wang, Jiaoyan Chen, Lingbing Guo, Zhao Li, Zirui Chen
arXiv AI
Sep 25

Is Reasoning Always Useful? Rethinking Reasoning Utility in Universal Multimodal Embeddings

The paper investigates whether reasoning always benefits universal multimodal embeddings (UMEs). By comparing the discriminative and reasoning-driven branches of UME-R1, the authors find that while reasoning improves positive similarity in 56.6% of cases, it also creates 15.7% false-helpful instances where hard negatives are drawn closer. Diagnostic analyses reveal that reasoning often de‑condenses retrieved neighborhoods and that chain‑of‑thought tokens encode evidence common to both positives and hard negatives. Based on these insights, the authors introduce SURE, a utility router that boosts UME-R1‑7B by 1.5 points and consistently improves other embedding models on MMEB‑V2 without retraining or extra VLM passes.

By Wenxiao Fan, Jingling Fu, Luohang Liu, Xinyuan Shan, Lichen Ma, Yu He, Junshi Huang, Yan Li, Kan Li
arXiv Machine Learning
Jun 24

Does My Embedding Reflect That $A = B$? Evaluating Mathematical Equivalence in Embedding Models

arXiv:2606. 23959v1 Announce Type: cross Abstract: Because mathematics is highly abstract, a single statement can take very different forms depending on what subfield it is framed in.

By Jiaying Ye, Samarth Rao, Leo Carlin, Kedar Chintalapati, Saharsh Bhargava, Rachit Jaiswal, Michael Zhou, Jared Darlington, Jarod Alper, Vasily Ilin, Henry Kvinge