Xin Tong
Author directoryOther people with similar names: Xin Tong, Xin Tong
Unverified author pages with similar names: Xin Tong
2026
PretrainRL: Alleviating Factuality Hallucination of Large Language Models at the Beginning
Langming Liu | Kangtao Lv | Haibin Chen | Weidong Zhang | Yejing Wang | Shilei Liu | Xin Tong | Yujin Yuan | Yongwei Wang | Wenbo Su | Bo Zheng
Findings of the Association for Computational Linguistics: ACL 2026
Langming Liu | Kangtao Lv | Haibin Chen | Weidong Zhang | Yejing Wang | Shilei Liu | Xin Tong | Yujin Yuan | Yongwei Wang | Wenbo Su | Bo Zheng
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs), despite their powerful capabilities, suffer from factual hallucinations where they generate verifiable falsehoods. We identify a root of this issue: the imbalanced data distribution in the pretraining corpus, which leads to a state of “low-probability truth” and “high-probability falsehood”. Recent approaches, such as teaching models to say “I don’t know” or post-hoc knowledge editing, either evade the problem or face catastrophic forgetting. To address this issue from its root, we propose PretrainRL, a novel framework that integrates reinforcement learning into the pretraining phase to consolidate factual knowledge. The core principle of PretrainRL is “debiasing then learning.” It actively reshapes the model’s probability distribution by down-weighting high-probability falsehoods, thereby making “room” for low-probability truths to be learned effectively. To enable this, we design an efficient negative sampling strategy to discover these high-probability falsehoods and introduce novel metrics to evaluate the model’s probabilistic state concerning factual knowledge. Extensive experiments on three public benchmarks demonstrate that PretrainRL significantly alleviates factual hallucinations and outperforms state-of-the-art methods.
SELECting over Tokens: Curating Pre-training Data at Scale via Token Classification
Xin Tong | Weidong Zhang | Jiaang Li | Haibin Chen | Shilei Liu | Langming Liu | Kangtao Lv | Yujin Yuan | Wenbo Su | Bo Zheng
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xin Tong | Weidong Zhang | Jiaang Li | Haibin Chen | Shilei Liu | Langming Liu | Kangtao Lv | Yujin Yuan | Wenbo Su | Bo Zheng
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The quality of pre-training data critically impacts the capabilities of large language models. Existing pipelines rely on expert-crafted heuristic rules, which primarily operate at the sample level and are based on coarse statistical indicators, thus lacking content-aware, fine-grained noise detection. While recent generative approaches, e.g., ProX-C, enable token-level refinement, their reliance on synthesizing Python code incurs prohibitive computational cost at scale and can introduce hallucinations into the refined data. To overcome these limitations, we propose Selecting over Tokens (SelecT), a novel framework that reframes data refinement as a highly efficient token classification task. SelecT classifies each token as either informative or noisy and subsequently removes the latter. This design achieves fine-grained data optimization while avoiding the inefficiency of generation, ensuring scalability. When evaluated on diverse downstream benchmarks, the model trained on SelecT-refined corpora, on average, outperforms the one trained on raw data by over 2% and exceeds the best heuristic baselines by more than 1% while preserving 17% more tokens than the latter. Furthermore, SelecT achieves higher average performance than the generative ProX-C across all experimental settings, and is 2.5x faster at inference, even with twice the parameters. Our results establish SelecT as an effective, efficient, and scalable solution for pre-training data optimization.