๐จ Presenting PrefixNLI (Oral) tomorrow at #ACL2026! ๐ด
Hallucinations start with a single token. So why wait for a full sentence to detect them?
We extend Natural Language Inference to arbitrary text prefixes, detecting factual inconsistencies as soon as they arise and using that signal to guide decoding.
Our controlled decoding method delivers major faithfulness gains in summarization. A 3B model matches an 8B model in faithfulness while maintaining similar runtime, using half the memory, and is substantially faster than prior lookahead methods.
@SapirHarary, @hirscheran, @lovodkin93, @meetdavidwan, @mohitban47, Ido Dagan
๐ Regatta
โฐ 2:10pm
https://t.co/YHmGvbXkMD
Hope to see you there! ๐
#NLProc #ACL2026
It was a pleasure to present our work, PrefixNLI, as an ACL 2026 Oral (top 5% of submissions).
Thank you to everyone who attended the talk. And of course, thanks to my co-authors!
๐ Paper: https://t.co/QgoDu1x3Cx
#ACL2026#NLP#AI#MachineLearning#ACL2026NLP#NLProc@aclmeeting
๐จ Presenting PrefixNLI (Oral) tomorrow at #ACL2026! ๐ด
Hallucinations start with a single token. So why wait for a full sentence to detect them?
We extend Natural Language Inference to arbitrary text prefixes, detecting factual inconsistencies as soon as they arise and using that signal to guide decoding.
Our controlled decoding method delivers major faithfulness gains in summarization. A 3B model matches an 8B model in faithfulness while maintaining similar runtime, using half the memory, and is substantially faster than prior lookahead methods.
@SapirHarary, @hirscheran, @lovodkin93, @meetdavidwan, @mohitban47, Ido Dagan
๐ Regatta
โฐ 2:10pm
https://t.co/YHmGvbXkMD
Hope to see you there! ๐
#NLProc #ACL2026
๐จ New paper alert!
Weโre thrilled to share our new preprint โPrefixNLI: Detecting Factual Inconsistencies as Soon as They Ariseโ โจ
LLMs generate text one token at a time, but factuality checks still wait for a full sentence.
We extend NLI to text prefixes, enabling the catching of factual errors as soon as they arise during generation, achieving major faithfulness gains with 25ร lower computational cost than lookahead methods.
๐งตโฌ๏ธ
When integrated into decoding, MiniTruePrefixes:
โ Improves faithfulness of the generated text by +8 faithfulness points
โก Runs 25ร faster than lookahead methods
๐พ A 3B generator + our 1B PrefixNLI model outperforms 8B generator faithfulness at half the memory and no added latency, without retraining