Papers by Ting Xu

23 papers
MaPPER: Multimodal Prior-guided Parameter Efficient Tuning for Referring Expression Comprehension (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for Referring Expression Comprehension (REC) lack specific domain abilities for precise local visual perception and visual-language alignment.
Approach: They propose a framework for Parameter-Efficient Transfer Learning to localize a visual region via natural language using a prior-guided prior.
Outcome: The proposed framework achieves the best accuracy compared to the current methods with only 1.41% tunable backbone parameters.
Lil: Less is Less When Applying Post-Training Sparse-Attention Algorithms in Long-Decode Stage (2026.findings-acl)

Copied to clipboard

Challenge: Prior work typically decomposes inference into prefill and decode stages, with the decode stage dominating total latency.
Approach: They propose an algorithm that detects threshold where information loss exceeds information gain during sparse decoding to reduce token consumption by up to 90% and a marginal accuracy degradation of less than 2%.
Outcome: The proposed algorithm reduces token consumption by 90% with a marginal accuracy degradation of less than 2% across reasoning-intensive benchmarks.
A Two-Agent Game for Zero-shot Relation Triplet Extraction (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for relation triplet extraction rely on labeled data and are limited in their applicability.
Approach: They propose a two-agent game approach to deliberate and debate unseen relations by two agents, a generator and an extractor.
Outcome: The proposed method outperforms baseline methods by 6%-16% in F1 scores.
Bridging the Memorization-Utilization Gap: Near-Lossless Context Compression via Reinforcement Learning (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in context compression have failed to effectively utilize compressed representations for downstream tasks.
Approach: They propose a holistic training paradigm that uses outcome-based RL to enable implicit expansion.
Outcome: The proposed model outperforms previous models on NIAH, LongBench and multi-hop reasoning.
Conversational Graph Grounded Policy Learning for Open-Domain Conversation Generation (2020.acl-main)

Copied to clipboard

Challenge: Existing word-level policy models that learn dialog policy and language generation from dialog corpora often lead to degeneration issues where the utterances become ungrammatical or repetitive.
Approach: They propose to represent prior dialog transitions as a graph and learn a CG grounded dialog policy that can foster a more coherent and controllable dialog.
Outcome: The proposed framework is able to learn dialog policy in open-domain multi-turn conversation.
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.
A Self-Training Method for Machine Reading Comprehension with Soft Evidence Extraction (2020.acl-main)

Copied to clipboard

Challenge: Existing models for machine reading comprehension lack evidence labels for training models.
Approach: They propose a method which supervises the evidence extractor with auto-generated evidence labels in an iterative process.
Outcome: The proposed method improves on three MRC tasks on seven datasets.
LLMs Meet Isolation Kernel: Lightweight, Learning-free Binary Embeddings for Fast Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) embeddings are typically high-dimensional, leading to substantial storage and retrieval overhead.
Approach: They propose a learning-free method that transforms an LLM embedding into a binary embeddable using Isolation Kernel (IKE).
Outcome: The proposed method performs 16.7 faster retrieval and 16 lower memory usage than the original LLM embeddings while maintaining comparable accuracy.
Multilingual Encoder Knows more than You Realize: Shared Weights Pretraining for Extremely Low-Resource Languages (2025.acl-long)

Copied to clipboard

Challenge: XLM-R and mBART have advanced multilingualism in NLP, but low-resource languages such as Tibetan, Uyghur, Kazakh, and Mongolian are underserved.
Approach: They propose a framework for adapting multilingual encoders to text generation in extremely low-resource languages by reusing the weights between the encoder and the decoder.
Outcome: The proposed framework performs better on various downstream tasks even when compared with much larger models.
CMHG: A Dataset and Benchmark for Headline Generation of Minority Languages in China (2025.emnlp-main)

Copied to clipboard

Challenge: Minority languages in China face significant challenges due to their unique writing systems, which differ from international standards.
Approach: They propose a dataset specifically curated for headline generation tasks for minority languages in China . they propose 50,000 entries each for Uyghur and Mongolian, and a test set annotated by native speakers .
Outcome: The proposed dataset will help improve headline generation in minority languages . it includes 100,000 entries for Tibetan, 50,000 entries each for Uyghur and Mongolian .
Dynamic Fusion Network for Multi-Domain End-to-end Task-Oriented Dialog (2020.acl-main)

Copied to clipboard

Challenge: Recent studies show remarkable success in end-to-end task-oriented dialog systems . however, most models rely on large training data, which is difficult to scalable for new domains with limited labeled data.
Approach: They propose a shared-private network which exploits the relevance between the target domain and each domain.
Outcome: The proposed model outperforms existing methods on multi-domain dialogue by 13.9% on average.
SHIELD: Evaluation and Defense Strategies for Copyright Compliance in LLM Text Generation (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have transformed machine learning but have raised significant legal concerns due to their potential to produce text that infringes on copyrights.
Approach: They propose a lightweight, real-time defense mechanism to prevent the generation of copyrighted text by evaluating methods and testing attack strategies.
Outcome: The proposed defense significantly reduces the volume of copyrighted text generated by LLMs by effectively refusing malicious requests.
Measuring Your ASTE Models in The Wild: A Diversified Multi-domain Dataset For Aspect Sentiment Triplet Extraction (2023.findings-acl)

Copied to clipboard

Challenge: Existing ASTE datasets are limited in their ability to represent real-world scenarios, hindering progress in this area.
Approach: They propose a new ASTE dataset that is manually annotated to better fit real-world scenarios by providing more diverse and realistic reviews.
Outcome: The proposed dataset is manually annotated to better fit real-world scenarios.
FTibSuite: A Comprehensive Resource Suite for Tibetan Vision–Language Modeling (2026.findings-acl)

Copied to clipboard

Challenge: FTibSuite provides an end-to-end training-and-evaluation workflow for vision–language models . Tibetan is underserved due to the lack of infrastructure for reproducible training and evaluation.
Approach: They propose a resource-centric workflow for Tibetan VLMs that provides an end-to-end training-and-evaluation workflow and human-verified multimodal annotations.
Outcome: FTibSuite provides an end-to-end training-and-evaluation workflow and human-verified multimodal annotations.
Multi-Lingual Question Generation with Language Agnostic Language Model (2021.findings-acl)

Copied to clipboard

Challenge: Existing training data for question generation in English and Chinese is limited . a language-agnostic model is developed to learn the shared representation from several languages in a single architecture.
Approach: They propose a language-agnostic language model which learns the shared representation from several languages in a single architecture.
Outcome: The proposed model improves multi-lingual question generation over five languages.
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.
GL-GIN: Fast and Accurate Non-Autoregressive Model for Joint Multiple Intent Detection and Slot Filling (2021.acl-long)

Copied to clipboard

Challenge: Existing joint models for multi-intent SLU only consider intent detection while ignoring slot filling task.
Approach: They propose a non-autoregressive model for joint multiple intent detection and slot filling . their framework is 11.5 times faster than existing joint models .
Outcome: The proposed model is 11.5 times faster than existing models and is faster than current models.
BitDistiller: Unleashing the Potential of Sub-4-Bit LLMs via Self-Distillation (2024.acl-long)

Copied to clipboard

Challenge: Weight quantization has emerged as a popular solution to reduce memory and computational demands.
Approach: They propose a framework that synergizes Quantization-Aware Training (QAT) with Knowledge Distillation (KD) to boost the performance of LLMs at sub-4-bit.
Outcome: The proposed framework outperforms existing QAT methods on language understanding and complex reasoning benchmarks on sub-4-bit models.
AFPQ: Asymmetric Floating Point Quantization for LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Low-bit weight quantization can save memory and accelerate inference.
Approach: They propose asymmetric FP quantization which sets separate scales for positive and negative values.
Outcome: The proposed method leads to large accuracy improvements and can be easily plugged into other quantization methods, including GPTQ and AWQ, for better performance.
SeqPO-SiMT: Sequential Policy Optimization for Simultaneous Machine Translation (2025.findings-acl)

Copied to clipboard

Challenge: SeqPO-SiMT is a new policy optimization framework for simultaneous machine translation that combines a tailored reward with a single step task.
Approach: They propose a new policy optimization framework that defines the simultaneous machine translation task as a sequential decision making problem with a tailored reward.
Outcome: The proposed framework outperforms the supervised fine-tuning model by 1.13 points while reducing the Average Lagging by 6.17 in the NEWSTEST2021 En Zh dataset.
AutoVecCoder: Teaching LLMs to Generate Explicitly Vectorized Code (2026.findings-acl)

Copied to clipboard

Challenge: Current development practices face a dichotomy between automation and performance.
Approach: They propose a framework to empower LLMs with the capability of automated explicit vectorization.
Outcome: The proposed framework achieves state-of-the-art performance on the SSE and AVX subsets of SimdBench.
iTool: Reinforced Fine-Tuning with Dynamic Deficiency Calibration for Advanced Tool Use (2025.emnlp-main)

Copied to clipboard

Challenge: Synthesizing tool-use data through real-world simulations is effective for enhancing large language models (LLMs) however, training gains decay as synthetic data increases, and the model struggles to benefit from more synthetic data.
Approach: They propose an iterative reinforced fine-tuning strategy to improve LLMs with external tools to augment their capabilities.
Outcome: The proposed method achieves 13.11% better performance than the same-size base model and outperforms larger open-source and closed-source models.
AGIF: An Adaptive Graph-Interactive Framework for Joint Multiple Intent Detection and Slot Filling (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing models focus on the single intent scenario, ignoring the fine-grained multiple intents information integration for token-level slot prediction.
Approach: They propose an Adaptive Graph-Interactive Framework for joint multiple intent detection and slot filling . they propose an intent-slot graph interaction layer to model the strong correlation between the slot and intents .
Outcome: The proposed framework improves on three multi-intent datasets and new state-of-the-art performance on single-intention datasets.

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