Papers by Rui Tang

19 papers
Deeply Coupled Cross-Modal Prompt Learning (2023.findings-acl)

Copied to clipboard

Challenge: Existing prompt-tuning methods focus on language branch or learn vision-language interaction in a shallow mechanism.
Approach: They propose a Deeply coupled Cross-modal Prompt learning method based on CLIP to facilitate the interplay between vision and language with a Cross-Modal Prompting Attention mechanism.
Outcome: The proposed method enables the interplay between vision and language with a Cross-Modal Prompt Attention mechanism.
DART: Open-Domain Structured Data Record to Text Generation (2021.naacl-main)

Copied to clipboard

Challenge: Data-to-text annotations can be costly when dealing with tables with nontrivial structures.
Approach: They propose a procedure for extracting semantic triples from tables that encodes their structures by exploiting table headers and table title.
Outcome: The proposed method exploits the semantic dependencies between table headers and title to extract semantic triples from tables.
AgentTuning: Enabling Generalized Agent Abilities for LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world.
Approach: They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities.
Outcome: The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities.
Reasoning over Precedents Alongside Statutes: Case-Augmented Deliberative Alignment for LLM Safety (2026.acl-long)

Copied to clipboard

Challenge: OpenAI introduces deliberative alignment (DA) to enhance safety of its o-series models, but effectiveness of this approach in open-source LLMs is understudied.
Approach: They propose a case-augmented deliberative alignment method for large language models . they propose to use reinforcement learning on self-generated safety reasoning chains .
Outcome: The proposed method avoids narrowly enumerated rules and allows broader adaptability.
A Systematic Assessment of Language Models with Linguistic Minimal Pairs in Chinese (2026.tacl-1)

Copied to clipboard

