Skip to content

SFAD: Speculative Factuality-Aware Decoding

Sep 2026 · 0 citations
Computer Science

TL;DR

SFAD is presented, a speculative decoding framework that enhances contextual faithfulness without inference degradation and substantially improves faithfulness while achieving $2.48\times$ speedup, offering a practical solution for efficient LLMs.

Abstract

As one of the most critical challenges in large language models, contextual faithfulness directly determines their reliability in knowledge-intensive applications. This task is particularly challenging as it requires balancing factual consistency with generation efficiency. Contrastive decoding methods require dual forward passes (with and without context) to compare model outputs, doubling inference computational overhead, while post-training alignment demands extensive reinforcement learning with substantial computational overhead. To address this challenge, we present SFAD, a speculative decoding framework that enhances contextual faithfulness without inference degradation. We first construct ConFide, a preference dataset with fine-grained atomic perturbations, to train a context-faithful draft model via Direct Preference Optimization. During inference, Epistemic Friction detects potential hallucinations by quantifying distributional tension weighted by specialist certainty. When friction exceeds the threshold, Asymmetric Logit Steering refines the target distribution through residual-based logit injection; otherwise, standard speculation proceeds. Extensive experiments demonstrate that SFAD substantially improves faithfulness while achieving $2.48\times$ speedup, offering a practical solution for efficient LLMs.

View source

Similar papers

Open access Aug 2026

Towards Trustworthy Large Language Models

An integrated conceptual frame-work that couples attention- and perturbation-based explainability with lightweight hallucination-detection signals and token-efficient inference strategies is presented, and a set of cross-cutting consistency metrics are instrumented with a set of cross-cutting consistency metrics.

Sakshi Parate, Shreyans Sanyal · 0 citations
#natural language process... Preprint Aug 2026

Information-Guided Frontier Decoding: Contextual Utility-Driven Commitment in dMLLMs

IGFD is proposed, a training-free decoding strategy that ranks candidates using token confidence, neighborhood uncertainty, and structural commitment risk and consistently outperforms existing decoding strategies across the majority of benchmarks and diffusion MLLM backbones under identical decoding budgets.

Xing-You Fang, Jin Zhong, Xiaosong Yuan et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Look Before You Leap: Factual Decoding with Internal Attribution Signals

This work identifies a factual-salient layer span within LLMs whose derived signal is selectively elevated for factual tokens and exhibits anomalous spikes at hallucination-prone steps, and proposes DescaPE, a decoding framework that leverages internal model signals to suppress hallucination-prone trajectories at infer...

Hayeong Ryu, Jungmin Yun, B. Lim et al. · 0 citations
Preprint Sep 2026

Beyond Saying Less: Fine-Grained Alignment for Informative and Faithful Vision-Language Models

This work proposes a fine-grained alignment framework that couples dense reward signals at the data level with precise credit assignment at the algorithmic level to prevent response-level shared advantages from allowing local hallucinations to compromise all other valid outputs within the same response.

Xing-Ming Long, Jie Zhang, Yue-Cong Min et al. · 0 citations
Preprint Aug 2026

Actionable Hallucination Detection: Translating Latent Uncertainty into Agentic Critique

The Latent Critic is introduced, a lightweight low-rank adapter that operates concurrently with a frozen base LLM's generation to actively restructure the transformer's residual stream---amplifying latent grounding signals and translating them into localized, natural language feedback within a single sequence.

S. Vijayvargiya, R. Lokesh · 2 citations
#artificial intelligence Preprint Sep 2026

Evaluating Losslessness in Speculative Decoding Under Finite-Precision Inference

A gap between algorithmic losslessness and its implementation under finite-precision arithmetic is demonstrated and motivated, to motivate evaluating lossless speculative decoding at the level of exact generation trajectories as well as downstream task performance.

Ilya Koziev, Leonid S. Sinev, I. Oseledets · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.