Papers by Tao Ge
Copied to clipboard
| Challenge: | Large Language Models excel at code generation by learning from vast code corpora, but a fundamental semantic gap remains between training on textual patterns and the goal of functional correctness . reinforcement learning with verifiable rewards (RLVR) approaches are inefficient for establishing a well-aligned connection between the textual representation of code and its execution semantics. |
| Approach: | They propose a novel approach that integrates execution semantics alignment into the RLVR training pipeline for code generation. |
| Outcome: | The proposed model outperforms baseline training and RLVR and shows strong applicability across RL and LLMs. |
Copied to clipboard
| Challenge: | DisCo-Speech is a zero-shot controllable text-to-speech framework . standard codecs entangle timbre and prosody, which hinders independent control in continuation-based LMs. |
| Approach: | They propose a disentangled speech codec and an LM-based generator to solve this problem . they propose fusion and reconstruction that merges content and prosody into unified tokens . |
| Outcome: | DisCo-Speech achieves competitive voice cloning and superior zero-shot prosody control. |
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: | Extensive experiments show EdgeFormer can effectively outperform previous parameter-efficient Transformer baselines and achieve competitive results under both the computation and memory constraints. |
| Approach: | They propose a parameter-efficient Transformer for on-device seq2seq generation that uses two novel principles for cost-effective parameterization. |
| Outcome: | Extensive experiments show that EdgeFormer outperforms the previous parameter-efficient Transformers and achieves competitive results under both the computation and memory constraints. |
Copied to clipboard
| Challenge: | Recent studies on compression of pretrained language models usually use preserved accuracy as the metric for evaluation. |
| Approach: | They propose two new metrics that measure how closely a compressed model mimics the original model. |
| Outcome: | The proposed metrics measure how closely a compressed model (i.e., student) mimics the original model (e.g., teacher). |
Copied to clipboard
| Challenge: | Cant is important for understanding advertising, comedies and dogwhistle politics . currently, there are very few resources available for the research of cant . |
| Approach: | They propose a large and diverse dataset for creating and understanding cant from a computational linguistics perspective. |
| Outcome: | The proposed dataset can be used to test word embedding similarity and pretrained language models. |
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: | Existing methods to learn user and item representations from review texts do not take into account the user-user and item-item relatedness of the user. |
| Approach: | They propose to use review content and user-item graphs to integrate them as different views. |
| Outcome: | The proposed approach can learn user and item representations from review content and user-item graphs. |
Copied to clipboard
| Challenge: | Existing methods for continual learning in language models suffer catastrophic forgetting when learning sequential tasks. |
| Approach: | They propose an orthogonal low-rank adaptation approach for continual learning in language models that uses orthogons to learn sequentially. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on continual learning benchmarks and preserves generalization ability of LLMs on unseen tasks. |
Copied to clipboard
| Challenge: | Low-code LLM is a visual programming interface that allows users to incorporate their ideas into the process without writing trivial prompts. |
| Approach: | They propose a human-LLM interaction framework that incorporates low-code visual programming interactions to achieve more controllable and stable responses. |
| Outcome: | The proposed framework enables users to incorporate ideas into the process without writing trivial prompts. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been widely adopted in real-world dialogue applications, but their robustness is criticized all along. |
| Approach: | They propose to use play-by-play text commentary to build a multi-turn athletic real-world scenario dialogue benchmark to evaluate three critical aspects of multi-turned conversations: ultra multi- turn, interactive multi-twist, and cross-turn tasks. |
| Outcome: | The proposed benchmarks outperform open-source LLMs on three critical aspects of multi-turn conversations: ultra multi-turned, interactive multi- turn, and cross-turn tasks. |
Copied to clipboard
| Challenge: | Existing methods for instruction data selection have limitations such as relying on fragile external APIs, being affected by biases in GPT models, or reducing the diversity of the selected instruction dataset. |
| Approach: | They propose an industrial-friendly, expert-aligned and diversity-preserved instruction data selection method: Clustering and Ranking (CaR). |
| Outcome: | The proposed method outperforms Alpaca's existing methods by 32.1% in GPT-4 evaluations. |
Copied to clipboard
| Challenge: | Larger models or those trained on fewer tokens exhibit less quantization-induced degradation (QiD), while smaller, well-trained models face significant performance losses. |
| Approach: | They propose to use QiD to measure an LLM’s training levels and determine the number of training tokens required for fully training LLMs of various sizes. |
| Outcome: | The proposed scaling laws can predict the quantization performance of different-sized LLMs trained with tokens. |
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 solutions for document QA fail to provide personalized and up-to-date information efficiently. |
| Approach: | They propose to deploy a self-evolving, efficient LLM system that can offer personalized research services, maintaining a real-time updated database. |
| Outcome: | The proposed system saves 69.92% of time after efficient deployment. |
Copied to clipboard
| Challenge: | Existing methods to improve the efficiency of GEC are not efficient enough for GEC. |
| Approach: | They propose a language-independent approach to improve the efficiency of GEC by dividing the task into two subtasks: ESD and ESC. |
| Outcome: | The proposed approach performs comparably to conventional seq2seq approaches in English and Chinese GEC benchmarks with less than 50% time cost for inference. |
Copied to clipboard
| Challenge: | Existing work on LLMs that only enhance reasoning abilities, but which lack factual hallucination and slow-thinking capabilities, argues that SPP is a cognitive synergist. |
| Approach: | They propose a Solo Performance Prompting (SPP) that transforms a single LLM into a cognitive synergist by engaging in multi-turn self-collaboration with multiple personas. |
| Outcome: | The proposed model reduces factual hallucination and maintains strong reasoning abilities on three challenging tasks . |
Copied to clipboard
| Challenge: | Chinese Spelling Correction (CSC) lacks large-scale high-quality corpora due to labor-intensive labeling of spelling errors in real-life writing or typing scenarios. |
| Approach: | They propose to use OCR/ASR-based generation to refine Chinese Spelling Correction models on random replacement-based corpora and filter them based on prediction confidence. |
| Outcome: | The proposed model outperforms existing models on three widely-used benchmarks while significantly alleviating over-correction. |
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: | Currently, long-context language models are limited by the lack of a rigorous evaluation framework for long code understanding. |
| Approach: | They propose to use a long code understanding benchmark LongCodeU to evaluate LCLMs' long code comprehension ability for practical applications. |
| Outcome: | The proposed benchmarks show that current LCLMs are limited in their long code understanding ability, particularly when the long code length is greater than 32K, falling far short of their claimed 128K to 1M context windows. |
Copied to clipboard
| Challenge: | Despite LLMs' impressive capabilities in musical knowledge, music reasoning remains an unsolved task. |
| Approach: | They propose an open-source large language model (LLM) that integrates intrinsic musical abilities into LLaMA2 and GPT-3.5. |
| Outcome: | The proposed model can understand and generate music with a pure text tokenizer without external multi-modal neural structures or tokenizers. |
Copied to clipboard
| Challenge: | Existing defense approaches focus on developing new model structures or training algorithms, but they do little to tap the potential of training instances. |
| Approach: | They propose a method that can distinguish between robust and non-robust instances according to the model’s sensitivity to perturbations on individual instances during training. |
| Outcome: | The proposed method can distinguish between robust and non-robust instances according to the model’s sensitivity to perturbations on individual instances during training. |
Copied to clipboard
| Challenge: | Existing methods to generate error-corrected sentence pairs for improving grammatical error correction are not available. |
| Approach: | They propose a method to generate error-corrected sentence pairs for improving grammatical error correction based on machine translation models of different qualities . |
| Outcome: | The proposed method can generate multiple error-corrected sentence pairs from Chinese to English text. |
Copied to clipboard
| Challenge: | Document editing requires full-context awareness of dependencies, but processing entire documents for each edit incurs prohibitive token costs and latency. |
| Approach: | a framework that constructs lightweight dependency graphs captures semantic relationships and structural hierarchies across document elements is proposed for agentic document editing . a scaLing agentic agentic framework is based on a dependency graph framework that captures dependencies and refactors function dependencies. |
| Outcome: | a new framework achieves 76 consistency versus 56 baseline while reducing token usage by 85 . the framework is based on a framework that captures semantic relationships and structural hierarchies across document elements . it can be used to improve document consistency, but it also reduces token costs and latency . |
Copied to clipboard
| Challenge: | Using word suggestions, writing assistance is a widely used application of natural language processing (NLP) . a task is performed to identify words or phrases that require improvement and provide substitution suggestions for each improvable target. |
| Approach: | They propose a task and benchmark to help writers improve word usage . they use human-labeled data and a distantly supervised dataset for testing . |
| Outcome: | The proposed task and benchmark aims to improve word usage in writing aids. |
Copied to clipboard
| Challenge: | Semiparametric language models (LMs) use static storage, which lacks learning capability and is disconnected from the internal information flow of the parametric models. |
| Approach: | They reconceptualize the non-parametric memory represented by kNN-LM as a learnable Mixture-of-Neighbors Induction Memory (MoNIM) this synergizes the induction capabilities of attention heads with the memorization strength of feed-forward networks . |
| Outcome: | The proposed model is a learnable Mixture-of-neighbors induction memory (MoNIM) it synergizes the induction capabilities of attention heads with the memorization strength of feed-forward networks (FFNs). |
Copied to clipboard
| Challenge: | Existing approaches to reinforcement learning with verifiable reward (RLVR) are limited by difficulty or lack of exploration. |
| Approach: | They propose a self-evolving curriculum learning framework based on chain-of-thought reasoning optimization that constrains exploration space by self-generating and verifying CoT trajectories. |
| Outcome: | The proposed framework enables LLMs to solve previously unsolved problems without external supervision and is compatible with various RL fine-tuning methods. |
Copied to clipboard
| Challenge: | a novel approach to compress neural networks by progressive module replacement is proposed . a number of techniques have been proposed to compress pretraining and fine-tuning models . |
| Approach: | They propose a model compression approach that divides BERT into modules and builds their compact substitutes. |
| Outcome: | The proposed approach outperforms existing knowledge distillation approaches on GLUE benchmark . it is based on a model that divides the original BERT into several modules and builds their substitutes . |
Copied to clipboard
| Challenge: | Sequence-to-sequence (seq2sequ) models have a weakness: they cannot always generate sentences without grammatical errors. |
| Approach: | They propose to use automatic grammatical error correction to improve seq2seq models . they conduct experiments on machine translation, formality style transfer, sentence compression and simplification . |
| Outcome: | The proposed system can improve grammaticality of generated text and improve formal style tasks. |
Copied to clipboard
| Challenge: | Existing text infilling objectives for pretrained language models require self-supervision by masking out tokens or spans in text. |
| Approach: | They propose to extend text infilling to a self-supervised sequence-to-sequence (Seq2Sequen) task. |
| Outcome: | The proposed task improves the model's performance on various natural language generation tasks. |
Copied to clipboard
| Challenge: | Despite the promising evaluation results by knowledge distillation (KD) in natural language understanding (NLU) and sequence-to-sequence (seq2sequ) tasks, KD for causal language modeling (LM) remains a challenge. |
| Approach: | They propose to use external logits to improve a student's kNN-LM by leveraging teacher's knowledge at test time. |
| Outcome: | The proposed method improves a student's kNN-LM in multiple language modeling datasets and improves perplexity. |
Copied to clipboard
| Challenge: | Alympics provides a framework for simulating human-like strategic interactions with Large Language Model (LLM) agents. |
| Approach: | They propose a framework utilizing Large Language Models (LLM) agents for empirical game theory research. |
| Outcome: | The proposed framework can be used to study human-like strategic interactions with large language model (LLM) agents in a game on the multi-round auction of scarce survival resources. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have a high inference latency stemming from autoregressive decoding. |
| Approach: | They propose a novel decoding paradigm that drafts multiple tokens and verifies them in parallel . they aim to provide a catalyst for further research on Speculative Decoding . |
| Outcome: | The proposed method drafts multiple tokens and verifies them in parallel . it can be used to accelerate inference in large language models. |
Copied to clipboard
| Challenge: | Precisely modeling news and users is critical for news recommendation, and capturing the contexts of words and news is important to learn news and user representations. |
| Approach: | They propose a neural news recommendation approach with multi-head self-attention to model the interactions between words and news and use multi-headed self- attention to capture relatedness between the news. |
| Outcome: | The proposed approach can learn representations from news titles by modeling the interactions between words and users and capture relatedness between the news. |
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: | Strategic reasoning requires Large Language Model (LLM) agents to adapt their strategies dynamically in multi-agent environments. |
| Approach: | They propose a framework that enables Large Language Models to achieve varying levels of strategic depth by recursive mechanisms that allow agents to form higher order beliefs about others' beliefs. |
| Outcome: | The proposed framework enables LLMs to achieve varying levels of strategic depth, allowing agents to form higher order beliefs—beliefs about others’ beliefs. |
Copied to clipboard
| Challenge: | DropHead is a structured dropout method for regularizing multi-head attention . DropHed drops entire attention heads during training to prevent overfitting . |
| Approach: | They propose a structured dropout method specifically designed for regularizing multi-head attention mechanism . DropHead drops entire attention heads during training to prevent overfitting . |
| Outcome: | The proposed method can improve transformer models by 0.9 BLEU score on translation task and around 1.0 accuracy for various text classification tasks. |
Copied to clipboard
| Challenge: | Existing knowledge bases focus on static entities such as people, locations and organizations. |
| Approach: | They propose a new knowledge base resource called EventWiki which concentrates on major events . they show that EventWiki is a very useful resource for information extraction regarding events in NLP . |
| Outcome: | The proposed resource is the first knowledge base resource of major events. |
Copied to clipboard
| Challenge: | a novel information network decipherment paradigm is proposed for fine-grained coordinated cross-lingual text stream alignment. |
| Approach: | They propose to use Burst Information Networks as media to represent text streams . they propose a simple yet effective information network decipherment algorithm with diverse clues . |
| Outcome: | The proposed approach outperforms existing approaches on bilingual lexicon extraction from coordinated text streams and can harvest high-quality alignments from large amounts of streaming data for endless language knowledge mining. |
Copied to clipboard
| Challenge: | Existing studies focus on *broadening* the training set with data augmentation techniques to maximize such benefits. |
| Approach: | They propose a method that embeds problem reflection into each training instance. |
| Outcome: | The proposed method enhances performance in standard and complex scenarios that require reflective thinking. |
Copied to clipboard
| Challenge: | Experimental results show draft-then-verify paradigm can achieve around 5x speedup for the popular Transformer architectures with comparable generation quality to beam search decoding. |
| Approach: | They propose to use Spec-Drafter and Spec Verification to accelerate autoregressive (AR) decoding by combining a model optimized for efficient and accurate drafting and a reliable method for verifying the drafted tokens efficiently. |
| Outcome: | The proposed method achieves 5x speedup on seq2seq tasks with comparable generation quality to beam search decoding, refreshing the impression that draft-then-verify paradigm introduces only 1.4x2x speed up. |
Copied to clipboard
| Challenge: | Chinese and Japanese share many characters with similar surface morphology. |
| Approach: | They propose a Chinese-Japanese pretrained masked language model with a coarse-to-fine training approach to exploit the shared knowledge across the languages. |
| Outcome: | The proposed model is effective on mono- and cross-lingual Chinese and Japanese tasks. |
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: | Reinforcement Learning with Verifiable Reward (RLVR) has significantly advanced the complex reasoning abilities of Large Language Models (LLMs). |
| Approach: | They propose a hybrid-policy optimization approach that synergizes internal exploitation with external data to achieve stronger reasoning capabilities. |
| Outcome: | The proposed approach achieves state-of-the-art performance on six math reasoning benchmarks and superior performance on out-of distribution reasoning tasks. |
Copied to clipboard
| Challenge: | Seq2seq models for grammatical error correction (GEC) have two limitations: (1) a seq2q model may not be well generalized with only limited error-corrected data; (2) a model may fail to completely correct a sentence with multiple errors through normal seq1sequeq inference. |
| Approach: | They propose a fluency boost learning and inference mechanism to improve the performance of seq2seq models for grammatical error correction (GEC) by generating fluency-boost sentence pairs during training. |
| Outcome: | Experiments show that the proposed model improves on both CoNLL-2014 and JFLEG benchmark datasets. |
Copied to clipboard
| Challenge: | Existing approaches to lexical substitution tend to overlook good substitute candidates that are not the synonyms of the target words in the lexicals and fail to take into account the substitution’s influence on the global context of the sentence. |
| Approach: | They propose an end-to-end BERT-based lexical substitution approach which proposes and validates substitute candidates without using annotated data or manually curated resources. |
| Outcome: | The proposed approach performs well in proposing and ranking substitute candidates, achieving the state-of-the-art results in both LS07 and LS14 benchmarks. |
Copied to clipboard
| Challenge: | Recent studies have highlighted a tendency among large language models to refuse to answer benign queries. |
| Approach: | They propose a model-agnostic approach to reduce excessive attention to harmful words like ‘kill’ and a method to decode the next-token predictions by contrastive decoding. |
| Outcome: | The proposed approach reduces the refusal rate by 20% while having little impact on safety. |
Copied to clipboard
| Challenge: | Local sequence transduction tasks involve massive overlapping between source and target sequences . experimental results show that Pseudo-Bidirectional Decoding improves performance of standard seq2seq models. |
| Approach: | They propose a simple but versatile approach for local sequence transduction tasks . they propose to copy source tokens to decoder as pseudo future context . |
| Outcome: | The proposed approach improves the performance of standard seq2seq models on LST tasks. |