Papers by Kai Tang

23 papers
Annotations Are Not All You Need: A Cross-modal Knowledge Transfer Network for Unsupervised Temporal Sentence Grounding (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing work on temporal sentence grounding rely on expensive video-query paired annotations . despite this, there are no ground-truth annotations in the current work .
Approach: They propose to use paired video-query and segment boundary annotations to generate temporal sentence grounding without training.
Outcome: The proposed model outperforms existing unsupervised methods and beats supervised ones on two challenging datasets.
Learning Geometry-Aware Representations for New Intent Discovery (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for intent classification fail to distinguish new intents due to intertwined centers . a novel framework that learns geometry-aware representations to maximally separate all intents is proposed .
Approach: They propose a new intent discovery framework that learns geometry-aware representations to maximally separate all intents.
Outcome: The proposed framework achieves a new state-of-the-art performance on three benchmarking datasets.
VRoPE: Rotary Position Embedding for Video Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing versions of Large Language Models (LLMs) lack a positional encoding strategy for video.
Approach: They propose a new positional encoding method tailored for Video-LLMs that mitigates positional biases and ensures a more uniform distribution of spatial focus.
Outcome: The proposed method outperforms existing versions of RoPE in video understanding and reasoning tasks.
Empowering GraphRAG with Knowledge Filtering and Integration (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models suffer from knowledge gaps and hallucinations, resulting in incorrect or poor reasoning.
Approach: They propose Graph retrieval-augmented generation (GraphRAG) which integrates structured knowledge from external graphs to enhance model's reasoning.
Outcome: Experiments on knowledge graph QA tasks show that GraphRAG significantly improves reasoning performance across multiple backbone models.
ZoomRAG: Hierarchical Random-walk Zooming across Multi-scale Information Graphs for Fast and Accurate RAG (2026.findings-acl)

Copied to clipboard

Challenge: retrieval-augmented generation (RAG) is a powerful tool for NLP applications . but it is challenging to encode large knowledge bases as compact offline structures .
Approach: They propose a coarse-to-fine hierarchical graph inference method that uses random walks to retrieve information from a corpus of documents.
Outcome: The proposed method reduces offline indexing costs and accelerates retrieval.
CLOWER: A Pre-trained Language Model with Contrastive Learning over Word and Character Representations (2022.coling-1)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) have achieved remarkable performance gains across numerous downstream tasks in natural language understanding.
Approach: They propose a Chinese pre-trained language model that implicitly encodes words into characters . they propose 'contrastive learning over word' and 'character' representations to improve learning .
Outcome: The proposed model can encode words into fine-grained representations without modification of production pipelines.
SciExplore: Evaluating Autonomous Agents from Scientific Navigation to Information Integration (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks emphasize general-domain retrieval or static scientific question answering . SciExplore focuses on scientific database navigation, ambiguous literature retrieval, missing reference completion, and cross-source structured knowledge synthesis tasks.
Approach: They propose a benchmark to evaluate scientific information-seeking and reasoning capabilities of LLMs and agents.
Outcome: The new benchmark assesses the capabilities of state-of-the-art LLMs and agents in scientific research workflows.
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.
Everyone is unique: Towards Behaviorally Heterogeneous Negotiation Dialogue Systems for Debt Collection (2026.acl-long)

Copied to clipboard

Challenge: Existing models that assume users to be static, rational agents with fixed preferences fail to capture rich behavioral heterogeneity in real-world debt collection scenarios.
Approach: They propose a public persona-enriched debt collection benchmark that highlights behavioral heterogeneity in negotiation.
Outcome: The proposed benchmark outperforms existing models in realistic scenarios using 16 state-of-the-art LLMs.
Adaptive Zooming via Relevance-Informed Positional Resource Allocation for Training-free LLM Context Extension (2026.findings-acl)

Copied to clipboard

Challenge: Existing training-free methods for extrapolating beyond training context lengths are semantics-agnostic . Existing methods that focus on relative token distances can indiscriminately blur semantically relevant and irrelevant tokens .
Approach: They propose an adaptive positional zooming method that uses semantic relevance to extrapolate beyond training context lengths.
Outcome: Experiments show that RiPRA outperforms existing training-free extrapolation methods . relevant tokens get higher positional resolution, while irrelevant tokens are compressed .
T2S-GPT: Dynamic Vector Quantization for Autoregressive Sign Language Production from Text (2024.acl-long)

Copied to clipboard

Challenge: Existing vector quantization methods are fixed-length encodings, overlooking the uneven information density in sign language.
Approach: They propose a two-stage sign language production paradigm that encodes sign language sequences into discrete codes and autoregressively generates sign languages from text.
Outcome: The proposed model can dynamically adjust the encoding length based on the information density in sign language to achieve accurate and compact encoded enccoding.
KERAG: Knowledge-Enhanced Retrieval-Augmented Generation for Advanced Question Answering (2025.findings-emnlp)

Copied to clipboard

Challenge: Traditional Knowledge Graph Question Answering (KGQA) methods rely on semantic parsing to retrieve knowledge strictly necessary for answer generation.
Approach: They propose a retrieval-filtering-summarization pipeline that enhances QA coverage by retrieving a broader subgraph likely to contain relevant information.
Outcome: The proposed pipeline surpasses state-of-the-art solutions by about 7% in quality and exceeds GPT-4o (Tool) by 10-21%.
Prompting Large Language Models to Tackle the Full Software Development Lifecycle: A Case Study (2025.coling-main)

Copied to clipboard

Challenge: Existing benchmarks focused on simplified or isolated aspects of coding, ignoring the full spectrum of programming challenges.
Approach: They propose a case study that examines the performance of large language models across the entire software development lifecycle with four programming languages, multiple domains, and carefully designed and verified metrics for each task.
Outcome: The proposed model performs across the entire software development lifecycle, including design, environment setup, implementation, acceptance testing, and unit testing.
SoftDedup: an Efficient Data Reweighting Method for Speeding Up Language Model Pre-training (2024.acl-long)

Copied to clipboard

Challenge: Current methods focus on detecting and removing duplicates, which risks the loss of valuable information and neglects the varying degrees of duplication.
Approach: They propose a method that maintains dataset integrity while selectively reducing the sampling weight of data with high commonness.
Outcome: The proposed method significantly improves training efficiency on deduplicated datasets and improves downstream accuracy by 1.77%.
EasyQuant: An Efficient Data-free Quantization Algorithm for LLMs (2023.emnlp-main)

Copied to clipboard

Challenge: Recent work has shown that large language models are superior to conventional methods in various tasks.
Approach: They propose a data-independent quantization algorithm that leaves outliers in the weight and quantization ranges . they find the algorithm runs over 10 times faster than the data-dependent methods .
Outcome: The proposed method runs over 10 times faster than the data-dependent methods.
DenseSSM: State Space Models with Dense Hidden Connection for Efficient Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) face excessive computational and memory requirements due to the commonly used Transformer architecture.
Approach: They propose a method to enhance the flow of hidden information between layers in large language models by selectively integrating shallow-layer hidden states into deeper layers.
Outcome: The proposed method maintains parallelizability and inference efficiency of SSMs while significantly boosting performance on public benchmarks.
EMS-SD: Efficient Multi-sample Speculative Decoding for Accelerating Large Language Models (2025.naacl-long)

Copied to clipboard

Challenge: Speculative decoding is a key technique for enhancing the inference speed of Large Language Models.
Approach: They propose a method that adds padding tokens to ensure that the number of new tokens remains consistent across samples.
Outcome: The proposed method can handle the issue of inconsistent prediction tokens without adding padding tokens.
Mask the Correct Tokens: An Embarrassingly Simple Approach for Error Correction (2022.emnlp-main)

Copied to clipboard

Challenge: Text error correction methods usually use the source (incorrect) sentence as encoder input and generate the target (correct) sentences through the decoder.
Approach: They propose a method to correct errors in text sequences by randomly masking out the correct tokens in the source sentence.
Outcome: The proposed method improves accuracy on Mandarin and English datasets with autoregressive and non-autoregressive generation models.
ItiNera: Integrating Spatial Optimization with Large Language Models for Open-domain Urban Itinerary Planning (2024.emnlp-industry)

Copied to clipboard

Challenge: Existing urban itinerary planning studies focus on traditional tourism, but they lack the precision and accuracy needed to create a personalized itinerary.
Approach: They propose an open-domain urban itinerary planning system that integrates spatial optimization with large language models to provide customized urban itineraries based on user needs.
Outcome: The proposed system can generate personalized urban itineraries based on user needs and scale with existing methods.
Social-aware Sparse Attention Network for Session-based Social Recommendation (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for predicting the next item for an anonymous session do not capture user preferences and noisy irrelevant interactions.
Approach: They propose to use social networks and historical sessions to provide personalized recommendations for the current session.
Outcome: The proposed model outperforms existing models on two benchmark datasets.
Mitigating Coordinate Prediction Bias from Positional Encoding Failures (2026.findings-acl)

Copied to clipboard

Challenge: Multimodal Large Language Models (MLLMs) excel at general vision-language tasks, but precise coordinate prediction remains a challenge.
Approach: They propose a training-free, inference-time correction method to correct VPEs . they isolate position-unconditioned tendencies by shuffling VPE and use it to steer digit decoding .
Outcome: The proposed method is training-free, inference-time correction method . it effectively rectifies coordinate drift, yielding consistent improvements without retraining .
ORAL: Prompting Your Large-Scale LoRAs via Conditional Recurrent Diffusion (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to low-rank Adaptation (LoRA) are limited in scalability and controllability.
Approach: They propose a conditional recurrent diffusion framework that generates LoRA parameters directly . they integrate model architecture and textual task specifications to generate task-specific parameters .
Outcome: The proposed framework scales to billions-of-parameter LLMs and maintains controllability.

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