This paper introduces diagnostic word-ablation metrics to quantify this phenomenon and proposes a data-centric solution that can alleviate the observed overcorrection in stance-aware argument retrieval and demonstrates that, for sufficiently powerful models, this approach can alleviate the observed overcorrection.
Abstract
In computational argumentation, obtaining arguments that explicitly support or attack given claims is a critical precursor to downstream reasoning tasks. When these supporting and attacking arguments are to be retrieved using semantic search methods, they need to be assessed for topic-relevance to the claims of interest as well as for correctness of their (positive or negative) stance towards the claims. In this paper we explore how dense embedding models (hereafter, models), powering modern retrieval pipelines, can serve as the basis of semantic search incorporating this dual assessment. We show experimentally that existing models struggle with asymmetric reasoning, exhibiting a strong bias toward topical overlap while ignoring instructional stance. We also show that correcting this bias via contrastive training triggers a new failure mode where models over-correct, over-fixating on polarity keywords (e.g.,"supports"or"refutes") at the expense of the semantic topic. We thus introduce diagnostic word-ablation metrics to quantify this phenomenon and propose a data-centric solution. By implementing a balanced argument curriculum alongside LLM-augmented, stance-inverted arguments, we force the (embedding) models to learn deeper directional logic rather than exploiting superficial lexical shortcuts. Our evaluation demonstrates that, for sufficiently powerful models, this approach can alleviate the observed overcorrection, achieving further improvements in stance-aware argument retrieval.
This work introduces a guided retrieval-augmented methodology for fallacy detection and classification that leverages argumentative relations of support and attack to dynamically steer the extraction of relevant documents when retrieval is argumentatively guided.
Deborah Dore, Greta Damo, Elena Cabrio et al.· 0 citations
It is proved that logical embeddings encapsulate the logical semantics of an argument, allowing for a better representation of its meaning, and that this encoding is optimal, in the sense that no logical information is lost in the process.
Large language models have improved rapidly on tasks with verifiable answers, such as mathematics and programming. Much less is known about their ability to reason about what we call conceptual questions: questions for which no ground truth is realistically accessible and no widely accepted resolution methodology exist...
Preliminary evidence is given that argument structure is a useful intermediate representation for aligning specialized normative texts in cross-standard control mapping and a neuro-symbolic pipeline is built that combines neural text representations with Toulmin features.
GEM is presented, a generative embedding model that augments retrieval through its own knowledge by explicitly reasoning about user intent and relevance criteria, and its generative nature allows test-time compute scaling via prompting to further enhance retrieval performance.
Large language models (LLMs) are known to be sensitive to prompt and input formulations. However, existing studies have focused on lexical realization and largely ignored constructional choice. This paper studies whether linguistic construction can systematically shift LLM decisions and where these shifts can be causal...
Langchen Huang, Sebastian Padó, Franziska Weeber· arXiv.org· 0 citations