Papers by Qing Xu

31 papers
Python is Not Always the Best Choice: Embracing Multilingual Program of Thoughts (2024.emnlp-main)

Copied to clipboard

Challenge: Program of Thoughts (PoT) is an approach characterized by its executable intermediate steps, which ensure the accuracy of the logical calculations in the reasoning process.
Approach: They propose a task and model agnostic approach which harnesses strength and diversity from various languages to achieve better performance across all tasks.
Outcome: The proposed approach outperforms Python Self-Consistency in almost all tasks and models and achieves comparable or superior performance on ChatGPT.
GlobeSumm: A Challenging Benchmark Towards Unifying Multi-lingual, Cross-lingual and Multi-document News Summarization (2024.emnlp-main)

Copied to clipboard

Challenge: Current studies focus on single-language or single-document tasks for news summarization . lack of a benchmark inhibits researchers from adequately studying this invaluable problem.
Approach: They propose a novel task that unifies Multi-lingual, Cross-lingual and Multi-document Summarization into one task.
Outcome: The proposed task encapsulates the real-world requirements all-in-one and is validated by extensive analysis.
AlphaFin: Benchmarking Financial Analysis with Retrieval-Augmented Stock-Chain Framework (2024.lrec-main)

Copied to clipboard

Challenge: Currently, ML&DL methods fail to provide reasons for stock trend predictions, lacking interpretability and reasoning processes. large language models (LLMs) suffer from hallucinations and are unable to keep up with the latest information.
Approach: They develop a method to train large language models to handle financial analysis tasks . they use AlphaFin datasets to compare performance with traditional methods .
Outcome: The proposed method improves stock trend prediction and financial question answering tasks.
TranS: Transition-based Knowledge Graph Embedding with Synthetic Relation Representation (2022.findings-emnlp)

Copied to clipboard

Challenge: Knowledge graph embedding (KGE) is a computational approach to learn continuous vector representations of relations and entities in knowledge graphs.
Approach: They propose a transition-based method to learn continuous vector representations of relations and entities in knowledge graph (KG) it replaces a single relation vector in the relation part with a synthetic relation representation with entity-relation interactions to solve these problems.
Outcome: The proposed method achieves state-of-the-art on a large knowledge graph dataset.
Make Some Noise: Unlocking Language Model Parallel Inference Capability through Noisy Training (2024.emnlp-main)

Copied to clipboard

Challenge: Existing speculative decoding methods require additional model structure and training processes to assist the model for draft token generation.
Approach: They propose a make some noise training framework that introduces some noise at the input for the model to learn the denoising task.
Outcome: The proposed model improves inference speed by 2.3-2.7x times without compromising model performance.
LLaMA-E: Empowering E-commerce Authoring with Object-Interleaved Instruction Following (2025.coling-main)

Copied to clipboard

Challenge: E-commerce authoring requires engaging, diverse, and targeted content . Large language models lack memorization of domain-specific features in e-commerce applications .
Approach: They propose a unified e-commerce authoring models that address contextual preferences of customers, sellers, and platforms . they propose to integrate interleaved features presented by participating objects into the models to empower authoring applications with comprehensive scenario understanding .
Outcome: The proposed models achieve state-of-the-art evaluation performance and exhibit the advantage in zero-shot practical applications.
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.
Improving Empathetic Dialogue Generation by Dynamically Infusing Commonsense Knowledge (2023.findings-acl)

Copied to clipboard

Challenge: Existing work on generating empathetic responses by utilizing the speaker's emotion has not been successful.
Approach: They propose an approach which incorporates an adaptive module for commonsense knowledge selection to ensure consistency between the generated empathetic responses and the speaker’s situation.
Outcome: The proposed approach outperforms baseline models in both automatic and human evaluations, exhibiting the generation of more coherent and empathetic responses.
Instance-Guided Prompt Learning for Few-Shot Text Matching (2022.findings-emnlp)

Copied to clipboard

Challenge: Few-shot text matching is a more practical technique to determine whether two texts are semantically identical.
Approach: They propose a pluggable prompt learning method for few-shot text matching . they use the semantics of instances to regulate the effects of the gate on the prompt tokens .
Outcome: The proposed method outperforms baselines on MRPC and QQP.
Improving Deep Embedded Clustering via Learning Cluster-level Representations (2022.coling-1)

Copied to clipboard

Challenge: Existing efforts to learn meaningful representations at the instance level are limited.
Approach: They propose a deep embedded clustering model with cluster-level representation learning to jointly learn cluster and instance level representations.
Outcome: The proposed model produces meaningful clusters on real-world short text datasets.
StructFact: Reasoning Factual Knowledge from Structured Data with Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have made significant strides in natural language processing by leveraging their ability to comprehend and reason with factual knowledge.
Approach: They propose a benchmark to evaluate the ability of large language models to reason with structured data for knowledge-intensive tasks.
Outcome: Extensive tests on 10 common LLMs show that they struggle with heterogeneity of structured data during reasoning.
Unilaw-R1: A Large Language Model for Legal Reasoning with Reinforcement Learning and Iterative Inference (2025.emnlp-main)

