Papers by Yibo Zhao

14 papers
EXPLAIN, EDIT, GENERATE: Rationale-Sensitive Counterfactual Data Augmentation for Multi-hop Fact Verification (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods to augment training data with counterfactuals fail to handle multi-hop fact verification due to their incapability to preserve complex logical relationships.
Approach: They propose to augment training data with counterfactuals that alter causal features of the original data by preserving logical relationships.
Outcome: The proposed method outperforms the baselines and can generate linguistically diverse counterfactuals without disrupting their logical relationships.
LLMs Assist NLP Researchers: Critique Paper (Meta-)Reviewing (2024.emnlp-main)

Copied to clipboard

Challenge: a comparative analysis of paper (meta-)reviews by large language models (LLMs) aims to identify and distinguish LLMs from human activities .
Approach: They present a comparative analysis to identify and distinguish LLM activities from human activities.
Outcome: The proposed analysis aims to improve recognition of instances when someone implicitly uses LLMs for reviewing activities.
RATE: Reviewer Profiling and Annotation-free Training for Expertise Ranking in Peer Review Systems (2026.acl-long)

Copied to clipboard

Challenge: LR-bench is a high-fidelity, up-to-date benchmark curated from 2024–2025 AI/NLP manuscripts with five-level self-assessed familiarity ratings collected via a large-scale email survey .
Approach: They propose a reviewer-centric ranking framework that distills each reviewer’s recent publications into compact keyword-based profiles and fine-tunes an embedding model with weak preference supervision constructed from heuristic retrieval signals.
Outcome: The proposed framework outperforms existing benchmarks and the CMU gold-standard dataset in the evaluation of AI/NLP manuscripts.
kNN-ICL: Compositional Task-Oriented Parsing Generalization with Nearest Neighbor In-Context Learning (2024.naacl-long)

Copied to clipboard

Challenge: Recent advances in task-oriented parsing involve formulating the task as a sequence-to-sequence problem, relying on a wealth of labeled data.
Approach: They propose a task-oriented parsing framework that integrates nearest-neighbor learning with a nearest-nearest approach.
Outcome: The proposed model can be used to synthesize computer programs based on a natural-language prompt without additional data or specialized prompts.
MultiFileTest: A Multi-File-Level LLM Unit Test Generation Benchmark and Impact of Error Fixing Mechanisms (2026.findings-acl)

Copied to clipboard

Challenge: Existing evaluation benchmarks for LLM unit test generation focus on function-level code rather than on more practical, challenging multi-file codebases.
Approach: They propose a multi-file-level benchmark for unit test generation covering Python, Java, and JavaScript.
Outcome: The proposed benchmarks show that most LLMs exhibit moderate performance on MultiFileTest, highlighting the benchmark’s inherent difficulty.
Low-Rank Interconnected Adaptation across Layers (2025.findings-acl)

Copied to clipboard

Challenge: Low-rank adaptation (LoRA) is a parameter-efficient fine-tuning (PEFT) method that learns weight updates W = AB for pretrained weights W through low-rank adapters A and B.
Approach: They propose a low-rank interconnected adaptation across layers method that introduces an interconnected framework with locally shared A and globally shared B experts.
Outcome: The proposed method improves expressiveness across domains and modalities and enables higher-rank W with equal or fewer parameters.
Unifying Language Agent Algorithms with Graph-based Orchestration Engine for Reproducible Agent Research (2025.acl-demo)

Copied to clipboard

Challenge: Language agents powered by large language models (LLMs) have demonstrated remarkable capabilities in understanding, reasoning, and executing complex tasks.
Approach: They propose a flexible framework that addresses engineering overhead and insufficient evaluation frameworks for fair comparison.
Outcome: The proposed framework simplifies language agent development and establishes a foundation for reproducible agent research.
Enhancing LLM-based Hatred and Toxicity Detection with Meta-Toxic Knowledge Graph (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to address toxicity issues with large language models are inadequate . lack of domain-specific knowledge leads to false negatives and excessive sensitivity to toxic speech limits freedom of speech.
Approach: They propose a method that leverages graph search on a meta-toxic knowledge graph to enhance hatred and toxicity detection.
Outcome: The proposed method lowers false positive rate and improves toxicity detection performance in out-of-domain scenarios.
A Survey of Large Language Models for Text-Guided Molecular Discovery: From Molecule Generation to Optimization (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are introducing a paradigm shift in molecular discovery by enabling text-guided interaction with chemical spaces through natural language and symbolic notations.
Approach: They analyze the current LLM learning paradigms to tackle four critical evaluation dimensions that have emerged as critical dimensions in recent studies.
Outcome: The proposed models are able to interact with chemical spaces through natural language and symbolic notations, and have emerging extensions to incorporate multi-modal inputs.
Text Detoxification: Data Efficiency, Semantic Preservation and Model Generalization (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for detoxification of text often rely on manually annotated data . xiangli: "detoxification of texts is a powerful way to remove toxic content"
Approach: They propose a reinforcement learning framework that optimizes detoxification and semantic preservation without annotating large amounts of data.
Outcome: The proposed method overcomes major limitations and surpasses humanannotated references across multiple benchmarks.
OmAgent: A Multi-modal Agent Framework for Complex Video Understanding with Task Divide-and-Conquer (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have expanded their capabilities to multimodal contexts, including comprehensive video understanding.
Approach: They propose to store and retrieve relevant video frames for specific queries and a Divide-and-Conquer loop capable of autonomous reasoning.
Outcome: The proposed model efficiently stores and retrieves relevant video frames for specific queries, preserving the detailed content of videos.
UORA: Uniform Orthogonal Reinitialization Adaptation in Parameter Efficient Fine-Tuning of Large Models (2025.acl-long)

Copied to clipboard

Challenge: Existing methods such as LoRA and VeRA use a low-rank approximation method that reduces the number of trainable parameters without compromising performance.
Approach: They propose a parameter-efficient fine-tuning approach that leverages a low-rank approximation method that reduces the number of trainable parameters without compromising performance.
Outcome: The proposed approach outperforms existing methods on GLUE and E2E benchmarks and is effective in instruction-tuning large language models and image classification models.
Safeguarding LLM Fine-tuning via Push-Pull Distributional Alignment (2026.acl-long)

Copied to clipboard

Challenge: Existing safety defenses for large language models fail to explicitly repel harmful patterns . Optimal transport (SOT) allows for safe fine-tuning without sacrificing safety .
Approach: They propose a framework that reframes safe fine-tuning from instance-level filtering challenge to distribution-level alignment task grounded in Optimal Transport.
Outcome: a new framework improves safety of large language models while maintaining competitive performance . the proposed framework reduces the risk of errors and improves model performance compared to baselines .
Learning to Collaborate for Question Answering and Asking (N18-1)

Copied to clipboard

Challenge: Question answering (QA) and question generation (QG) are closely related tasks.
Approach: They propose a training algorithm that generalizes both Generative Adversarial Network and Generating Domain-Adaptive Nets under the question answering scenario.
Outcome: The proposed training algorithm generalizes both Generative Adversarial Network (GAN) and Generating Domain-Adaptive Nets (GDAN) under the question answering scenario.

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