Xin Liu
Other people with similar names: Xin Liu, Xin Liu, Xin Liu, Xin Liu, Xin Liu, Xin Liu, Xin Liu, Xin Liu, Xin Liu
Unverified author pages with similar names: Xin Liu
2026
ContextCheck: Sentence-Level Faithfulness Verification with Context-Aware Disambiguation
Yueqin Yin | Yaxi Li | Xin Liu | Xun Wang | Kaiqiang Song | Simin Ma | Shujian Liu | Sathish Reddy Indurthi | Haoyun Deng | Pengcheng He | Mingyuan Zhou | Song Wang
Findings of the Association for Computational Linguistics: ACL 2026
Yueqin Yin | Yaxi Li | Xin Liu | Xun Wang | Kaiqiang Song | Simin Ma | Shujian Liu | Sathish Reddy Indurthi | Haoyun Deng | Pengcheng He | Mingyuan Zhou | Song Wang
Findings of the Association for Computational Linguistics: ACL 2026
Large language models often hallucinate, producing content that is factually incorrect or not grounded in the sources. Reliable faithfulness verification is critical for trustworthy deployment. In the provided-source (closed-world) setting, existing verifiers either classify whole passages in one step or check sentences independently, overlooking cross-sentence context. We present ContextCheck, a framework for sentence-level faithfulness verification with context-aware disambiguation. Each sentence is verified against the grounding document while conditioning on preceding sentences, enabling pronouns and references to be resolved directly in context. This design avoids the separate decontextualization step of rewriting claims into self-contained forms, casting verification as a context-conditioned task. Fine-tuned from Llama-3.1-8B-Instruct, ContextCheck sets a new state of the art on three context-dependent datasets; it improves Macro F1 by over 10 points compared to the strongest baselines, and matches or slightly surpasses the strongest baselines on 14 standard single-sentence datasets compared to prior 8B-scale verifiers (average Macro F1 73.5 vs. 72.8). These results show that ContextCheck offers a practical and effective approach for sentence-level hallucination detection.
Logit Arithmetic Elicits Long Reasoning Capabilities Without Training
Yunxiang Zhang | Muhammad Khalifa | Lechen Zhang | Xin Liu | Ayoung Lee | Xinliang Frederick Zhang | Farima Fatahi Bayat | Lu Wang
Findings of the Association for Computational Linguistics: ACL 2026
Yunxiang Zhang | Muhammad Khalifa | Lechen Zhang | Xin Liu | Ayoung Lee | Xinliang Frederick Zhang | Farima Fatahi Bayat | Lu Wang
Findings of the Association for Computational Linguistics: ACL 2026
Large reasoning models exhibit long chain-of-thought reasoning with complex strategies such as backtracking and self-verification. Yet, these capabilities typically require resource-intensive post-training. We investigate whether such behaviors can be elicited in large models without any gradient updates. To this end, we propose a decoding-time approach, ThinkLogit, which utilizes logit arithmetic to transfer these capabilities from a substantially smaller reasoning guider to a large non-reasoning target. We further show that we can boost performance by training the guider to correct the target’s errors using preference optimization over mixed model outputs, a setup we refer to as ThinkLogit-DPO. We evaluate these methods across six reasoning benchmarks spanning math, science, and coding domains using the Qwen2.5-32B guided by R1-Distill-Qwen-1.5B, a model 21x smaller. Our experiments demonstrate that ThinkLogit and ThinkLogit-DPO achieve a relative improvement of 21.5% and 24.2%, respectively, over the target model. Moreover, ThinkLogit remains effective even when the guider and target come from different model families.Crucially, our method requires zero training for the large model and would incur minimal inference overhead when logits are computed in parallel, presenting a practical solution for enabling long reasoning at scale.
2025
Beyond Generation: Leveraging LLM Creativity to Overcome Label Bias in Classification
Xiaoyue Wang | Xin Liu
Findings of the Association for Computational Linguistics: ACL 2025
Xiaoyue Wang | Xin Liu
Findings of the Association for Computational Linguistics: ACL 2025
Large Language Models (LLMs) exhibit impressive capabilities in In-Context Learning (ICL) but are prone to label bias—an undesirable tendency to favor certain answers. Existing calibration methods mitigate bias by leveraging in-domain data, yet such data is often unavailable in real-world scenarios. To address this limitation, we propose SDC (Synthetic Data Calibration), a simple-yet-effective approach that generates synthetic in-domain data from a few in-context demonstrations and utilizes it for calibration. By approximating the benefits of real in-domain data, SDC effectively reduces label bias without requiring access to actual domain-specific inputs. Experimental evaluations on 279 classification and multiple-choice tasks from the Super-NaturalInstructions benchmark. The results show that SDC significantly reduces label bias, achieving an average Bias Score reduction of 57.5%, and outperforming all competitive baselines. Moreover, when combined with Leave-One-Out Calibration (LOOC), further improves performance, underscoring its effectiveness and generalizability in enhancing the reliability of LLMs.
VeriFact: Enhancing Long-Form Factuality Evaluation with Refined Fact Extraction and Reference Facts
Xin Liu | Lechen Zhang | Sheza Munir | Yiyang Gu | Lu Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Xin Liu | Lechen Zhang | Sheza Munir | Yiyang Gu | Lu Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Large language models (LLMs) excel at generating long-form responses, but evaluating their factuality remains challenging due to complex inter-sentence dependencies within the generated facts. Prior solutions predominantly follow a decompose-decontextualize-verify pipeline but often fail to capture essential context and miss key relational facts. In this paper, we introduce VeriFact, a factuality evaluation framework designed to enhance fact extraction by identifying and resolving incomplete and missing facts to support more accurate verification results. Moreover, we introduce FactRBench , a benchmark that evaluates both precision and recall in long-form model responses, whereas prior work primarily focuses on precision. FactRBench provides reference fact sets from advanced LLMs and human-written answers, enabling recall assessment. Empirical evaluations show that VeriFact significantly enhances fact completeness and preserves complex facts with critical relational information, resulting in more accurate factuality evaluation. Benchmarking various open- and close-weight LLMs on FactRBench indicate that larger models within same model family improve precision and recall, but high precision does not always correlate with high recall, underscoring the importance of comprehensive factuality assessment.
Answer Convergence as a Signal for Early Stopping in Reasoning
Xin Liu | Lu Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Xin Liu | Lu Wang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Chain-of-thought (CoT) prompting enhances reasoning in large language models (LLMs) but often leads to verbose and redundant outputs, thus increasing inference cost. We hypothesize that many reasoning steps are unnecessary for producing correct answers. To investigate this, we start with a systematic study to investigate what is the minimum reasoning required for a model to reach a stable decision. Based on the insights, we propose three inference-time strategies to improve efficiency: (1) early stopping via answer consistency, (2) boosting the probability of generating end-of-reasoning signals, and (3) a supervised method that learns when to stop based on internal activations. Experiments across five benchmarks and five open-weights LLMs show that our methods largely reduce token usage with little or no accuracy drop. In particular, on NaturalQuestions, Answer Consistency reduces tokens by over 40% while further improving accuracy. Our work underscores the importance of cost-effective reasoning methods that operate at inference time, offering practical benefits for real-world applications.