Papers by Tao Sun
Copied to clipboard
| Challenge: | Recent commercial systems such as Suno demonstrate strong capabilities in long-form song generation, but academic research remains non-reproducible due to the lack of publicly available training data. |
| Approach: | They propose a system for long-form song generation with fine-grained style conditioning that includes a licensed synthetic dataset and a song generation model, Muse. |
| Outcome: | The proposed system achieves competitive performance on phoneme error rate, text–music style similarity, and audio aesthetic quality while enabling controllable segment-level generation across different musical structures. |
Copied to clipboard
| Challenge: | a new method for unlearning large language models is proposed to improve the performance of large language model models. |
| Approach: | They propose a probability perturbation-based unlearning paradigm that allows models to forget implicit knowledge in large language models with a focus on generalisation. |
| Outcome: | The proposed model improves unlearning vanilla target data while forgetting implicit knowledge. |
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: | Formality style transfer is a task of automatically transforming text in one particular formality style into another. |
| Approach: | They propose to augment parallel data with three specific data augmentation methods to improve the model's generalization ability and reduce the overfitting risk. |
| Outcome: | The proposed methods significantly improve performance when used to pre-train the model and lead to the state-of-the-art results in the GYAFC benchmark dataset. |
Copied to clipboard
| Challenge: | Existing benchmarks for logical reasoning in large language models lack language naturalness or limited complexity. |
| Approach: | They propose to use first-order logic annotations to evaluate logical reasoning capabilities of large language models. |
| Outcome: | The proposed dataset evaluates the FOL reasoning ability of supervised fine-tuning on medium-sized language models. |
Copied to clipboard
| Challenge: | Experimental results show that NHA surpasses Transformers on recall-intensive tasks. |
| Approach: | They propose a hybrid architecture of linear and full attention that integrates both into a unified layer design. |
| Outcome: | The proposed architecture surpasses Transformers and other hybrid baselines on recall-intensive and commonsense reasoning tasks. |
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: | Existing neural models struggle with implicit sentiment analysis because they latch onto spurious correlations, resulting in poor generalization and robustness. |
| Approach: | They propose a CausaL intervention model for implicit sEntiment ANalysis using instrumental variable to eliminate confounding causal effects and extract the pure causal effect between sentence and sentiment. |
| Outcome: | The proposed model extracts the pure causal effect between sentence and sentiment using instrumental variable. |
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 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: | MMDialog is a dataset of 1.08 million real-world dialogues with 1.53 million unique images across 4,184 topics. |
| Approach: | They propose to use a curated set of 1.08 million dialogues with 1.53 million unique images to generalize the open domain. |
| Outcome: | The proposed system can predict responses to multi-modal content with state-of-the-art techniques and measure their performance. |
Copied to clipboard
| Challenge: | Recent research on Chinese spelling correction methods has poor performance on multi-typo texts. |
| Approach: | They propose to use Bert-based Chinese spelling correction models to overcome these limitations by constructing a noisy context for each training sample and a copy mechanism to encourage the model to choose the input character when the miscorrected and input character are both valid. |
| Outcome: | The proposed model outperforms state-of-the-art models on widely used benchmarks and achieves a remarkable gain. |
Copied to clipboard
| Challenge: | Existing benchmarks for LLM-based mobile agents are insufficient to evaluate their capabilities. |
| Approach: | They propose a benchmark to evaluate LLM-based mobile agents' planning capabilities . they expand UI operations by incorporating 103 APIs to accelerate task completion . |
| Outcome: | The proposed benchmarks are based on 103 collected APIs and real user queries . the data is categorized into three distinct groups: SAST, SAMT, and MAMT . |
Copied to clipboard
| Challenge: | Several pre-training models of different modalities are showing a rising trend of homogeneity in their model structures. |
| Approach: | They propose a toolkit that supports pre-training models of different modalities. |
| Outcome: | The proposed toolkit can match the performance of the original implementations on text, vision, and audio benchmarks. |
Copied to clipboard
| Challenge: | Neural code search models are used to find code snippets from online repositories . however, their security aspect is rarely studied . |
| Approach: | They propose to use off-the-shelf code snippets from online repositories to find desired code . they propose to inject a backdoor into neural code search models which return buggy code if attacker modifies one variable/function name . |
| Outcome: | The proposed attack outperforms baselines on two neural code search models by 60%. |
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 methods express reliability by confidence level, but lack objective guidance . Existing approaches express reliability but lack guidance on when to trust LLMs . |
| Approach: | They propose a reward-based approach to align confidence with quality to ensure reliability . they propose 'conqORD' to help model to verbalize greater confidence for higher quality responses . |
| Outcome: | Experiments show that CONQORD significantly improves confidence and response accuracy . the proposed approach can be used to determine reliability of large language models . |
Copied to clipboard
| Challenge: | Existing methods for collecting medical data are expensive and time-consuming. |
| Approach: | They propose a method to train a large-scale LVLM capable of auto-generating medical visual instruction data to improve data efficiency. |
| Outcome: | The proposed method shows that it performs well across three major visual question answering (VQA) benchmarks. |
Copied to clipboard
| Challenge: | Document AI parsing semi-structured image form is a key information extraction task. |
| Approach: | They propose a multimodal and multilingual semi-structured FORM PARSER which integrates SER and relation extraction into a unified framework. |
| Outcome: | The proposed framework achieves up to 1.79% improvement on RE tasks in multilingual and zero-shot settings. |
Copied to clipboard
| Challenge: | Multi-aspect controllable text generation has attracted increasing attention . but the mutual interference of multiple prefixes limits its extensibility to training-time unseen combinations. |
| Approach: | They propose to use trainable gates to normalize the intervention of prefixes to restrain the interference. |
| Outcome: | The proposed approach outperforms baselines on constraint accuracy, text quality, and extensibility. |
Copied to clipboard
| Challenge: | Existing approaches to automatically generate commit messages are repetitive or redundant. |
| Approach: | They propose a retrieval-augmented neural commit message generation method which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message. |
| Outcome: | The proposed method outperforms baselines on a large dataset with five programming languages and can boost existing Seq2Seq models in commit message generation. |
Copied to clipboard
| Challenge: | Existing literature on knowledge extraction for question answering questions whether it is still relevant for question answerrs. |
| Approach: | They extend an existing benchmark with knowledge extraction annotations and evaluate commercial and open-source LLMs of varying sizes. |
| Outcome: | The proposed model can achieve high QA accuracy, but can still benefit from knowledge extraction through augmentation with extracted triples and multi-task learning. |
Copied to clipboard
| Challenge: | Existing benchmarks primarily focus on Python and are limited in terms of language diversity. |
| Approach: | They propose a multilingual debugging benchmark that includes 3.9K test samples of 20 programming languages and introduces the debug instruction corpora MdEval-Instruct by injecting bugs into the correct multilingual queries and solutions. |
| Outcome: | The proposed benchmark includes 3.9K test samples of 20 programming languages and covers the automated program repair task, bug localization task, and bug identification task. |
Copied to clipboard
| Challenge: | Existing methods rely on lexical or token-level features that fragment semantic units and fail to capture conceptually essential content. |
| Approach: | They propose an unsupervised framework leveraging Abstract Meaning Representation to preserve essential information while filtering irrelevant text. |
| Outcome: | The proposed framework outperforms RAG and existing baselines while preserving essential information while filtering irrelevant text. |
Copied to clipboard
| Challenge: | Existing methods for predicting inter-task transferability are sparse and task-specific. |
| Approach: | They propose a method that uses connectivity patterns of neurons as a unique identifier associated with a task. |
| Outcome: | The proposed method outperforms baselines in predicting inter-task transferability across data regimes and transfer settings while keeping high efficiency in computation and storage. |
Copied to clipboard
| Challenge: | Existing methods that ignore contextual knowledge fail to reliably fall back to parametric knowledge when presented with irrelevant context. |
| Approach: | They propose to use contextual knowledge to update and correct LLMs' knowledge by in-context editing instead of retraining. |
| Outcome: | The proposed method outperforms current state-of-the-art methods by a large margin on a dataset that contains irrelevant questions. |
Copied to clipboard
| Challenge: | Existing approaches to safety alignment of large language models rely on costly manual annotations or human review. |
| Approach: | They propose a closed-loop reinforcement learning framework called TriPlay-RL that enables iterative collaboration among three roles with near-zero manual annotation. |
| Outcome: | The proposed framework achieves 20%–50% improvement in adversarial effectiveness while preserving high output diversity while achieving 10%–30% gains in safety performance without degrading general reasoning capability. |
Copied to clipboard
| Challenge: | Recent studies have focused on improving the ability of Large Language Models to perform complex reasoning. |
| Approach: | They propose a Direct-Indirect Reasoning method that integrates DR and IR as parallel reasoning paths that are merged to derive the final answer. |
| Outcome: | The proposed method outperforms existing methods on four datasets related to logical reasoning and proof. |
Copied to clipboard
| Challenge: | Existing approaches to build labeled training data from domain-specific data are expensive to obtain. |
| Approach: | They propose a Prompt-based Data Augmentation model which only trains small-scale Soft Promptes in frozen Pre-trained Language Models. |
| Outcome: | The proposed model outperforms several baseline models on four benchmarks and is complementary with unlabeled in-domain data. |
Copied to clipboard
| Challenge: | Existing studies have shown that cross-lingual knowledge distillation can improve the performance of pre-trained models for cross-linguistic similarity matching tasks. |
| Approach: | They propose a multi-stage distillation framework for constructing a small-size but high-performance cross-lingual model using contrastive learning, bottleneck, and parameter recurrent strategies. |
| Outcome: | The proposed model can compress the size of XLM-R and MiniLM by more than 50% while the performance is only reduced by about 1%. |
Copied to clipboard
| Challenge: | Existing studies have revealed that Large Vision-Language Models suffer from hallucinations in practice, including object hallucines, spatial hallucinos, attribute hallucinications, etc. |
| Approach: | They propose to use CLIP model to mitigate object hallucinations by using a data augmentation method to create negative samples with a variety of hallucinian issues. |
| Outcome: | The proposed method mitigates object hallucinations and can be used as a visual encoder, effectively alleviating the object halluination issue in LVLMs. |
Copied to clipboard
| Challenge: | Recent work has applied large language models (LLMs) into time series forecasting, but they lack an understanding of holistic temporal patterns with potential error accumulation. |
| Approach: | They propose a framework that marries Larg e Langu age Diffusion Model with time series forecasting (LEAF) they propose converting time series into tokens and adopting language diffusion models to capture temporal dependencies. |
| Outcome: | The proposed framework generates future predictions with a diffusion model from a holistic view. |
Copied to clipboard
| Challenge: | Experimental results show that UniCoder with the universal code significantly outperforms the previous prompting methods by a large margin. |
| Approach: | They introduce the universal code (UniCode) as the intermediate representation of algorithm steps using conventions of programming languages. |
| Outcome: | The proposed model outperforms previous prompting methods by a large margin . the proposed model is based on a dataset of natural-language questions and code solutions . |
Copied to clipboard
| Challenge: | Traditional fine-tuning ignores one-to-many nature of language, leading to overfitting . authors propose a method to fine- tune LLMs by leveraging tokens. |
| Approach: | They propose a method to fine-tune Large Language Models by leveraging tokens to mask low-probability tokens. |
| Outcome: | The proposed method outperforms baselines on general reasoning and mathematical benchmarks. |
Copied to clipboard
| Challenge: | Recent studies have evaluated and shown limitations in specific capabilities such as visual understanding, but a systematic evaluation of VLMs’ fundamental WM abilities remains absent. |
| Approach: | They propose a framework that assesses perception and prediction to provide an atomic evaluation of VLMs as WMs. |
| Outcome: | The proposed framework assesses perception and prediction abilities on 15 latest VLMs and compares them to human-level models. |
Copied to clipboard
| Challenge: | Existing work focuses on enabling models to generate natural language chain-of-thought rationales or leverage executable and verifiable code, such as Python. |
| Approach: | They propose a novel training pipeline that integrates sequential P-CoT and N-Co T generation and a subtask hybrid training strategy to facilitate natural language transferability. |
| Outcome: | The proposed training pipeline improves both N-CoT and P-Co T performance over the RL baseline. |
Copied to clipboard
| Challenge: | Existing methods for Open Relation Extraction (OpenRE) use a two-stage pipeline, which learns relation representations and assignments in the first stage, then manually labels relation for each cluster. |
| Approach: | They propose a method that performs relation learning and relation labeling simultaneously without a significant increase in human effort. |
| Outcome: | The proposed method improves existing SOTA methods by 13.8% and 10.6% on two datasets. |
Copied to clipboard
| Challenge: | RISK is a framework designed to automate multi-step web interactions in e-commerce risk management. |
| Approach: | a new framework is designed to build and deploy GUI agents for e-commerce risk management . RISK-R1 provides a scalable, domain-specific solution for automating complex web interactions . |
| Outcome: | RISK provides a scalable, domain-specific solution for automating complex web interactions in e-commerce risk management. |
Copied to clipboard
| Challenge: | Existing approaches to integrate large language models and knowledge graphs with LLMs often ignore the rich cognitive potential inherent in KGs. |
| Approach: | They propose an observation-driven agent framework that integrates KG reasoning abilities via global observation and integrates it into the action and reflection modules. |
| Outcome: | The proposed framework improves on several datasets and achieves 12.87% and 8.9% accuracy improvements. |
Copied to clipboard
| Challenge: | Existing pretraining tasks for Language Models (LMs) focus on learning the textual information of each entity and overlook the crucial aspect of capturing topological connections among entities in TAHGs. |
| Approach: | They propose a topology-aware pretraining task that explicitly considers the topological and heterogeneous information in TAHGs by optimizing an LM and an auxiliary heterogenous graph neural network. |
| Outcome: | The proposed framework explicitly considers the topological and heterogeneous information in TAHGs. |
Copied to clipboard
| Challenge: | Existing methods to train language models rely on manual design, perplexity, or careful prompt engineering. |
| Approach: | They propose a method that automatically mines criteria from human preferences for data quality with only 30 human-annotated pairs and performs efficient data selection. |
| Outcome: | The proposed method improves on human-annotated test sets and shows high accuracy on code, math, and logic domains. |
Copied to clipboard
| Challenge: | Experimental results show that the MOS-aware GRM significantly improves fine-grained speech quality discrimination. |
| Approach: | They propose a MOS-aware reward model that incorporates MOS gap into reward function during reinforcement learning. |
| Outcome: | The proposed model significantly improves fine-grained speech quality discrimination. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved remarkable performance on various NLP tasks, yet their potential in more challenging task like finance, has not been fully explored. |
| Approach: | They propose a benchmark to assess the financial knowledge of large language models (LLMs) in China. |
| Outcome: | The proposed benchmark is the most comprehensive evaluation benchmark to date for LLMs in finance. |
Copied to clipboard
| Challenge: | Existing methods to improve computational efficiency are under-explored and face several critical challenges. |
| Approach: | They propose a method that selectively activates only a subset of the model's layers, skipping those deemed less important. |
| Outcome: | The proposed method significantly improves performance on Attention layers and MoE layers while reducing redundant computation and memory usage. |
Copied to clipboard
| Challenge: | Multimodal large language models have demonstrated remarkable performance in visual-language tasks, but their authenticity is often compromised by object hallucinations. |
| Approach: | They propose a multi-frequency perturbation method that leverages both low-frequency and high-frequency features of images to perturb visual feature representations and explicitly suppress redundant frequency-domain features during inference. |
| Outcome: | The proposed method significantly mitigates object hallucinations across various model architectures. |
Copied to clipboard
| Challenge: | Using static vocabulary, vocabulary is ignored in advanced generation tasks. |
| Approach: | They propose a dynamic vocabulary that can involve arbitrary text spans during generation. |
| Outcome: | The proposed vocabulary can be deployed in a plug-and-play way, thus is attractive for various downstream applications. |
Copied to clipboard
| Challenge: | Existing methods to predict performance of large language models are lacking . authors propose a size-dependent mutual information predictor for closed-book question answering accuracy . |
| Approach: | They propose a size-dependent mutual information predictor that integrates knowledge frequency, knowledge specificity, and model size to forecast closed-book question answering accuracy. |
| Outcome: | The proposed method outperforms baseline models and achieves R2 > 0.7 in predicting QA accuracy without additional training. |
Copied to clipboard
| Challenge: | Activation sparsity is a promising paradigm for accelerating model inference . few large language models achieve high activation spar and comparable performance . |
| Approach: | They propose a method to achieve activation sparsity and acceleration in large language models . they introduce ReLU activation and adopt progressive sparse regularization . |
| Outcome: | The proposed method achieves high activation sparsity and comparable model performance. |