Challenge: Using sub-linear length normalized log-probabilities (SLLN-LP), we find unequal lengths of sentences in minimal pairs difficult for LMs even up to 32B parameters.
Approach: They propose to use ZhoBLiMP as a linguistic minimal pair benchmark for Chinese language models to mitigate biases.
Outcome: The proposed metric mitigates biases in Chinese language models with over 100 paradigms . Anaphor, Quantifiers, and Ellipsis are difficult for LMs even up to 32B parameters .
Towards Transferable Personality Representation Learning based on Triplet Comparisons and Its Applications (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for personality analysis treat corpus as a single unit for classification, but this approach presents several challenges.
Approach: They propose a task paradigm for text-based personality representation learning that uses a triplet personality trend comparison dataset to learn single-sentence personality embeddings with desirable metric properties.
Outcome: The proposed model significantly boosts performance across various applications, including personality detection, personality retrieval, and emotion translation prediction.
Knowledge-Aware Co-Reasoning for Multidisciplinary Collaboration (2025.emnlp-main)

Copied to clipboard

Challenge: Existing multi-agent paradigms rely on prompt engineering and lack of knowledge integration.
Approach: They propose a framework that integrates structured knowledge reasoning into multidisciplinary collaboration by using clinical knowledge graphs to guide dynamic discipline determination.
Outcome: Extensive experiments on academic and real-world datasets demonstrate the effectiveness of the proposed framework.
FeTaQA: Free-form Table Question Answering (2022.tacl-1)

Copied to clipboard

Challenge: Existing table-based question answering datasets lack advanced information-based questions that require reasoning and integration of information pieces retrieved from structured knowledge sources.
Approach: They propose a dataset with 10K Wikipedia-based table, question, free-form answer, supporting table cells pairs that can be used to generate an answer.
Outcome: The proposed dataset has 10K Wikipedia-based table, question, free-form answer, supporting table cells pairs.
Hey, That’s My Data! Token-Only Dataset Inference in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing dataset inference methods require logit access, but many modern LLMs restrict such access.
Approach: They propose a token-only dataset inference framework that allows models to overwrite prior knowledge when trained on new data.
Outcome: The proposed framework overwrites prior knowledge when trained on new data.
TreeRL: LLM Reinforcement Learning with On-Policy Tree Search (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for On-Policy LLM RL typically train a separate process reward model, which suffers from distribution mismatch and reward hacking.
Approach: They propose a reinforcement learning framework that directly incorporates on-policy tree search for RL training.
Outcome: Experiments on math and code reasoning benchmarks show that tree search achieves superior performance compared to traditional ChainRL.
Towards Human-Like Machine Comprehension: Few-Shot Relational Learning in Visually-Rich Documents (2024.lrec-main)

Copied to clipboard

Challenge: Existing document AI approaches fail to consider key-value relations in visually-rich documents . a few-shot approach is proposed to extract key- value relation triplets in VRDs .
Approach: They propose a few-shot relational learning approach targeting the extraction of key-value relation triplets in Visually-Rich Documents.
Outcome: The proposed method outperforms existing methods in visually-rich documents.
LoRATK: LoRA Once, Backdoor Everywhere in the Share-and-Play Ecosystem (2025.findings-emnlp)

Copied to clipboard

Challenge: distributing LLMs without a proven track record like ‘meta-llama‘ or ‘qwen‘ rarely gains community traction.
Approach: They propose a simple, efficient, yet specific recipe for a backdoor LoRA to be injected into task-enhancing LoRAs and examine the mechanisms of such infections.
Outcome: The proposed model allows attackers to scale the distribution of compromised LoRAs with minimal effort by leveraging the rich pool of shared LoRA assets.
STINMatch: Semi-Supervised Semantic-Topological Iteration Network for Financial Risk Detection via News Label Diffusion (2023.emnlp-main)

Copied to clipboard

Challenge: Commercial news provides rich semantics and timely information for automated financial risk detection.
Approach: They propose a semi-supervised Semantic-Topological Iteration Network, STINMatch, along with a news-enterprise knowledge graph to endorse the risk detection enhancement.
Outcome: The proposed model outperforms existing models in terms of generalization and semantics and annotation.
Translationese-index: Using Likelihood Ratios for Graded and Generalizable Measurement of Translationese (2025.emnlp-main)

Copied to clipboard

Challenge: Translationese is a linguistic property that is often introduced in the translation process that is different from those of original texts.
Approach: They propose to use synthesized translations and translations in the wild to evaluate T-index's generalizability in cross-domain settings and its validity against human judgments.
Outcome: The proposed measure can generalize to unseen genres, authors, and language pairs.
OTExtSum: Extractive Text Summarisation with Optimal Transport (2022.findings-naacl)

Copied to clipboard

Challenge: Extractive text summarisation aims to select salient sentences from a document to form a short yet informative summary.
Approach: They propose to formulate extractive text summarisation as an Optimal Transport (OT) problem and use it to obtain an optimal summary that minimises the transportation cost to a given document.
Outcome: The proposed method outperforms state-of-the-art methods and learning-based methods on multiNews, PubMed, BillSum, and CNN/DM datasets.
Beyond Query Bias: Candidate-Aware Iterative Refinement for Zero-Shot Composed Image Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods to retrieve target images suffer from inherent cognitive bias due to unknown candidate distribution.
Approach: They propose a training-free framework that reframes ZS-CIR as a self-correcting process . they propose to use retrieved results as feedback to perceive the candidate distribution .
Outcome: Experiments on public benchmarks show that CoRR outperforms other SOTA methods.
Synthesizing Post-Training Data for LLMs through Multi-Agent Simulation (2025.acl-long)

Copied to clipboard

Challenge: Extensive experiments demonstrate that our framework effectively generates both general and domain-specific data.
Approach: They propose a multi-agent simulator that automatically generates diverse text-based scenarios, capturing a wide range of real-world human needs.
Outcome: Experiments show that the proposed model outperforms Meta’s Llama-3-8B-Instruct model on AlpacaEval 2 and Arena-Hard benchmarks with just 20K instruction-response pairs.
BaseCal: Unsupervised Confidence Calibration via Base Model Signals (2026.acl-long)

Copied to clipboard

Challenge: Post-trained LLMs typically compromise reliability with severe overconfidence, resulting in inaccurate responses.
Approach: They propose a solution that feeds PoLLMs into the base LLM to get confidence.
Outcome: The proposed solution reduces expected calibration error (ECE) by 42.90% compared to the best unsupervised baselines.

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