Copied to clipboard

Challenge: Reasoning-focused large language models (LLMs) are rapidly evolving across various domains, yet their capabilities in handling complex legal problems remain underexplored.
Approach: They propose a large language model tailored for legal reasoning with a 7-billion parameter scale and a two-stage training strategy combining Supervised Fine-Tuning and Reinforcement Learning.
Outcome: The proposed model outperforms all models of similar scale on authoritative benchmarks and outperformed Qwen-2.5-7B-Instruct (46.6%) by an average margin of 6.6%.
AMR-TST: Abstract Meaning Representation-based Text Style Transfer (2023.findings-acl)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) is a semantic representation that can enhance natural language generation (NLG) by providing a logical semantic input.
Approach: They propose an AMR-based text style transfer technique that converts source text to an AML graph and generates transferred text based on the AMR graph modified by a TST policy named style rewriting.
Outcome: The proposed method achieves state-of-the-art results compared with baseline models in automatic and human evaluations.
SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models (2024.lrec-main)

Copied to clipboard

Challenge: Experimental results show that SmartTrim accelerates the original model by 2-3 times with minimal performance degradation.
Approach: They propose an adaptive acceleration framework which prunes redundant token representations and attention heads within each layer of the original model.
Outcome: The proposed framework accelerates the original model by 2-3 times with minimal performance degradation across vision-language tasks.
Length Extrapolation of Transformers: A Survey from the Perspective of Positional Encoding (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to enhance length extrapolation of large language models have been developed, but a systematic survey is lacking.
Approach: They propose to examine the effects of positional encoding on length extrapolation.
Outcome: The proposed methods improve the extrapolation of large language models, but they are still lacking a systematic survey.
Exposing Numeracy Gaps: A Benchmark to Evaluate Fundamental Numerical Abilities in Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks focus on linguistic competence or structured mathematical problem-solving, neglecting fundamental numerical reasoning required in real-world scenarios.
Approach: They propose a benchmark to evaluate numerical capabilities for large language models . they use a dataset to assess number recognition, arithmetic operations, contextual retrieval, comparison, summary, and multi-step reasoning.
Outcome: The proposed benchmark evaluates six fundamental numerical capabilities: number recognition, arithmetic operations, contextual retrieval, comparison, summary, and multi-step reasoning.
MMAPG: A Training-Free Framework for Multimodal Multi-hop Question Answering via Adaptive Planning Graphs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing multimodal question answering models rely on sequential retrieval and reasoning, but this single-path paradigm makes them vulnerable to errors due to misleading intermediate steps.
Approach: They propose a multimodal multi-hop question answering framework guided by an Adaptive Planning Graph . they propose modality-specific strategies that dynamically adapt to distinct data types .
Outcome: The proposed framework outperforms existing models that rely on training.
Where Did It Go Wrong? Capability-Oriented Failure Attribution for Vision-and-Language Navigation Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing testing methods are system-level and provide limited insight into which capability deficiencies cause task failures.
Approach: They propose a capability-oriented testing approach that enables failure detection and attribution by seed selection and mutation.
Outcome: The proposed method detects more failure cases and pinpoints capability-level deficiencies than state-of-the-art baselines, providing more interpretable and actionable guidance for improving embodied agents.
Improving Factual Consistency in Abstractive Summarization with Sentence Structure Pruning (2024.lrec-main)

Copied to clipboard

Challenge: Abstractive summarization models suffer from factual inconsistency problem . post-editing methods focus on replacing suspicious entities, failing to modify incorrect content hidden in sentence structures.
Approach: They propose to use sentence pruning operation to correct possible errors . they propose to apply sentence pruning operations to the syntactic dependency tree .
Outcome: The proposed method improves factual consistency on the FRANK dataset compared with baselines . it is model-independent and can serve as the final step in ensuring factual consistentness.
HydraRAG: Structured Cross-Source Enhanced Large Language Model Reasoning (2025.emnlp-main)

Copied to clipboard

Challenge: Current RAG system retrieves evidence from knowledge graphs and text documents but has limitations in multi-hop reasoning, multi-entity questions, and source verification.
Approach: They propose a training-free framework that unifies graph topology, document semantics, and source reliability to support deep, faithful reasoning in large language models.
Outcome: The proposed framework outperforms the current hybrid model-based model-driven system by 20.3% and 30.1% on seven benchmark datasets.
ProtoVQA: An Adaptable Prototypical Framework for Explainable Fine-Grained Visual Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: Visual Question Answering (VQA) is increasingly used in diverse applications where models must provide accurate answers and explanations that humans can easily understand and verify.
Approach: They propose a unified prototypical framework that learns question-aware prototypes that serve as reasoning anchors and applies spatially constrained matching to ensure that the selected evidence is coherent and semantically relevant.
Outcome: The proposed framework yields faithful, fine-grained explanations while maintaining competitive accuracy.
Advancing Large Language Model Attribution through Self-Improving (2024.emnlp-main)

Copied to clipboard

Challenge: Teaching large language models to generate text with citations to evidence sources requires high-quality attribution data, which is costly and labor-intensive.
Approach: They propose a framework for iteratively improving the attribution capability of large language models (LLMs) by attributing output to verifiable sources.
Outcome: Experiments on three open-domain question-answering datasets show that START improves in aggregating information across multiple sources.
Extending Context Window of Large Language Models from a Distributional Perspective (2024.emnlp-main)

Copied to clipboard

Challenge: Existing scaling methods for extending context window rely on empirical approaches and lack understanding of the internal distribution within RoPE resulting in suboptimal performance.
Approach: They propose to optimize the context window extending task from the view of rotary angle distribution by minimizing disturbance between rotary angles to maintain consistency with the pre-training phase.
Outcome: The proposed approach reduces by up to 72% of the distributional disturbance when extending LLaMA2’s context window to 8k, and reduces it by up 32% when extending to 16k.
DIXITWORLD: Evaluating Multimodal Abductive Reasoning in Vision-Language Models with Multi-Agent Dixit Gameplay (2026.acl-short)

Copied to clipboard

Challenge: Existing evaluations of multimodal abductive reasoning are limited to static, single-agent tasks.
Approach: They propose a multiagent evaluation suite that deconstructs the current evaluations of multimodal abductive reasoning in vision–language models.
Outcome: The evaluation suite is based on two core components: DixitArena and DixitsBench.
Pre-trained Personalized Review Summarization with Effective Salience Estimation (2023.findings-acl)

Copied to clipboard

Challenge: Pretrained language models (PLMs) are a new paradigm in text generation for the strong ability of natural language comprehension.
Approach: They propose a pre-trained personalized review summarization method that incorporates personalized information into the salience estimation of input reviews.
Outcome: The proposed method performs better than the state-of-the-art methods on real-world datasets.
SessionIntentBench: A Multi-task Inter-session Intention-shift Modeling Benchmark for E-commerce Customer Behavior Understanding (2026.findings-acl)

Copied to clipboard

Challenge: Existing models fail to capture and model customer intention effectively because of insufficient information exploitation and only apparent information like descriptions and titles are used.
Approach: They propose to exploit existing session data to capture and model intention in E-commerce product purchase sessions using a multimodal benchmark.
Outcome: The proposed framework can bridge the gap between intention understanding in simplified research cases like co-buy intention and more complex yet practical scenarios like session history.
QueryAttack: Jailbreaking Aligned Large Language Models Using Structured Non-natural Query Language (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to bypass security defenses of large language models (LLMs) are not effective, but QueryAttack can be jailbroken.
Approach: They propose a framework to examine generalizability of safety alignment by translating malicious queries into structured non-natural query languages.
Outcome: The proposed framework can achieve high attack success rates and jailbreak various defense methods on mainstream LLMs.
Gradient-Adaptive Policy Optimization: Towards Multi-Objective Alignment of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Reinforcement learning from human feedback (RLHF) has emerged as a powerful technique for aligning large language models (LLMs) with human preferences.
Approach: They propose a novel algorithm that uses multiple-gradient descent to optimize LLMs with diverse preferences to maximize trade-offs between objectives.
Outcome: The proposed approach incorporates user preferences across different objectives and achieves Pareto solutions that better align with the user’s specific needs.
CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information (2025.coling-main)

Copied to clipboard

Challenge: Existing LLM pruning works focus on unstructured pruning, which typically requires special hardware support for a practical speed-up.
Approach: They propose a network pruning framework that leverages both coarse and fine-grained activation information as an importance criterion to guide pruning.
Outcome: The proposed framework outperforms existing pruning methods on diverse models across sparsity budgets.
SAPT: A Shared Attention Framework for Parameter-Efficient Continual Learning of Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to address catastrophic forgetting and knowledge transfer in large language models (LLMs) ignore potential of aligning the two modules to effectively address catastrophic forgetting and knowledge transfers simultaneously.
Approach: They propose a Shared Attentive Learning & Selection module to align the PET learning and selection modules to address catastrophic forgetting and knowledge transfer simultaneously.
Outcome: Experiments on two CL benchmarks show that the proposed framework is superior when scaled to different model sizes, different model architectures and unseen tasks.
Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recycling (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) generate only one token at each decoding step, leading to high latency.
Approach: They propose a speculative decoding paradigm that stores tokens in an adjacency matrix and employs a breadth-first-search algorithm to construct a draft tree.
Outcome: The proposed method outperforms existing train-free methods by 30% and even a training method by 25%.

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