Papers by Xin Tao
Copied to clipboard
| Challenge: | Existing models rely on pre-trained language models, which have a maximum input sequence length of 512 tokens, and therefore have 'input length limitation'. |
| Approach: | They propose a text segmentation algorithm which guarantees to produce the optimal segmentation to address the issue of input length limitation caused by PLMs. |
| Outcome: | The proposed method improves both text and label representations on MLTC datasets, unraveling the intricate correlations between texts and labels. |
Copied to clipboard
| Challenge: | Sentence matching aims to determine the special relationship between two sentences. |
| Approach: | They propose to integrate syntactic and semantic information into BERT with sentence matching by using an implicit integration method that is less sensitive to the output structure information. |
| Outcome: | The proposed method achieves state-of-the-art or competitive performance on several sentence matching datasets. |
Copied to clipboard
| Challenge: | Large language models (LLMs) can modify their internal memory by incorporating the latest external knowledge, but in practical applications, outdated information may be inputted into LLMs. |
| Approach: | They propose a two-stage decoupling framework that separates the identification and computation of time constraints into a symbolic system and propose 'selective update' of internal memory based on time constraints. |
| Outcome: | The proposed framework improves ChatGPT performance by 60% and improves state-of-the-art LLM GPT-4. |
Copied to clipboard
| Challenge: | Existing methods for zero-shot relation extraction lack explicit modeling of matching pattern . et al. (2018) show that our method achieves higher matching accuracy and faster inference speed . |
| Approach: | They propose a fine-grained semantic matching method tailored for zero-shot relation extraction . they decompose sentence-level similarity score into entity matching score and context matching score . |
| Outcome: | The proposed method achieves higher matching accuracy and faster inference speed than state-of-the-art methods. |
Copied to clipboard
| Challenge: | Recent preference optimization algorithms such as Direct Preference Optimization (DPO) have become prevalent for aligning large language models with human preferences. |
| Approach: | They propose a preference optimization algorithm that introduces a modulating factor that down-weighs misranked preference pairs and employs focusing strategy that adapts over the course of training. |
| Outcome: | Experiments show that DynamicFocalPO surpasses both DPO and FocalPO on benchmarks including Alpaca Eval 2.0 and Arena-Hard using Mistral-Base-7B and Llama-3-Instruct-8B. |
Copied to clipboard
| Challenge: | Existing benchmarks evaluate agents in simplified, idealized settings, relying on pre-packaged tool interfaces, overlooking critical steps, and assume inputs are clean and fully specified. |
| Approach: | They propose a framework that evaluates language agents in simplified, idealized settings . they show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
| Outcome: | Experiments on 15 proprietary and open-source models show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) has become the dominant paradigm for building knowledge-intensive language systems. |
| Approach: | They propose a sigmoidal scaling law that shows that retrieval quality determines the asymptotic performance ceiling. |
| Outcome: | The proposed model achieves strong performance on knowledge-intensive benchmarks while retaining the predictable scaling long available for pre-training but previously absent in RAG-RL. |
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) are often deployed as cloud services, enabling users to upload textual data and perform inference remotely. |
| Approach: | They propose a privacy-preserving inference framework called MixPi which aims to obfuscate a user's private input by mixing it with multiple other inputs. |
| Outcome: | The proposed framework surpasses existing privacy-preserving methods on token and sentence classification tasks. |
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: | Recent large-scale video-language pre-trained models have shown appealing performance on downstream tasks. |
| Approach: | They propose a video-text model that adapts a pre-trained image-language model into a text-based model without heavy pre-training. |
| Outcome: | The proposed model outperforms existing models on video-text retrieval and video question answering tasks without heavy pre-training. |
Copied to clipboard
| Challenge: | Existing large language models (LLMs) show exceptional problem-solving capabilities but struggle with complex reasoning tasks. |
| Approach: | They propose a novel RAG approach that integrates retrieved information to guide tree-based reasoning process based on LLMs. |
| Outcome: | The proposed approach outperforms existing methods in large language models . iteratively plans intermediate sub-queries and answers based on the LLM itself . |
Copied to clipboard
| Challenge: | Existing proof generation models focus on generating several proof paths instead of a whole tree. |
| Approach: | They propose a method that generates the proof tree via iterative hierarchical inference . they propose coding the proof as plain text without losing structure information . |
| Outcome: | The proposed proof generation model significantly improves performance on widely-used datasets. |
Copied to clipboard
| Challenge: | Existing language models that use discrete representations for unified processing of various modalities are limited to text generation and do not include multimodal output. |
| Approach: | They propose a multimodal language model that utilizes discrete representations for unified processing of various modalities. |
| Outcome: | The proposed model can be trained stably without any alterations to existing models or training paradigms. |
Copied to clipboard
| Challenge: | Large-scale generative Pre-trained Language Models (PLMs) are limited in their deployment in real-world applications. |
| Approach: | They propose to prune the feed-forward networks of generative pre-trained language models to smaller widths without designing extra operators. |
| Outcome: | The proposed method achieves 1.51x/6.96x inference speedup on GPU/CPU with 67% size reduction. |
Copied to clipboard
| Challenge: | Existing KBQG models focus on the most relevant part of the answer entity, while neglecting the rest of the subgraph. |
| Approach: | They propose a controlled generation framework for Question Generation over Knowledge Bases that generates questions with out-of-vocabulary (OOV) predicates. |
| Outcome: | The proposed framework outperforms existing methods significantly on three widely-used benchmark datasets SimpleQuestion, PathQuestions, and WebQuestIONS. |
Copied to clipboard
| Challenge: | Existing research seeks to enhance RAG performance by retrieving higher-quality documents or designing RAG-specific LLMs, but internal mechanisms that contribute to RAG’s effectiveness remain underexplored. |
| Approach: | They propose to examine the internal mechanisms within the popular Mixture-of-Expert (MoE)-based LLMs and examine their ability to improve RAG by examining expert activations. |
| Outcome: | The proposed method significantly improved the ability of Large Language Models (LLMs) to solve knowledge-intensive tasks. |
Copied to clipboard
| Challenge: | Existing automated ICD coding systems face several fundamental challenges due to the limited availability of publicly available Chinese ICD datasets. |
| Approach: | They propose to use a Chinese ICD coding dataset and a multi-agent framework to reformulate ICD as a joint disease-procedure coding task. |
| Outcome: | The proposed system outperforms state-of-the-art methods on real-world Chinese ICD coding datasets and 1.7B-parameter models. |
Copied to clipboard
| Challenge: | Existing methods to compress generative pre-trained language models fail on generative tasks due to homogeneous word embeddings and limited memory. |
| Approach: | They propose a token-level contrastive distillation method to learn distinguishable word embeddings and a module-wise dynamic scaling method to make quantizers adaptive to different modules. |
| Outcome: | The proposed method outperforms the state-of-the-art compression methods on generative PLMs by a clear margin. |
Copied to clipboard
| Challenge: | Large vision language models have impressive reasoning capabilities across complex multimodal tasks. |
| Approach: | They propose to use distribution-reshaping and trajectory-rebalancing to improve visual reasoning capabilities. |
| Outcome: | Experiments on Qwen2-VL-7B-Instruct and InternVL2.5-4B models show that their methods outperform baselines by 3.86 points. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are promising foundations to build generally-capable agents . however, the community lacks a unified interactive framework that covers diverse environments for comprehensive evaluation of agents. |
| Approach: | They propose a framework that features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
| Outcome: | The proposed framework features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction. |
Copied to clipboard
| Challenge: | Existing few-shot NER solutions do not consider sub-class discrimination and various granularity of new classes during coarse training. |
| Approach: | They propose a method that uses a cluster-based prototype loss to learn group-wise discriminative representations of coarse-grained classes and a mixture prototype loss for learning the representations. |
| Outcome: | The proposed method shows superior performance over baseline methods on in-domain and cross-domain settings with various target granularity. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have focused on test-time scaling to improve reasoning quality but at the cost of efficiency. |
| Approach: | They propose a training-free framework that enhances reasoning accuracy and stability with minimal overhead. |
| Outcome: | The proposed framework yields consistent gains across general, coding, and STEM tasks while remaining highly efficient. |
Copied to clipboard
| Challenge: | Large language models struggle to process lengthy inputs due to limited length generalization and attention’s quadratic computational demands. |
| Approach: | They propose a training-free framework that allows each head to attend to important context chunks instead of allowing each head a full sentence . |
| Outcome: | The proposed framework unlocks multi-head attention's untapped potential by allowing each head to attend to important context chunks instead of the full sentence. |
Copied to clipboard
| Challenge: | Large pre-trained language models (PLMs) have demonstrated superior performance in industrial applications. |
| Approach: | They propose a framework that re-uses existing parameter-efficient methods with a unified classifier. |
| Outcome: | The proposed framework improves the efficiency of existing parameter-efficient methods with a unified classifier. |
Copied to clipboard
| Challenge: | Existing approaches to improve online inference efficiency of the Transformer for instantaneous Grammatical Error Correction (GEC) are sequenceto-sequence (seq2sequ) and sequenceto sequence (saq2eq) |
| Approach: | They propose a novel approach to improve the online inference efficiency of the Transformer model for instantaneous Grammatical Error Correction (GEC) it aggressively decodes as many tokens as possible in parallel instead of always decoding only one token in each step to improve computational parallelism. |
| Outcome: | The proposed approach can achieve state-of-the-art results in English and Chinese benchmarks with 10x speedup over the Transformer-big model. |
Copied to clipboard
| Challenge: | Existing knowledge extraction tools are not complete due to emerging entities and relations in real-world applications. |
| Approach: | They propose an open-source knowledge extraction toolkit DeepKE that supports low-resource, document-level and multimodal scenarios in the knowledge base population. |
| Outcome: | The proposed toolkit supports low-resource, document-level and multimodal scenarios in the knowledge base population. |
Copied to clipboard
| Challenge: | Residual networks are an Euler discretization of solutions to Ordinary Differential Equations (ODE). |
| Approach: | They propose a residual block of layers in Transformer that can be described as a higher-order solution to ODE. |
| Outcome: | The proposed architecture can gain large improvements over strong baselines at a slight cost in inference efficiency. |
Copied to clipboard
| Challenge: | Existing methods to compress KV cache compromise precision or require extra data for calibration, limiting their practicality in LLM deployment. |
| Approach: | They propose a low-bit quantization technique based on tensor decomposition to effectively compress KV cache. |
| Outcome: | The proposed method reduces memory footprint and performance by 75% . it is compared with existing methods that compromise precision or require extra data for calibration . |
Copied to clipboard
| Challenge: | Existing methods to extract entities from visually-rich documents ignore the inherent multimodality of VRDs and thus the suboptimal results are achieved. |
| Approach: | They propose a multimodal semantic enhancement method that filters redundant information in the current document and a cross-document information awareness technique to enrich the entity-related context. |
| Outcome: | The proposed method outperforms existing methods on two documents understanding benchmarks covering eight languages. |
Copied to clipboard
| Challenge: | Existing supervised relation extraction methods can still misclassify unknown relations into known relations due to the lack of supervision signals. |
| Approach: | They propose a method that regularizes the model by dynamically synthesizing negative instances that can provide the missing supervision signals. |
| Outcome: | The proposed method achieves SOTA unknown relation detection without compromising the classification of known relations. |
Copied to clipboard
| Challenge: | Text classification tasks often encounter few-shot scenarios with limited labeled data, and addressing data scarcity is crucial. |
| Approach: | They propose a self-evolution learning (SE) based mixup approach for data augmentation in text classification which generates more adaptive and model-friendly pseudo samples for the model training. |
| Outcome: | The proposed approach can generate more adaptive and model-friendly pseudo samples for the model training. |
Copied to clipboard
| Challenge: | Existing methods to preserve inference privacy are available as cloud services . however, the risk of privacy leakage remains, according to recent studies . |
| Approach: | They propose a method to preserve inference privacy by fusing token representations in the cloud. |
| Outcome: | The proposed method preserves inference privacy without sacrificing performance on different scenarios. |
Copied to clipboard
| Challenge: | Existing Named Entity Recognition systems are typically trained on a large-scale dataset with predefined entity classes, then deployed for entity recognition on the test data without further adaptation or refinement. |
| Approach: | They propose a representation learning method that adaptively detects entity clusters in "O" and two effective distance-based relabeling strategies for better learning the old classes. |
| Outcome: | The proposed method achieves 10.62% improvement over the baseline methods. |
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. |
Copied to clipboard
| Challenge: | Existing work on pre-training models have shown that it is important to use a framework to deploy various pre- training models efficiently. |
| Approach: | They propose an assemble-on-demand pre-training toolkit that assembles pre-trained models on demand and encapsulates them with rich modules. |
| Outcome: | The proposed framework can reproduce state-of-the-art models or develop models that remain unexplored. |
Copied to clipboard
| Challenge: | Existing methods for text-based person anomaly search fail to address the pose-semantic gap . asymmetric cross-modal information poses a challenge to accurately establishing retrieval relationships . |
| Approach: | They propose a video retrieval framework that partitions visual features into two categories based on relevance to the text query and performs effective interaction. |
| Outcome: | The proposed framework achieves leading retrieval performance on five benchmark datasets. |
Copied to clipboard
| Challenge: | Existing studies on web page quality assessment neglect the aspect of web page content. |
| Approach: | They propose a Chinese dataset for web page quality assessment . the dataset includes over 65,000 detailed an-notations spanning four sub-dimensions . |
| Outcome: | The proposed dataset includes over 65,000 detailed an-notations spanning four sub-dimensions and incorporates elements such as HTML+CSS, text, and visual screenshot. |
Copied to clipboard
| Challenge: | Existing approaches to time series representation learning are time-consuming and expert-dependent, which are difficult to generalize across different tasks. |
| Approach: | They propose to use large language model agent to guide unsupervised time series representation learning and a framework to integrate three LLM agents to collaboratively generate positive views for time series data. |
| Outcome: | The proposed framework integrates large language model (LLM) agent to guide unsupervised time series representation learning and compares it with state-of-the-art baselines on multiple time series datasets. |
Copied to clipboard
| Challenge: | Experimental results show that state-of-the-art summarization models have a significant decrease in performance on adversarial and noisy test sets. |
| Approach: | They propose a SummAttacker approach to generate adversarial samples based on pre-trained language models that can generate word-level synonym substitution and noise. |
| Outcome: | The proposed model performs better on noisy, attacked, and clean datasets than baseline models and is more robust on noisy and attacked datasets. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) integrate visual and textual inputs, yet modality alignment remains one of the most challenging aspects. |
| Approach: | They propose a token-level supervision alignment method that enables more precise visual-text alignment during pretraining. |
| Outcome: | The proposed method improves performance across various model sizes, with smaller models benefiting the most. |
Copied to clipboard
| Challenge: | Existing reward models concatenate contexts and responses, but they often ignore crucial segments of the context that are important for evaluating the response quality. |
| Approach: | They propose a reward model that evaluates the response quality based on a given context and assigns a rewards reward. |
| Outcome: | The proposed framework significantly improves preference modeling by increasing attention to relevant information within the context and achieves better generalizability. |
Copied to clipboard
| Challenge: | In this paper, we introduce SCALE, a collaborative framework that connects a compact Specialized Translation Model (STM) and a general-purpose Large Language Model (LLM) as one unified translation engine. |
| Approach: | They propose a collaborative framework that connects a Specialized Translation Model (STM) and a general-purpose Large Language Model (LLM) as one unified translation engine. |
| Outcome: | The proposed framework outperforms both LLMs and supervised models in high-resource or challenging low-resourced settings. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are often customized by fine-tuning for the requirements of different domains. |
| Approach: | They propose a controllable training framework to make undesired behaviors unlearnable during the fine-tuning process. |
| Outcome: | The proposed framework makes undesired behaviors unlearnable during the fine-tuning process while preserving the ability to learn other information. |
Copied to clipboard
| Challenge: | Prompt-based methods have been successfully applied in few-shot learning tasks . however, when applied to token-level labeling tasks, it would be time-consuming to enumerate the template queries over all potential entity spans. |
| Approach: | They propose a method to reformulate NER tasks as LM problems without templates. |
| Outcome: | The proposed method is 30.12 times faster than the template-based method under few-shot settings. |
Copied to clipboard
| Challenge: | Existing approaches to textual robustness evaluation focus on slightly modifying the input data, which maintains the original meaning and results in a different prediction. |
| Approach: | They propose a multilingual robustness evaluation toolkit for NLP that integrates universal text transformations, task-specific transformations and adversarial attack. |
| Outcome: | The toolkit includes universal text transformation, task-specific transformation, adversarial attack, subpopulation, and their combinations to provide comprehensive robustness analyses. |
Copied to clipboard
| Challenge: | Existing research implicitly assumes that longer thinking leads to better results . a recent study suggests that test-time compute scaling is more effective than model scaling . |
| Approach: | They challenge the assumption that longer thinking yields better results . they show that models exhibit overthinking and marginal returns diminish at higher budgets . |
| Outcome: | The proposed framework reduces computation significantly while maintaining comparable accuracy. |
Copied to clipboard
| Challenge: | Existing inference services are plagued by privacy concerns, such as sharing sensitive data with service providers. |
| Approach: | They propose a framework for protecting inference privacy by applying random perturbations to clustered representations. |
| Outcome: | The proposed framework protects inference privacy by applying random perturbations to clustered representations. |