Papers by Xiong Gao

31 papers
OmniCharacter: Towards Immersive Role-Playing Agents with Seamless Speech-Language Personality Interaction (2025.acl-long)

Copied to clipboard

Challenge: Existing methods focus on replicating dialogues in textual form, neglecting the role’s voice traits as a crucial effect in interaction, which tends to be more immersive experiences in realistic scenarios.
Approach: They propose a first seamless speech-language personality interaction model to achieve immersive RPAs with low latency.
Outcome: The proposed model exhibits role-specific personality traits and vocal traits throughout the interaction, enabling a mixture of speech and language responses.
Semantics of the Unwritten: The Effect of End of Paragraph and Sequence Tokens on Text Generation with GPT2 (2021.acl-srw)

Copied to clipboard

Challenge: Experimental results show that pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage.
Approach: They conduct experiments on an English essay dataset using Chinese-GPT2 . they find that the model can generate better continuations by learning to generate the in the fine-tuning stage.
Outcome: The pre-trained language model GPT2 can generate better continuations by learning to generate the in the fine-tuning stage.
LoRAMoE: Alleviating World Knowledge Forgetting in Large Language Models via MoE-Style Plugin (2024.acl-long)

Copied to clipboard

Challenge: Experimental results show that, as the instruction data increases, LoRAMoE can significantly improve the ability to process downstream tasks, while maintaining the world knowledge stored in the LLM.
Approach: They propose a framework that introduces several low-rank adapters and integrates them by using a router network to freeze the backbone model and force a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks.
Outcome: The proposed framework freezes the backbone model and forces a portion of LoRAs to focus on leveraging world knowledge to solve downstream tasks, to alleviate world knowledge forgetting.
Z-Code++: A Pre-trained Language Model Optimized for Abstractive Summarization (2023.acl-long)

Copied to clipboard

Challenge: Z-Code++ is a pre-trained language model optimized for abstractive text summarization.
Approach: They propose a pre-trained language model optimized for abstractive text summarization that uses a two-phase pre-training technique to improve model's performance.
Outcome: The proposed model outperforms the competing models on low-resource summarization tasks in zero-shot and few-shot settings.
Consolidation or Adaptation? PRISM: Disentangling SFT and RL Data via Gradient Concentration (2026.acl-long)

Copied to clipboard

Challenge: Existing data arbitration strategies for large language model training rely on surface-level heuristics that fail to diagnose intrinsic learning needs.
Approach: They propose a framework that arbitrates data based on its degree of cognitive conflict with the model's existing knowledge.
Outcome: Extensive experiments on WebShop and ALFWorld show that PRISM outperforms state-of-the-art hybrid methods while reducing computational costs by up to 3.22 .
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)

Copied to clipboard

