A pair of reinforcement-learning-trained agents, one for reasoning and one for search, improves accuracy on multi-hop claim verification benchmarks.
DnDScore: Decontextualization and Decomposition for Factuality Verification in Long-Form Text Generation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The decompose-then-verify strategy for verification of Large Language Model (LLM) generations decomposes claims that are then independently verified. Decontextualization augments text (claims) to ensure it can be verified outside of the original context, enabling reliable verification. While decomposition and decontextualization have been explored independently, their interactions in a complete system have not been investigated. Their conflicting purposes can create tensions: decomposition isolates atomic facts while decontextualization inserts relevant information. Furthermore, a decontextualized subclaim presents a challenge to the verification step: what part of the augmented text should be verified as it now contains multiple atomic facts? We conduct an evaluation of different decomposition, decontextualization, and verification strategies and find that the choice of strategy matters in the resulting factuality scores. Additionally, we introduce DnDScore, a decontextualization aware verification method which validates subclaims in the context of contextual information.
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Coordinating Search-Informed Reasoning and Reasoning-Guided Search in Claim Verification
A pair of reinforcement-learning-trained agents, one for reasoning and one for search, improves accuracy on multi-hop claim verification benchmarks.