Papers by Yuchen He

14 papers
Graph-GRPO: Stabilizing Multi-Agent Topology Learning via Group Relative Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Recent approaches to optimize communication topology rely on single-sample policy gradients with absolute rewards.
Approach: They propose a topology optimization framework that integrates Group Relative Policy Optimization.
Outcome: The proposed topology optimization framework outperforms state-of-the-art methods on reasoning and code generation benchmarks.
To Answer or Not to Answer (TAONA): A Robust Textual Graph Understanding and Question Answering Approach (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing studies assume that generated answers integrate all relevant information from the textual graph.
Approach: They propose a novel GraphRAG model that integrates all relevant information from the textual graph into the generated answer.
Outcome: Extensive experiments validate TAONA’s superior performance for both A-side and B-side tasks.
Biology-Instructions: A Dataset and Benchmark for Multi-Omics Sequence Understanding Capability of Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Biology-Instructions is the first large-scale instruction-tuning dataset for multi-omics biological sequences.
Approach: They propose a large-scale instruction-tuning dataset for multi-omics biological sequences . they propose 'chatMultiOmics' to overcome limitations of current LLMs on multi-ome tasks .
Outcome: The proposed dataset bridges LLMs and complex biological sequence-related tasks while maintaining conversational fluency.
SILC-EFSA: Self-aware In-context Learning Correction for Entity-level Financial Sentiment Analysis (2025.coling-main)

Copied to clipboard

Challenge: Currently, most sentiment analysis corpora use sequence-level annotation.
Approach: They propose a two-stage approach to financial entity-level sentiment analysis called Self-aware In-context Learning Correction.
Outcome: The proposed approach achieves state-of-the-art on the largest English and Chinese financial entity-level sentiment analysis datasets to date.
MMBoundary: Advancing MLLM Knowledge Boundary Awareness through Reasoning Step Confidence Calibration (2025.acl-long)

Copied to clipboard

Challenge: Existing methods calibrate model confidence on entire response, which leads to incorrect answers with high confidence.
Approach: They propose a framework that advances the knowledge boundary awareness of multimodal large language models through reasoning step confidence calibration.
Outcome: Empirical results show that the proposed framework outperforms existing methods across domains and metrics.
Harnessing Consistency for Robust Test-Time LLM Ensemble (2026.findings-eacl)

Copied to clipboard

Challenge: Existing efforts to improve LLM ensemble quality have focused on model consistency, but failures are often due to heterogeneous tokenization schemes and varying model expertise.
Approach: They propose a plug-and-play technique that harnesses model consistency for robust LLM ensemble.
Outcome: The proposed technique improves ensemble performance and robustness against erroneous signals.
MAC-Tuning: LLM Multi-Compositional Problem Reasoning with Enhanced Knowledge Boundary Awareness (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models produce non-existing facts when faced with questions outside their parametric knowledge, which undermines their reliability.
Approach: They propose a method that separates the learning of answer prediction and confidence estimation during fine-tuning on instruction data.
Outcome: Experiments on multiple models and different model sizes show that the proposed method outperforms baselines by up to 25% in average precision.
RAP-ID: Mechanistic Prompt Injection Detection via Impostor Behavior Analysis (2026.findings-acl)

Copied to clipboard

Challenge: Existing defenses rely on externally deployed guardrail models or response inspection . current defenses depend on external guardrails or response inspecting .
Approach: They propose a mechanistic, train-free detection framework that operates exclusively on internal state dynamics during the initial forward pass.
Outcome: The proposed framework achieves competitive performance with significant overall improvements compared to heuristic methods.
On the Representation Geometry of LoRA Model Merging (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for low-rank Adaptation (LoRA) fine-tuning focus on globally shared structure . combining SVD with CUR improves performance of LoRA model merging .
Approach: They propose a training-free method that combines SVD and CUR decomposition to improve LoRA merging performance.
Outcome: The proposed procedure improves on vision and language benchmarks.
A Survey of Reinforcement Learning for Large Language Models under Data Scarcity: Challenges and Solutions (2026.acl-long)

Copied to clipboard

Challenge: Existing research on reinforcement learning for LLMs under data scarcity has not been unified.
Approach: They propose a top-up hierarchical framework built around three complementary perspectives: data-centric, training-centric and framework-centric.
Outcome: The proposed framework provides a clear conceptual foundation for understanding the design space of data-efficient RL for large language models and to guide researchers working in this emerging area.
PaSa: An LLM Agent for Comprehensive Academic Paper Search (2025.acl-long)

Copied to clipboard

Challenge: We introduce PaSa, an advanced Paper Search agent powered by large language models . despite being trained on synthetic data, PaSA outperforms existing baselines on RealScholarQuery .
Approach: They introduce PaSa, an advanced Paper Search agent powered by large language models . they optimize PaSA using a synthetic dataset, AutoScholarQuery, which includes 35k fine-grained queries .
Outcome: The paper analyzes the performance of a paper search agent using a synthetic dataset . it significantly outperforms existing benchmarks on RealScholarQuery .
Prune as You Generate: Online Rollout Pruning for Faster and Better RLVR (2026.acl-long)

Copied to clipboard

Challenge: Reinforcement Learning with Verifiable Rewards (RLVR) has improved reasoning capabilities of Large Language Models (LLMs).
Approach: They propose an online pruning method that prunes rollouts while steering correct ones to enhance learning signals.
Outcome: The proposed method improves average accuracy by +2.30 to +2.99 across GRPO and DAPO on Qwen-3 and LLaMA-3.2 models.
Are LLMs Rational Investors? A Study on the Financial Bias in LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing studies on biases within specific domains, such as finance, remain limited.
Approach: They propose a framework to detect, detect, analyze and mitigate financial biases in large language models.
Outcome: The proposed framework reduces bias by 68% for the most biased model, according to key metrics.
R3-NL2GQL: A Model Coordination and Knowledge Graph Alignment Approach for NL2GQL (2024.findings-emnlp)

Copied to clipboard

Challenge: Adapting existing approaches for converting natural language to SQL encounters hurdles due to distinct nature of GQL compared to SQL.
Approach: They propose a method that integrates both small and large Foundation Models for ranking, rewriting, and refining tasks.
Outcome: The proposed approach integrates both small and large Foundation Models for ranking, rewriting, and refining tasks while capitalizing on the superior generalization and query generation prowess of larger models for the final transformation of natural language queries into GQL formats.

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