Papers by Kedi Chen
A Regularization-based Transfer Learning Method for Information Extraction via Instructed Graph Decoder (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for information extraction (IE) focus on training task-specific models, while common knowledge among different IE tasks is not explicitly modeled. |
| Approach: | They propose a regularization-based transfer learning method for IE via an instructed graph decoder which decodes various complex structures into a graph uniformly based on corresponding instructions. |
| Outcome: | The proposed method can learn common knowledge from existing datasets and transfer it to a new dataset with new labels. |
DiaHalu: A Dialogue-level Hallucination Evaluation Benchmark for Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing benchmarks for hallucination detection are intentionally generated by large language models (LLMs) however, many focus on factuality while ignoring faithfulness. |
| Approach: | They propose a dialogue-level hallucination evaluation benchmark for large language models . they integrate the topic into prompts and facilitate a dialog between two LLMs . |
| Outcome: | The proposed benchmark covers four common multi-turn dialogue domains and five hallucination subtypes, extended from factuality and faithfulness hallucines. |
Rethinking Multiple-Choice Questions for RLVR: Unlocking Potential via Distractor Design (2026.findings-acl)
Copied to clipboard
Xu Guo, Qiming Ge, Jian Tong, Kedi Chen, Jin Zhang, Xiaogui Yang, Xuan Gao, Haijun Lv, Zhihui Lu, Yicheng Zou, Qipeng Guo
| Challenge: | Existing approaches to RLVR use multiple-choice questions as verifiable rewards . however, not all tasks provide reliable verification . |
| Approach: | They propose a framework that actively constructs high-quality distractors to block elimination shortcuts and promote deep reasoning. |
| Outcome: | The proposed method significantly improves reasoning capabilities of Large Language Models. |
Complete Chess Games Enable LLM Become A Chess Master (2025.naacl-short)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown remarkable abilities in text generation, question answering, language translation, reasoning and many other tasks. |
| Approach: | They propose a Large language model that can play chess games by transforming a game into a textual format with the best move represented in the Forsyth-Edwards Notation. |
| Outcome: | The proposed model achieves professional-level Elo rating of 1788 in matches against the standard Elo-rated Stockfish when permitted to sample 10 times. |
A Survey of Inductive Reasoning for Large Language Models (2026.acl-long)
Copied to clipboard
Kedi Chen, Dezhao Ruan, Yuhao Dan, Yaoting Wang, Siyu Yan, Xuecheng Wu, Yinqi Zhang, Qin Chen, Jie Zhou, Liang He, Biqing Qi, Linyang Li, Qipeng Guo, Xiaoming Shi, Wei Zhang
| Challenge: | Inductive reasoning is an important task for large language models (LLMs). |
| Approach: | They propose a survey of inductive reasoning for large language models . they categorize methods into three main areas: post-training enhancement, test-time exploration, and data augmentation. |
| Outcome: | The proposed method improves inductive reasoning in large language models. |