Papers by Wu Kai
Copied to clipboard
| Challenge: | Existing data selection techniques are designed for small data pools, a study finds . filtering data by token length is an efficient method for improving results . |
| Approach: | They use self-scoring methods that do not rely on external help to perform fine-tuning . they also find that filtering data by token length offers a stable and efficient method . |
| Outcome: | The proposed methods outperform random selection on large datasets on large data pools. |
Copied to clipboard
| Challenge: | Existing approaches to simultaneous machine translation require a robust read/write policy . a standalone multi-path wait-k model performs competitively with adaptive policies . |
| Approach: | They propose a more flexible approach by decoupling the adaptive policy model from the translation model. |
| Outcome: | The proposed approach outperforms baseline approaches in translation tasks. |
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. |
Copied to clipboard
| Challenge: | Existing methods neglect domain-specific knowledge and use the same word embedding for each word in all domain-specified datasets. |
| Approach: | They propose a method to incorporate domain-specific and task-oriented information into meta-embeddings by combining pre-trained word embeddings. |
| Outcome: | The proposed method performs well on four text classification datasets and shows that it is compatible with existing methods. |
Copied to clipboard
| Challenge: | Existing automated program-repair techniques focus on repairing memory corruptions, but they struggle with logical vulnerabilities because of their limited semantic understanding of the code and its expected behavior. |
| Approach: | They evaluated a dataset of 122 logical vulnerabilities and a framework to evaluate patches for logical weaknesses. |
| Outcome: | The proposed framework evaluates both traditional and LLM-based approaches for addressing real-world logical vulnerabilities. |
Copied to clipboard
| Challenge: | Multimodal Summarization with Multimodal Output (MSMO) is a new approach to produce a multimodal summary that integrates both text and relevant images. |
| Approach: | They propose an Entity-Guided Multimodal Summarization model that integrates both text and relevant images to produce a multimodal summary. |
| Outcome: | The proposed model integrates text-image and entity-image information and refines image selection through knowledge distillation from a pre-trained vision-language model. |
Copied to clipboard
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Copied to clipboard
| Challenge: | Existing methods to train offline MT models require generating target tokens before source sentence is fully consumed. |
| Approach: | They propose a method that leverages traditional translation models as teachers to generate monotonic yet accurate reference translations for sequence-level knowledge distillation. |
| Outcome: | The proposed approach improves on strong baselines and on a monotonic version of the WMT15 De-En test set. |
Copied to clipboard
| Challenge: | Critique Fine-Tuning (CFT) is a promising paradigm for unlocking the reasoning capabilities of large language models. |
| Approach: | They propose a method that leverages critique data generated from a single math problem to improve reasoning accuracy. |
| Outcome: | The proposed method surpasses one-shot RLVR while requiring 15 to 20 times less compute. |
Copied to clipboard
| Challenge: | Existing methods for generating multi-turn dialogue data struggle to ensure both diversity and quality in instructions. |
| Approach: | They propose a framework that synthesizes multi-turn conversations through an iterative "Ask-Respond-Review" process involving three agent roles: a Candidate, multiple Reviewers, and a Chairman. |
| Outcome: | The proposed framework synthesizes multi-turn conversations through an iterative "Ask-Respond-Review" process involving three agent roles: a Candidate, multiple Reviewers, and a Chairman. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can handle multilingual and cross-lingual text within a single input; however, previous studies focusing on using English as the pivot language to enhance language understanding and reasoning focus on using multiple languages. |
| Approach: | They propose to use parallel multilingual input to enhance the model's comprehension of the input and to examine how multilingual processing affects prediction. |
| Outcome: | The proposed model can handle multilingual and cross-lingual text within a single input, but previous studies focused on using English as the pivot language to enhance language understanding and reasoning. |
Copied to clipboard
| Challenge: | Existing pointwise LLMs provide noisy or biased answers for documents that are partially relevant to the query. |
| Approach: | They propose to incorporate fine-grained relevance labels into the LLM prompt . they propose to better differentiate between documents with different levels of relevance . |
| Outcome: | The proposed model can differentiate between documents with different levels of relevance to the query and derive a more accurate ranking. |
Copied to clipboard
| Challenge: | Despite the promising performance of Large Vision Language Models, they sometimes generate incorrect outputs. |
| Approach: | They propose a multi-modal reward model that aligns LVLMs with human preferences. |
| Outcome: | The proposed model achieves excellent results on the latest multi-modal reward model benchmark and shows competitive performance on text-only reward model. |
Copied to clipboard
| Challenge: | Existing methods for offsite-tuning of large language models require high computational costs and lack theoretical analysis. |
| Approach: | They propose an offsite-tuning approach that selectively applies compression techniques such as rank compression and channel pruning to preserve the gradients of fine-tuned adapters while ensuring privacy. |
| Outcome: | The proposed method surpasses existing OT methods in privacy protection and model performance. |
Copied to clipboard
| Challenge: | Large language models lack mathematical reasoning, a hurdle on the path to true artificial general intelligence. |
| Approach: | They propose a protocol for fine-tuning large language models with a Python code interpreter to enhance the text analysis of the LLMs. |
| Outcome: | The proposed protocol improves the performance of a 7B-parameter LLM on the GSM8K and MATH datasets while allowing for an outlier-free value model-based inference method. |
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. |
Copied to clipboard
| Challenge: | a multimodal protein language model (LLM) integrates sequence, structure, and function into functional annotation. |
| Approach: | They propose a multimodal protein language model that synergistically aligns bimodal representations with the textual modality to advance protein functional annotation. |
| Outcome: | The proposed model synergizes bimodal representations with the textual modality to advance protein functional annotation. |
Copied to clipboard
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
Copied to clipboard
| Challenge: | Existing approaches to medical text classification are struggling with imbalanced data distribution and rare labels. |
| Approach: | They propose a framework-agnostic algorithm that only utilizes internal label hierarchy in training deep learning models. |
| Outcome: | The proposed approach performs better on public datasets and real-world medical records than existing methods. |
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. |
Copied to clipboard
| Challenge: | Existing task-oriented dialogue systems lack ontology-aware pretraining methods for task-orientated dialogue. |
| Approach: | They propose an ontology-aware pretrained language model (OPAL) for end-to-end task-oriented dialogue (TOD) . they propose to pretrain on large-scale contextual text data to bridge the gap between the pretraining method and downstream tasks. |
| Outcome: | The proposed model achieves an exciting boost and obtains competitive performance even without any TOD data on CamRest676 and MultiWOZ benchmarks. |
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) inspire the "LLM-as-a-judge" paradigm . traditional methods of assessment and evaluation fail in dynamic and open-ended scenarios . |
| Approach: | They propose a paradigm where LLMs are leveraged to perform scoring, ranking, or selection for machine learning evaluation scenarios. |
| Outcome: | The proposed model-based judgment and evaluation paradigms are based on large language models and are compared to the current model-driven evaluation paradigm. |
Copied to clipboard
| Challenge: | Recent advances in speech translation (ST) research have focused on the unique characteristics of spontaneous speech, including accents and presentation quality. |
| Approach: | They propose to transform transcribed speech into a cleaner style more in line with the expectations of translation models built from written text. |
| Outcome: | Experiments on public and in-house translation models show that the proposed model can be effectively distilled into a standalone translation model. |
Copied to clipboard
| Challenge: | Recent work utilizes feedbacks generated from erroneous cases to guide prompt optimization . previous methods rely on computational resources and powerful GPUs . |
| Approach: | They propose an automatic prompt engineering method that leverages feedbacks from erroneous cases to guide prompt optimization. |
| Outcome: | The proposed method surpasses state-of-the-art methods with less steps and lower computational resources. |
Copied to clipboard
| Challenge: | Structure-aware Continual Pre-Training (SCPT) and Structure-Aware Supervised Fine-Tuning (SSFT) are two-stage strategies for knowledge injection and alignment that reduces the training corpus needs to 5% while achieving 100% of traditional knowledge injection performance. |
| Approach: | They propose a method to efficiently transform foundation Large Language Models into domain specialists by using two-stage strategies: Structure-aware Continual Pre-Training and Structure-Aware Supervised Fine-Tuning. |
| Outcome: | The proposed method significantly reduces the training corpus needs to a mere 5% while achieving 100% of traditional knowledge injection performance. |
Copied to clipboard
| Challenge: | Recent work on Text-to-SQL for multi-turn dialogue has attracted great interest . current approaches mostly employ end-to end models and face data sparsity problems . |
| Approach: | They propose a decoupled multi-turn text-to-SQL framework where dialogue context is explicitly solved by an utterance rewrite model and a single-turn Text-toSQl parser are proposed. |
| Outcome: | The proposed method outperforms existing models on SParC and CoSQL datasets without annotated in-domain data. |
Copied to clipboard
| Challenge: | Existing approaches to model conversation context have drawbacks, such as lack of coreferences and long dependency. |
| Approach: | They propose a context rewriting method which explicitly rewrites the last utterance by considering context history. |
| Outcome: | The proposed method outperforms baselines in terms of rewriting quality, multi-turn response generation, and end-to-end retrieval-based chatbots. |
Copied to clipboard
| Challenge: | Recent work addresses this problem by training span-level hallucination detectors using reinforcement learning and chain-of-thought reasoning. |
| Approach: | They propose a framework that explicitly enforces active evidence seeking during CoT reasoning by requiring quotation of relevant source segments at each verification step. |
| Outcome: | The proposed framework improves hallucination span detection performance with limited reasoning overhead and improved robustness in out-of-domain settings. |
Copied to clipboard
| Challenge: | Knowledge Graph (KG) inductive reasoning is widely adopted in various applications. |
| Approach: | They propose a framework for low-resource inductive reasoning using Large Language Models to generate a graph-structural prompt for pre-trained KGs. |
| Outcome: | The proposed framework outperforms previous methods in three-shot, one-shot and zero-shot reasoning tasks. |
Copied to clipboard
| Challenge: | Large vision-language models often prioritize language knowledge over image information on visual reasoning tasks, incurring performance degradation. |
| Approach: | They propose a visual reasoning framework that decouples vision-reasoning capabilities and multi-run proactive perception. |
| Outcome: | The proposed framework outperforms existing models on benchmarks for open-source and closed-source models with 13.2% performance gain. |
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis (ABSA) predicts sentiment polarity towards a specific aspect in a sentence. |
| Approach: | They propose to use a dynamic aspect-oriented semantics-based method to learn ABSA. |
| Outcome: | The proposed method can learn dynamic aspect-oriented semantics for ABSA on three benchmark datasets. |
Copied to clipboard
| Challenge: | Unsupervised sentence representation learning is one of the fundamental problems in natural language processing . contrastive learning methods fail to capture fine-grained ranking information among the sentences . |
| Approach: | They propose a novel approach for unsupervised sentence representation learning that integrates ranking consistency and ranking distillation with contrastive learning into a unified framework. |
| Outcome: | The proposed approach performs better over state-of-the-art models on STS and TR tasks. |
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. |
Copied to clipboard
| Challenge: | Existing general-domain benchmarks do not capture complexity of real-world judicial cognition and decision-making. |
| Approach: | They propose a benchmark specifically designed to evaluate LLM Agents in the legal domain. |
| Outcome: | The proposed benchmark includes 17 corpora from real-world legal scenarios and provides 37 tools for interacting with external knowledge. |
Copied to clipboard
| Challenge: | Existing safety alignment methods rely on fixed or narrow transformation schemes to generalize . existing methods based on fixed and narrow transformations are often inadequate . |
| Approach: | They propose a framework for discovering and refining language game-based jailbreaks to probe alignment generalization. |
| Outcome: | The proposed framework allows controlled exploration of alignment behavior across closely related linguistic variants. |
Copied to clipboard
| Challenge: | Existing datasets with verifiable answers are limited in reliability, diversity, and scalability . a new approach to generate verifikatable data at scale is needed to improve models' performance . |
| Approach: | They propose a formal framework for synthesizing verifiable data at scale using a novel DSL-driven approach. |
| Outcome: | The proposed framework improves performance on a wide range of puzzles and logic benchmarks. |
Copied to clipboard
| Challenge: | Recent years have seen rapid growth in the MRC community . MRC is believed to be a crucial step in building a general intelligent agent . |
| Approach: | They propose an end-to-end neural model that enables multiple passages to verify each other based on their content representations. |
| Outcome: | The proposed model outperforms the baseline on the English MS-MARCO dataset and the Chinese DuReader dataset, and achieves state-of-the-art performance on both datasets. |
Copied to clipboard
| Challenge: | Existing methods focus on layer-selective and data-selectory fine-tuning, but ignore the fact that different data points contribute varying degrees to distinct model layers. |
| Approach: | They propose a method that performs selective fine-tuning at both data and layer dimensions as integral components of a unified optimization strategy. |
| Outcome: | Experiments show that the proposed method outperforms baseline methods in terms of performance and performance. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved significant advances in natural language processing, but their scale and computational demands pose challenges to their practical application. |
| Approach: | They propose a method for distilling the self-evaluation capability from LLMs into SLMs and advocate for more comprehensive thinking by incorporating multiple distinct CoTs and self-estimation outputs. |
| Outcome: | The proposed method significantly improves the performance of distilled SLMs on three NLP benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to rank documents using large language models do not understand these challenging ranking formulations. |
| Approach: | They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets . |
| Outcome: | The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average. |
Copied to clipboard
| Challenge: | Existing methods to detect scam calls rely on labeled data and assume static distribution of scam narratives. |
| Approach: | They propose a method leveraging large language models to detect continuously evolving scam calls . scammers continuously evolve their tactics, making these methods less effective . |
| Outcome: | The proposed approach is based on large language models to detect continuously evolving scam calls. |
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. |
Copied to clipboard
| Challenge: | Personalized Federated RAG framework enables efficient collaborative fine-tuning of embedding models . depth-adaptive tieered Embedding (DATE) architecture is tailored for local data and training results of each client. |
| Approach: | a new Personalized Federated RAG framework is proposed for large language models . the framework enables efficient collaborative fine-tuning of embedding models based on common knowledge . |
| Outcome: | a novel Personalized Federated RAG framework is proposed for large language models . the framework enables efficient collaborative fine-tuning of embedding models based on common knowledge . |
Copied to clipboard
| Challenge: | Recent advances in Generative Reward Models have demonstrated that scaling the length of Chain-of-Thought reasoning enhances reliability of evaluation. |
| Approach: | They propose a framework that reconfigures raw rationales into structured Breadth-CoT and Depth-Co T through a modular synthesis pipeline. |
| Outcome: | The proposed framework surpasses open-source RMs by an average of 8.2%. |
Copied to clipboard
| Challenge: | despite the adoption of Large Language Models (LLMs), contract revision remains impeded because generic models treat strict legal constraints as mere suggestions. |
| Approach: | They propose a risk-constrained bilevel Stackelberg framework that models high-stakes revision as a strategic interaction rather than an open-ended conversation. |
| Outcome: | The proposed framework achieves state-of-the-art performance with an average RRR of 84.21% and enhanced token efficiency. |
Copied to clipboard
| Challenge: | Existing human-machine dialogue systems are not able to provide diagnostic information for depression diagnosis due to stigma associated with mental illness. |
| Approach: | They propose to construct a Chinese Dialogue Dataset for depression-diagnosis-oriented chat based on clinical depression diagnostic criteria. |
| Outcome: | The proposed system can be used to diagnose depression using a Chinese Dialogue Dataset. |
Copied to clipboard
| Challenge: | Existing evaluation methods rely on rule-based matching with shallow semantic understanding or adopt LLM-as-a-Judge approaches that incur high cost and latency while offering limited error interpretability. |
| Approach: | They propose a curriculum learning based hierarchical framework for QA task evaluation that supports quick scoring and fine-grained error analysis. |
| Outcome: | The proposed framework outperforms baseline methods on quick scoring and error analysis tasks while being 25 faster. |
Copied to clipboard
| Challenge: | Existing approaches to retrieval-augmented generation still face problems with low context utilization and frequent hallucinations. |
| Approach: | They propose a framework that reformulates retrieval and generation as constrained optimization and path planning. |
| Outcome: | The proposed framework significantly improves reasoning accuracy on complex queries while reducing hallucinations. |
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. |
Copied to clipboard
| Challenge: | Recent results show pre-trained language models (LMs) can improve machine reading comprehension (MRC) Experimental results indicate that KT-NET offers significant and consistent improvements over BERT . |
| Approach: | They propose a method that leverages external knowledge bases to improve machine reading comprehension (MRC) KT-NET employs an attention mechanism to select desired knowledge from KBs and fuses selected knowledge with BERT to enable context- and knowledge-aware predictions. |
| Outcome: | The proposed model outperforms baseline models on ReCoRD and SQuAD1.1 benchmarks and ranks 1st on the ReCoDR and SQUAD1.1 leaderboards. |
Copied to clipboard
| Challenge: | Open-domain question answering uses dense passage retrieval to find answers . however, it is difficult to effectively train a dual-encoder due to discrepancy between training and inference . |
| Approach: | They propose an optimized training approach to improve dense passage retrieval using RocketQA . they propose cross-batch negatives, denoised hard negatives and data augmentation . |
| Outcome: | The proposed approach outperforms state-of-the-art models on both MSMARCO and Natural Questions. |
Copied to clipboard
| Challenge: | Existing stationary-trained MRC systems are usually trained with in-domain data but are applied to new domain data. |
| Approach: | They propose a continual machine reading comprehension model with uncertainty-aware fixed memory and adversarial domain adaptation that keeps a stable understanding by learning both memory and new domain data. |
| Outcome: | The proposed model is superior to strong baselines and has a substantial incremental learning ability without catastrophically forgetting under two different continual MRC settings. |