Papers by Yao Xiao

23 papers
OpenWebAgent: An Open Toolkit to Enable Web Agents on Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: OpenWebAgent integrates large language models and large multimodal models to improve web automation.
Approach: They propose to integrate large language models and large multimodal models into an open toolkit to optimize web automation.
Outcome: The open toolkit integrates both large language models (LLMs) and large multimodal models (LMMs) it enables the development of powerful, task-oriented web agents, significantly enhancing user experience and operational efficiency on the web.
Towards Explainable Temporal Reasoning in Large Language Models: A Structure-Aware Generative Framework (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies on temporal reasoning models neglect the explainable reasoning processes underlying the results.
Approach: They propose a structure-aware generative framework that integrates Graph structures with text for Explainable TEmporal Reasoning.
Outcome: The proposed framework achieves state-of-the-art performance while also demonstrating robust generalization capabilities.
Program Transfer for Answering Complex Questions over Knowledge Bases (2022.acl-long)

Copied to clipboard

Challenge: Program induction for complex questions over knowledge bases relies on a large number of parallel question-program pairs for the given KB, but the gold program annotations are usually lacking, making learning difficult.
Approach: They propose an approach to leverage program annotations on rich KBs as external supervision signals to aid program induction for low-resourced KB.
Outcome: The proposed approach outperforms SOTA methods on ComplexWebQuestions and WebQuestionSP.
SCOP: Evaluating the Comprehension Process of Large Language Models from a Cognitive View (2025.acl-long)

Copied to clipboard

Challenge: despite the potential of large language models, it is difficult to fully count on them in real-world scenarios.
Approach: They propose to examine how LLMs perform during the comprehension process from a cognitive perspective.
Outcome: The proposed model analyzes how LLMs perform during the comprehension process from a cognitive perspective.
Pause or Fabricate? Training Language Models for Grounded Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Large language models implicitly fabricate information when inputs are incomplete, causing confidence but unreliable conclusions.
Approach: They propose a framework for grounded reasoning under incomplete information that decomposes reasoning into two stages . they propose stage-specific rewards to penalize hallucinations, enabling models to detect gaps, stop proactively, and resume reasoning after clarification.
Outcome: The proposed framework improves premise detection and task success by 30% . it also reduces average response length by over 20% .
i-Code V2: An Autoregressive Generation Framework over Vision, Language, and Speech Data (2024.findings-naacl)

Copied to clipboard

Challenge: i-Code V2 is one of the first models capable of generating natural language from any combination of Vision, Language, and Speech data.
Approach: They propose to create a model that can generate natural language from any combination of Vision, Language, and Speech data.
Outcome: i-Code V2 matches or outperforms state-of-the-art single- and dual-modality baselines on 7 multimodal tasks.
A Survey of Post-Training Scaling in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated proficiency in understanding and generating human natural languages.
Approach: They propose a framework for scaling large language models using supervised fine-tuning, RLxF and test-time compute methodologies.
Outcome: The proposed model can be used to understand and generate human natural languages.
Anti-Length Shift: Dynamic Outlier Truncation for Training Efficient Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Existing efficient reasoning methods rely on explicit length penalties for excessive verbosity on simple queries.
Approach: They propose a training-time intervention that selectively suppresses redundant tokens . they find length shift occurs when models generate unnecessary reasoning on trivial inputs - a phenomenon that is often unexplored .
Outcome: The proposed method reduces inference token usage by 78% while increasing accuracy compared to the initial policy and surpasses state-of-the-art efficient reasoning methods.
RU22Fact: Optimizing Evidence for Multilingual Explainable Fact-Checking on Russia-Ukraine Conflict (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to verify factuality of claims do not provide sufficient evidence for explainable fact-checking systems.
Approach: They propose a method to automatically retrieve and summarize evidence from the Web and a novel multilingual explainable fact-checking dataset on the Russia-Ukraine conflict in 2022.
Outcome: The proposed method can retrieve and summarize evidence from the Web and generate explanations in 16 languages.
AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora (2026.acl-long)

Copied to clipboard

Challenge: Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage.
Approach: They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas.
Outcome: The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality.
RiTeK: A Dataset for Large Language Models Complex Reasoning over Textual Knowledge Graphs in Medicine (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for retrieving medical textual knowledge Graphs struggle to perform well, a study finds . existing methods struggle to provide accurate answers to complex questions, he says .
Approach: They synthesize user queries integrating diverse topological structures, relational information, and complex textual descriptions.
Outcome: a new dataset for medical textual knowledge graphs shows that existing methods struggle to perform well . main bottlenecks lie in the scarcity of existing medical TKGs and the limited expressiveness of their topological structures .
Chart2Code53: A Large-Scale Diverse and Complex Dataset for Enhancing Chart-to-Code Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing Chart2code-related training datasets suffer from limited scale, limited type coverage, and inadequate complexity.
Approach: They propose to synthesize chart2code-related training datasets using web plotting code and chart images to address these challenges.
Outcome: The proposed dataset exhibits the greatest diversity and higher complexity compared to other open-source Chart2code related datasets.
Bone Soups: A Seek-and-Soup Model Merging Approach for Controllable Multi-Objective Generation (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches focus on merging language models tuned on single objectives . existing approaches ignore the impacts of competing objectives on model tuning .
Approach: They propose a model merging approach that seeks a series of backbone models and merges them according to user preferences.
Outcome: The proposed approach exhibits strong controllability and Pareto optimality in controllable multi-objective generation.
RecMem: Recurrence-based Memory Consolidation for Efficient and Effective Long-Running LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing memory systems invoke LLMs to extract episodic and semantic memory, and this leads to substantial token consumption.
Approach: They propose a method that stores incoming interactions in a subconscious memory layer and encodes them using lightweight embedding models for retrieval.
Outcome: Experiments show that RecMem reduces the memory construction token cost of three SOTA memory systems by up to 87% while exceeding their accuracy.
LEVEN: A Large-Scale Chinese Legal Event Detection Dataset (2022.findings-acl)

Copied to clipboard

Challenge: Existing legal event detection datasets only cover incomprehensive event types and have limited annotated data.
Approach: They present a large-scale Chinese legal event detection dataset . they use legal events as side information to promote downstream applications .
Outcome: The proposed method improves 2.2 points precision in low-resource judgment prediction and 1.5 points precision for unsupervised case retrieval.
Personality Understanding of Fictional Characters during Book Reading (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to predict characters' personalities have not been studied in the NLP field due to the lack of appropriate datasets mimicking the process of book reading.
Approach: They propose a dataset to predict characters' personalities that uses an exhaustive vocabulary of personality traits as targets.
Outcome: The proposed dataset is efficient and accurate and relies on long-term context to achieve accurate predictions for both machines and humans.
Denoising Relation Extraction from Document-level Distant Supervision (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods to generate auto-labeled sentences for relation extraction (RE) are difficult to extend to document-level relation extraction as noise from DS may be even multiplied in documents.
Approach: They propose a pre-trained model which de-emphasizes noisy DS data via multiple pre-training tasks.
Outcome: The proposed model can capture useful information from noisy data and achieve promising results on the large-scale DocRE benchmark.
Finding the Sweet Spot: Preference Data Construction for Scaling Preference Optimization (2025.acl-long)

Copied to clipboard

Challenge: Large language models generate unintended outputs due to their unsupervised nature.
Approach: They propose a method to construct preference pairs of selected and rejected LLMs by repeated random sampling to improve alignment performance.
Outcome: The proposed method improves performance as the sample size increases.
Decomposed Prompt Tuning via Low-Rank Reparameterization (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained language models have achieved remarkable performance on various tasks.
Approach: They propose a decomposed prompt tuning approach that utilizes low-rank matrices to initialize the soft prompt.
Outcome: The proposed method significantly reduces the number of trainable parameters while maintaining effectiveness.
Hybrid Inverted Index Is a Robust Accelerator for Dense Retrieval (2023.emnlp-main)

Copied to clipboard

Challenge: Inverted file structure is a common technique for accelerating dense retrieval, but its lossy nature degrades it.
Approach: They propose a hybrid index where embedding clusters and salient terms work collaboratively to accelerate dense retrieval.
Outcome: The proposed method achieves lossless retrieval quality with competitive efficiency across index settings.
Fine-Grained Legal Argument-Pair Extraction via Coarse-Grained Pre-training (2024.lrec-main)

Copied to clipboard

Challenge: Current methods conceptualize LAE as a supervised sentence-pair classification problem and necessitate extensive manual annotations.
Approach: They propose a model that focuses on fine-grained alignment of argument pairs building upon coarse-grain complaint-defense pairs.
Outcome: The proposed model outperforms baseline models by 3.7 and 2.4 points on average.
Revisiting Self-Play Preference Optimization: On the Role of Prompt Difficulty (2026.findings-acl)

Copied to clipboard

Challenge: incorporating difficult prompts into training fails to enhance overall performance, e.g., as prompt difficulty decreases.
Approach: They investigate how prompts of varying difficulty influence self-play preference optimization . they use the reward of sampled responses of a prompt as a proxy for its difficulty .
Outcome: The proposed model improves on difficult prompts and easy prompts, but fails to train on difficult ones and learns from failures.
Enhancing Visual-Language Modality Alignment in Large Vision Language Models via Self-Improvement (2025.findings-naacl)

Copied to clipboard

Challenge: Existing methods for visual and language alignment depend on external models or data, leading to uncontrollable and unstable results.
Approach: They propose a framework that enhances visual and language alignment without external dependencies by incorporating an in-context self-critic mechanism that constructs preference pairs for tuning.
Outcome: The proposed framework outperforms existing methods and improves performance on 14 hallucination and comprehensive benchmarks.

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