Papers by Yichuan Li

11 papers
FastMCTS: A Simple Sampling Strategy for Data Synthesis (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for generating multi-step reasoning data rely on rejection sampling, which generates trajectories independently and suffers from inefficiency and imbalanced sampling across problems of varying difficulty levels.
Approach: They propose a data synthesis strategy inspired by Monte Carlo Tree Search . it offers step-level evaluation signals and promotes balanced sampling .
Outcome: Experiments show that FastMCTS generates 30% more correct reasoning paths than rejection sampling.
Empowering Large Language Models for Textual Data Augmentation (2024.findings-acl)

Copied to clipboard

Challenge: True. True. False
Approach: False slants are proposed to generate a large pool of augmentation instructions and select the most suitable task-informed instructions.
Outcome: False omissions: the proposed approach consistently generates augmented data with better quality compared to non-LLM and LLM-based data augmentation methods.
ALERT: An LLM-powered Benchmark for Automatic Evaluation of Recommendation Explanations (2025.naacl-long)

Copied to clipboard

Challenge: Existing benchmarks for recommendation explanation evaluation lack item diversity and user preferences data.
Approach: They propose a model-agnostic recommendation explanation evaluation benchmark based on Amazon e-commerce categories with implicit preferences . they propose two novel automatic evaluators that enable scalable and human-preference aligned evaluation of explanations .
Outcome: The proposed model-agnostic evaluation benchmark outperforms existing methods in a variety of domains.
IHEval: Evaluating Language Models on Following the Instruction Hierarchy (2025.naacl-long)

Copied to clipboard

Challenge: Instruction-tuned language models (LMs) are increasingly deployed as interactive services across various applications.
Approach: They propose a benchmark to evaluate models' ability to follow the instruction hierarchy by comparing their models to a set of benchmarks.
Outcome: The proposed benchmark covers 3,538 examples across nine tasks covering cases where instructions in different priorities either align or conflict.
UnitCoder: Scalable Code Synthesis from Pre-training Corpora (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) excel at code understanding and generation, yet code generation remains a challenge.
Approach: They propose a model that supervises pre-training data quality through automatically generated unit tests while ensuring correctness via an iterative fix and refine flow.
Outcome: The proposed model improves performance on a large dataset with high quality pre-training data.
KEPLET: Knowledge-Enhanced Pretrained Language Model with Topic Entity Awareness (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) have shown their superiority by pre-training on unstructured text corpus and then fine-tuning on downstream tasks.
Approach: They propose a Knowledge-Enhanced Pre-trained LanguagE model with Topic entity awareness that incorporates the interactions between tokens and mentioned entities in pre-training.
Outcome: The proposed model incorporates the interactions between tokens and mentioned entities in pre-training and is more effective on entity-centric tasks.
Timely Machine: Awareness of Time Makes Test-Time Scaling Agentic (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) tackle complex reasoning tasks, but test-time scaling is becoming expensive.
Approach: They propose to redefine test-time as wall-clock time, where models dynamically adjust strategies based on time budgets.
Outcome: The proposed model improves time budget awareness and boosts performance across Timely-Eval.
GRENADE: Graph-Centric Language Model for Self-Supervised Representation Learning on Text-Attributed Graphs (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for self-supervised representation learning on text-attributed graphs lack the full extent of structural context information or rely on task-specific training labels.
Approach: They propose a Graph-Centric Language model that harnesses the synergy of pre-trained language model and graph neural network to optimize with graph-centric contrastive learning and graph-centered knowledge alignment.
Outcome: The proposed model captures informative textual semantics as well as structural context information on text-attributed graphs.
FaithfulPersona: Balancing Faithfulness and Personalization in Code Explanations through Self-Critique (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods for generating faithful code explanations face challenges balancing faithfulness to the original code and personalization for diverse user needs.
Approach: They propose a benchmark and method for generating faithful personalized code explanations using code samples and user profiles.
Outcome: The proposed method achieves 3.7% improvement in Pass@5 compared to the strong baseline method, Self-Consistency, while maintaining high personalization with a 61.08% win rate in the LLM-as-a-Judge evaluation.
Let’s Ask GNN: Empowering Large Language Model for Graph In-Context Learning (2024.findings-emnlp)

Copied to clipboard

Challenge: Textual Attributed Graphs (TAGs) are crucial for modeling complex real-world systems, yet leveraging large language models (LLMs) for TAGs presents unique challenges due to the gap between sequential text processing and graph-structured data.
Approach: They propose a novel approach that leverages In-Context Learning to integrate graph data and task-specific information into large language models (LLMs) they employ a Graph Neural Network-powered structure-enhanced retriever to select labeled nodes across graphs, incorporating complex graph structures and their supervision signals.
Outcome: Experiments on three tasks and seven LLMs show that AskGNN performs better than existing methods.
Case2Code: Scalable Synthetic Data for Code Generation (2025.coling-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown outstanding breakthroughs in code generation.
Approach: They propose a case-to-code induction task that exploits the expressiveness and correctness of programs by incorporating LLMs into their training.
Outcome: The proposed task improves distribution case-to-code induction and various coding generation tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations