Papers by Xinyi Dai

14 papers
NL-Debugging: Exploiting Natural Language as an Intermediate Representation for Code Debugging (2025.emnlp-main)

Copied to clipboard

Challenge: Early debugging efforts focused on code-level analysis, which often fails when addressing complex programming errors.
Approach: They propose a framework that employs natural language as an intermediate representation to improve code debugging by debuggating at a natural language level.
Outcome: The proposed framework outperforms traditional debugging methods and enables a broader modification space through direct refinement guided by execution feedback.
DebateCoder: Towards Collective Intelligence of LLMs via Test Case Driven LLM Debate for Code Generation (2025.acl-long)

Copied to clipboard

Challenge: Existing debate-based approaches to code generation are limited due to several reasons: 1) Reliance on different instances of the same LLM for debate, 2) under-utilization of test cases, and 3) reliance on third-party moderators for result consolidation and decision-making.
Approach: They propose to use test cases to analyze code and identify bugs while opposing models generate test cases for each other to challenge each other's code during the debate process.
Outcome: The proposed model collects intelligence of LLMs via test case-driven debate for code generation.
LLMTreeRec: Unleashing the Power of Large Language Models for Cold-Start Recommendations (2025.coling-main)

Copied to clipboard

Challenge: Lack of training data leads to the system cold-start problem in recommendation systems, making them struggle to provide effective recommendations.
Approach: They propose a tree-based LLM recommendation framework which structures all items into an item tree to improve the efficiency of LLM’s item retrieval.
Outcome: The proposed framework outperforms the baseline model in the A/B test on Huawei industrial system.
Humanity’s Last Code Exam: Can Advanced LLMs Conquer Human’s Hardest Code Competition? (2025.findings-emnlp)

Copied to clipboard

Challenge: o4-mini(high) and Gemini-2.5 Pro achieve pass@1 rates of only 15.9% and 11.4%, respectively.
Approach: They propose a harmonized online–offline sandbox that guarantees fully reproducible evaluation.
Outcome: The proposed test reflects the advanced reasoning and code generation ability of large language models.
SwitchOut: an Efficient Data Augmentation Algorithm for Neural Machine Translation (D18-1)

Copied to clipboard

Challenge: Existing methods for data augmentation for text-based tasks such as machine translation are limited due to noise and noise.
Approach: They propose a data augmentation policy with desirable properties as an optimization problem and propose 'SwitchOut' switchout randomly replaces words in both the source and target sentences with other random words from their corresponding vocabularies.
Outcome: The proposed method outperforms strong alternatives such as word dropout on three translation datasets.
CoIR: A Comprehensive Benchmark for Code Information Retrieval Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods and benchmarks for information retrieval are inadequately representing the diversity of code in various domains and tasks.
Approach: They propose a benchmark specifically designed to assess code retrieval capabilities.
Outcome: The proposed benchmark aims to invigorate research in the code retrieval domain . it shares the same data schema as other popular benchmarks like MTEB and BEIR .
Boost, Disentangle, and Customize: A Robust System2-to-System1 Pipeline for Code Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing systems 2 methods for code generation are difficult to implement due to the complex hidden reasoning process and heterogeneous data distribution.
Approach: They propose a framework that Boosts reasoning exploration via multi-agent collaboration and Disentangles heterogeneous data into specialized experts.
Outcome: The proposed framework outperforms state-of-the-art methods on APPS and CodeContest benchmarks and achieves 73.8% accuracy on hard problems.
Don’t Tell the Answer, Truly Guide the Reasoning During RL Rollouts (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods such as GRPO often break down when task difficulty exceeds the model’s capacity, resulting in sparse rewards and inefficient training.
Approach: They propose to measure the compatibility between external guidance and a model's intrinsic policy by introducing an adaptive framework to enhance reasoning performance while explicitly preserving high Affinity.
Outcome: The proposed framework outperforms baseline models while maintaining high Affinity.
ADaPT: Token-Level Decoupling for Efficient Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing efficiency-oriented methods attempt to shorten or mix reasoning strategies, yet often degrade reasoning capability.
Approach: They propose a token-level dual-process framework that explicitly decouples efficiency and correctness signals during training.
Outcome: The proposed framework reduces inference cost while maintaining strong reasoning ability across multiple benchmarks.
RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing tree search methods neglect the underlying reasoning process, resulting in poor search quality.
Approach: They propose a framework that systematically explores and refines the reasoning process for code generation by using a tree search engine and a reflection mechanism.
Outcome: The proposed framework outperforms existing methods in the code generation domain.
CodePRM: Execution Feedback-enhanced Process Reward Model for Code Generation (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in code generation focus on optimizing the thought process, but lack effective process supervision, making it difficult to optimize the thoughts.
Approach: They propose a method that leverages the code execution feedback to build a code PRM by collecting a large dataset of thought traces and then training it to take both the reasoning process and code execution as input.
Outcome: The proposed approach outperforms baselines and strong LLMs in the inference stage.
GUI0: Self-Evolving Foundational GUI Agents in Super App Ecosystems (2026.acl-long)

Copied to clipboard

Challenge: Automated interaction with graphical user interfaces (GUIs) is central to general artificial intelligence, but remains challenging within Super App ecosystems.
Approach: They propose a framework synergizing autonomous data synthesis with dual-agent co-evolution . GUI0 establishes a domain-aware foundation model via synthesized corpora and employs curriculum-driven reinforcement learning .
Outcome: The proposed framework outperforms Gemini-2.5-Pro and Claude-4-Sonnet in the SuperAPP benchmark and has universal efficacy across base models.
Instruction-Tuning Data Synthesis from Scratch via Web Reconstruction (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for generating and curating high-quality instruction-tuning data rely heavily on the quality of seed data or strong assumptions about the structure and content of web documents.
Approach: They propose a fully automated framework for synthesizing high-quality instruction-tuning (IT) data directly from raw web documents with minimal assumptions.
Outcome: The proposed framework outperforms state-of-the-art baselines by 16.65% across four instruction-following benchmarks.
Position Paper: Data-Centric AI in the Age of Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: a paper proposes a data-centric perspective of AI research, focusing on large language models.
Approach: They propose a data-centric viewpoint of AI research, focusing on large language models . they propose four scenarios centered around data, including data curation, attribution, knowledge transfer .
Outcome: The proposed research focuses on large language models with data centric benchmarks . the proposed benchmarks can be used to develop new data curation methods .

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