Papers by Jing Xiong

18 papers
Automated Progressive Red Teaming (2025.coling-main)

Copied to clipboard

Challenge: Automated red teaming (ART) is effective but time-consuming, costly and lacks scalability.
Approach: They propose an automated red teaming framework that generates adversarial prompts to expose LLM vulnerabilities.
Outcome: The proposed framework explores and exploits LLM vulnerabilities through multi-round interactions.
Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing literature on mechanistic interpretation (MI) treats it as an observational science, leaving practical applications underexplored.
Approach: They propose a survey structured around the pipeline to identify and improve MI models.
Outcome: The proposed framework enables tangible improvements in Alignment, Capability, and Efficiency.
Towards Human-aligned Evaluation for Linear Programming Word Problems (2024.lrec-main)

Copied to clipboard

Challenge: Existing evaluation methodologies for MWPs diverge from human judgment and face challenges in recognizing mathematically equivalent answers.
Approach: They propose an evaluation metric rooted in graph edit distance that features benefits such as permutation invariance and more accurate program equivalence identification.
Outcome: The proposed evaluation metric features benefits such as permutation invariance and more accurate program equivalence identification.
Federated LoRA Fine-Tuning with Pipelined Error-Mitigated Aggregation and Matrix-Wise Freezing (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models often suffer from biased model aggregation and are hindered by significant communication and computation burden.
Approach: They propose a Federated low-rank adaptation system for large language models that leverages pipelined error-mitigated model aggregation and adaptive matrix-wise parameter freezing to mitigate aggregations.
Outcome: The proposed system improves time-to-target by 2.17-8.48 on real-world datasets.
Reasoning-Enhanced Domain-Adaptive Pretraining of Multimodal Large Language Models for Short Video Content Governance (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing approaches to identifying inappropriate content require extensive human-labeled data and lack cross-issue generalization.
Approach: They propose a reasoning-enhanced multimodal large language model (MLLM) pretraining paradigm for unified inappropriate content detection.
Outcome: The proposed model improves the MLLM's performance in both zero-shot and supervised fine-tuning settings and shows strong generalization capabilities to emergent, previously unseen issues.
Act-Adaptive Margin: Dynamically Calibrating Reward Models for Subjective Ambiguity (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to reward modeling in reinforcement learning tasks are limited when dealing with ambiguous preferences.
Approach: They propose to use AAM to dynamically calibrate preference margins using the Bradley-Terry model's internal parameter knowledge to improve reward modeling in subjective tasks.
Outcome: The proposed approach improves reward modeling by dynamically calibrating preference margins using the model’s internal parameter knowledge.
TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Automated theorem proving (ATP) benchmarks focus on symbolic inference but rarely involve understanding complex number combination reasoning.
Approach: They propose a benchmark that requires a model to reduce a trigonometric expression with step-by-step proof and evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms.
Outcome: The proposed benchmark evaluates a generative LM’s reasoning ability on formulas and ability to manipulate, group, and factor number terms.
ChatSOP: An SOP-Guided MCTS Planning Framework for Controllable LLM Dialogue Agents (2025.acl-long)

Copied to clipboard

Challenge: Existing models that use Large Language Models (LLMs) show superior performance in various tasks, but lack of controllability leads to unfocused conversations or task failure.
Approach: They propose a standard operating procedure (SOP) framework to regulate dialogue flow by integrating Chain of Thought reasoning and supervised fine-tuning for SOP prediction.
Outcome: The proposed method achieves a 27.95% improvement in action accuracy compared to baseline models based on GPT-3.5 and also shows notable gains for open-source models.
UNComp: Can Matrix Entropy Uncover Sparsity? — A Compressor Design from an Uncertainty-Aware Perspective (2025.emnlp-main)

Copied to clipboard

Challenge: Deploying large language models (LLMs) for long-context inference remains challenging due to their substantial memory and computational demands.
Approach: They propose an uncertainty-aware framework that leverages truncated matrix entropy to identify areas of low information content.
Outcome: The proposed framework reduces the KV cache size to 4.74% of the original and achieves a 6% speedup.
AlignedCoT: Prompting Large Language Models via Native-Speaking Demonstrations (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing LLMs are delicate and elusive in prompt words and styles.
Approach: They propose an LLM-acquainted prompting technique that includes proficient "native-speaking" they propose to use in-context learning to prompt LLMs to perform high-performance reasoning .
Outcome: The proposed technique achieves step-wise prompts in zero-shot scenarios while maintaining the prompt quality.
DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function (2023.acl-long)

Copied to clipboard

Challenge: Recent advances in neural theorem-proving resort to large language models and tree searches.
Approach: They propose a Dynamic-Tree Driven Theorem Solver to accommodate general theoremes by guiding the search procedure with state confidence and proof-level values.
Outcome: The proposed method outperforms state-of-the-art methods on two popular theorem-proving datasets with a 6.65% improvement on average in terms of success rate.
Not All Voices Are Rewarded Equally: Probing and Repairing Reward Models across Human Diversity (2025.findings-emnlp)

Copied to clipboard

Challenge: Using real-world datasets, we conduct the most comprehensive study to date, auditing various state-of-the-art reward models across nine sensitive attributes, including age, gender, ethnicity, etc.
Approach: They propose a method to mitigate group disparities in reward modeling by using real-world data.
Outcome: The proposed method is based on a population-based dataset with nine demographic attributes, including gender, ethnicity, age, gender, and ethnicity.
MEIT: Multimodal Electrocardiogram Instruction Tuning on Large Language Models for Report Generation (2025.findings-acl)

Copied to clipboard

Challenge: Recent studies have focused on classifying cardiac conditions using ECG data but have overlooked ECG report generation, which is time-consuming and requires clinical expertise.
Approach: They propose a Multimodal ECG Instruction Tuning framework that extends the capability of large language models (LLMs) for the task.
Outcome: The proposed framework outperforms open-source LLMs and LLM backbones across two large-scale ECG datasets.
EgoMemory: Memory-Augmented Personalized Retrieval for Long-Context Egocentric Video (2026.findings-acl)

Copied to clipboard

Challenge: Existing egocentric video datasets do not support the personalization and long-context reasoning required for episodic memory retrieval.
Approach: They propose a benchmark framework that uses MLLMs and reflective Chain-of-Thought to ground user queries in personal memory explicitly.
Outcome: The proposed framework outperforms state-of-the-art benchmarks on three benchmarks . it can be used to generate detailed target video descriptions in long-context contexts based on user-specific object annotations enriched with user-specified object annotation data .
BiPaR: A Bilingual Parallel Dataset for Multilingual and Cross-lingual Reading Comprehension on Novels (D19-1)

Copied to clipboard

Challenge: Using BiPaR, we build monolingual, multilingual and cross-lingual MRC on novels.
Approach: They propose a bilingual parallel novel-style machine reading comprehension dataset BiPaR . they collect 3,667 bilingual parallel paragraphs from Chinese and English novels .
Outcome: The proposed dataset supports multilingual and cross-lingual reading comprehension.
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.
Find Your Optimal Teacher: Personalized Data Synthesis via Router-Guided Multi-Teacher Distillation (2026.acl-long)

Copied to clipboard

Challenge: Existing studies show that stronger models are not always optimal teachers, suggesting a mismatch between the teacher’s output and the student’s learning ability.
Approach: They propose a method that routes each prompt to its optimal teacher via a query-level router that jointly considers the student models’ learnability and teacher models’ response quality.
Outcome: The proposed method outperforms baselines on six benchmarks including instruct tuning and math reasoning settings.
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.

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