Challenge: Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages .
Approach: They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears.
Outcome: The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears.
Beyond Similarity: A Gradient-based Graph Method for Instruction Tuning Data Selection (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for selecting training data from general datasets fail to account for the joint distribution of instructions, resulting in inefficient learning and suboptimal knowledge transfer.
Approach: They propose a method that constructs a mixed gradient-based instruction graph to capture the joint distribution and interdependencies among instructions.
Outcome: The proposed method outperforms existing methods on domain adaptation tasks and in complex, data-scarce scenarios.
MMEvol: Empowering Multimodal Large Language Models with Evol-Instruct (2025.findings-acl)

Copied to clipboard

Challenge: a new framework for image-text instruction data evolution improves MLLM performance . lack of high-quality instruction data remains a major bottleneck in ML modeling .
Approach: They propose a multimodal instruction data evolution framework that iteratively enhances data quality through fine-grained perception, cognitive reasoning, and interaction evolution.
Outcome: The proposed approach improves MLLM performance in nine vision-language tasks while using significantly less data.
ErrorRadar: Benchmarking Complex Mathematical Reasoning of Multimodal Large Language Models Via Error Detection (2026.findings-acl)

Copied to clipboard

Challenge: Current mathematical benchmarks focus on evaluating MLLMs’ problem-solving ability, yet there is a crucial gap in addressing more complex scenarios such as error detection.
Approach: They propose to evaluate multimodal error detection by evaluating two sub-tasks error step identification and error categorization.
Outcome: The proposed task evaluates MLLMs' ability to handle multimodal questions compared to text-only models.
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.
WSLLN:Weakly Supervised Natural Language Localization Networks (D19-1)

Copied to clipboard

Challenge: Existing methods to learn correspondence between visual segments and texts require temporal coordinates for training, which leads to high costs of annotation.
Approach: They propose weakly supervised language localization networks to detect events in untrimmed videos . they train with only video-sentence pairs without accessing to temporal locations of events .
Outcome: Experiments on ActivityNet Captions and DiDeMo show that WSLLN performs state-of-the-art.
Think-Search-Patch: A Retrieval-Augmented Reasoning Framework for Repository-Level Code Repair (2025.emnlp-industry)

Copied to clipboard

Challenge: Large language models suffer from multiple-file coding scenarios with strong inter-file dependencies . experimental results show that large language models exhibit inadequate performance in multi-file scenarios .
Approach: They propose a retrieval-augmented reasoning framework for repository-level code repair . they use a dataset to generate standardized patches based on the key snippets .
Outcome: The proposed framework improves retrieval accuracy and repair success on SWE-bench Lite . it surpasses models with larger size in managing extensive code contexts and fixing bugs spanning across multiple files.
Reinforcement Learning on Pre-Training Data (2026.acl-long)

Copied to clipboard

Challenge: Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings.
Approach: They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data.
Outcome: Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base.
MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization (2026.acl-long)

Copied to clipboard

Challenge: Group-Relative Policy Optimization (GRPO) has emerged as an efficient paradigm for aligning Large Language Models (LLMs), but its efficacy is confined to domains with verifiable ground truths.
Approach: They propose a meta-cognitive orchestration layer that treats reward scalarization as a dynamic latent policy, leveraging the model’s terminal hidden states as 'a semantic bottleneck' . Across seven benchmarks, MAESTRO consistently outperforms single-reward and static multi-objective baselines while preserving the efficiency advantages of GRPO.
Outcome: The proposed model outperforms single-reward and static multi-objective baselines while preserving efficiency advantages.
Explicit Memory Tracker with Coarse-to-Fine Reasoning for Conversational Machine Reading (2020.acl-main)

Copied to clipboard

Challenge: Existing approaches to answer user questions are limited in their decision making due to struggles in extracting question-related rules and reasoning about them.
Approach: They propose a conversational machine reading framework that uses a Explicit Memory Tracker to track whether conditions in the rule text have already been satisfied to make a decision.
Outcome: The proposed framework achieves state-of-the-art on the ShARC benchmark and is more interpretable by visualizing the entailment-oriented reasoning process as the conversation flows.
Composition-based Heterogeneous Graph Multi-channel Attention Network for Multi-aspect Multi-sentiment Classification (2022.coling-1)

Copied to clipboard

Challenge: Existing methods for Aspect-based sentiment analysis (ABSA) focus on aspect terms with the same sentiment polarity . current methods focus on sentences with only one aspect term or multiple aspect terms .
Approach: They propose a novel method to model inter-aspect relationships and aspect-context relationships simultaneously using a heterogeneous graph.
Outcome: The proposed method can predict sentiments towards the given aspect term in a sentence . it can provide more detailed predictions compared with sentence-level sentiment analysis.
Revisiting Entropy in Reinforcement Learning for Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning with verifiable rewards (RLVR) has emerged as a paradigm for enhancing the reasoning capabilities of large language models.
Approach: They propose a positive-advantage reweighting approach that regulates model entropy by adjusting the loss weights assigned to tokens with positive advantages during RLVR training.
Outcome: The proposed approach regulates model entropy by adjusting loss weights assigned to tokens with positive advantages during RLVR training while maintaining competitive performance.
DecEx-RAG: Boosting Agentic Retrieval-Augmented Generation with Decision and Execution Optimization via Process Supervision (2025.emnlp-industry)

Copied to clipboard

Challenge: Recent advances in outcome-supervised reinforcement learning (RL) have shown strong performance, but this approach still suffers from inefficient exploration, sparse reward signals, and ambiguous global reward feedback.
Approach: They propose a model that models RAG as a Markov Decision Process (MDP) and introduces an efficient pruning strategy to optimize data expansion.
Outcome: The proposed model outperforms existing methods and achieves an average performance improvement of 6.2% across six datasets.
Discern: Discourse-Aware Entailment Reasoning Network for Conversational Machine Reading (2020.emnlp-main)

Copied to clipboard

Challenge: Document interpretation and dialog understanding are the two major challenges for conversational machine reading.
Approach: They propose a discourse-aware entailment reasoning network to strengthen the connection and enhance the understanding of document and dialog.
Outcome: The proposed model improves document interpretation and dialog understanding on the ShARC benchmark.
GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion (2025.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically.
Approach: They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance.
Outcome: The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs.
DocQueryNet: Value Retrieval with Arbitrary Queries for Form-like Documents (2022.coling-1)

Copied to clipboard

Challenge: Existing methods that only address a fixed set of fields are difficult to use for different form types.
Approach: They propose a value retrieval method with arbitrary queries for form-like documents . they propose 'docQueryNet' to predict target value based on understanding of layout and semantics of a form .
Outcome: The proposed method outperforms existing methods on value retrieval . it improves document understanding on large-scale model pre-training by 17% .
QiMeng-Attention: SOTA Attention Operator is generated by SOTA Attention Algorithm (2025.findings-acl)

Copied to clipboard

Challenge: Existing LLMs cannot comprehend the complex data flow and computation process of the attention operator and utilize low-level primitive to exploit GPU performance.
Approach: They propose an LLM-friendly Thinking Language (LLM-TL) that can decouple the generation of high-level optimization logic and low-level implementation on GPU and enhance LLMs’ understanding of attention operator.
Outcome: The proposed method outshines existing LLMs on A100, RTX8000, and T4 GPUs, achieving a speed-up of up to 35.16.
Model-Generated Pretraining Signals Improves Zero-Shot Generalization of Text-to-Text Transformers (2023.acl-long)

Copied to clipboard

Challenge: Recent work in NLP has shown that pretrained language models have made notable progress toward generalization to unseen tasks.
Approach: They propose to pretrain T5 using an auxiliary model to construct more challenging token replacements for the main model to denoise.
Outcome: The proposed model outperforms similar-sized baseline models on prompted NLP benchmarks and rivals the state-of-the-art model with only **8%** of its parameters.
On the Feasibility of In-Context Probing for Data Attribution (2025.findings-naacl)

Copied to clipboard

Challenge: In-context probing (ICP) can be used to identify training data that contributes to model outputs, but many data attribution methods, such as influence functions, use model gradients and are computationally expensive.
Approach: They propose to use in-context probing (ICP) to proxy for gradient-based data attribution for data selection under conditions contingent on data similarity.
Outcome: The proposed method can be used to identify training data that contribute to model outputs and fine tune models on training data.
Detecting Machine-Generated Text: Techniques and Challenges (2024.acl-tutorials)

Copied to clipboard

Challenge: This tutorial focuses on machine-generated text and deepfakes.
Approach: This tutorial aims to provide a comprehensive overview of text detection techniques . it will focus on machine-generated text and deepfakes .
Outcome: This tutorial focuses on machine-generated text and deepfakes.
PersonaAgent: Bridging Memory and Action for Personalized LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Model (LLM) enabled agents lack flexibility to respond to users’ varying needs and preferences.
Approach: They propose a test-time user-preference alignment strategy that optimizes the persona prompt, ensuring real-time preference alignment through textual loss feedback between simulated and ground-truth responses.
Outcome: The proposed framework outperforms baseline methods in real-time and in real applications.
Com2 : A Causal-Guided Benchmark for Exploring Complex Commonsense Reasoning in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing works focus on complex tasks like math and code, while complex commonsense reasoning remains underexplored due to its uncertainty and lack of structure.
Approach: They propose to build a benchmark for large language models based on complex commonsense reasoning based upon causal event graphs and causal theory.
Outcome: The proposed benchmark combines a complex commonsense reasoning benchmark with a detective story to achieve a more challenging subset.
Self-Adjust Softmax (2025.emnlp-main)

Copied to clipboard

Challenge: Usually, tokens with larger attention scores are important for the final prediction.
Approach: They propose to modify softmax(z) to z softmax and its normalized variant to improve the Transformer attention mechanism by making minor adjustments to the softmax function.
Outcome: The proposed model provides enhanced gradient properties compared to the vanilla softmax function.
DAPE V2: Process Attention Score as Feature Map for Length Extrapolation (2025.acl-long)

Copied to clipboard

Challenge: Extensive experiments demonstrate that treating attention as a feature map and applying convolution as . a processing method significantly enhances Transformer performance.
Approach: They propose to use the convolution operator to mimic the processing methods in computer vision to treat attention as a feature map and apply it to neighboring attention scores across different heads.
Outcome: The proposed model can be adapted to various attention-related models and achieves high performance.
Contrastive Multi-document Question Generation (2021.eacl-main)

Copied to clipboard

Challenge: Multi-document question generation focuses on generating a question that covers the common aspect of multiple documents, but a naive model trained only using the targeted document set may generate too generic questions that cover a larger scope than delineated by the document set.
Approach: They propose a contrastive learning strategy where given ‘positive’ and ‘negative’ sets of documents, generate a question that is closely related to the ‘positive' set but far away from the ‘negative' set.
Outcome: The proposed model significantly outperforms several strong baselines, as measured by automatic metrics and human evaluation.

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