Papers by Zhe Zhao
Copied to clipboard
| Challenge: | Structured pruning is a widely used technique for reducing the size of pre-trained language models, but current methods overlook the potential of compressing the hidden dimension d in PLMs. |
| Approach: | They propose a structured pruning approach that projectes features into a space defined by principal components before masking the hidden dimension d in pre-trained language models. |
| Outcome: | Experiments on benchmarks show that SP3 can reduce d by 70%, compress 94% of the BERTbase model, and maintain over 96% accuracy. |
Copied to clipboard
| Challenge: | CLIP revolutes vision-language pretraining by using contrastive learning on paired web data. |
| Approach: | They propose to combine a "adapter ensemble" with traditional machine learning techniques to augment large-scale pretrained vision-language models. |
| Outcome: | The proposed model outperforms baselines and derives improvement when the number of ensemble parameters increases. |
Copied to clipboard
| Challenge: | Despite significant efforts in safety alignment, large language models (LLMs) such as GPT-4 and LLaMA 3 remain vulnerable to jailbreak attacks that can induce harmful behaviors. |
| Approach: | They propose a feature extraction method to extract sample-agnostic features from benign datasets in the form of adversarial suffixes and propose 'suffix maybe features' they show that adversarials generated from jailbreak attacks may contain meaningful features, i.e. appending the same suffix to different prompts results in responses exhibiting specific characteristics. |
| Outcome: | The proposed method extracts sample-agnostic features from benign datasets and shows that they may contain meaningful features. |
Copied to clipboard
| Challenge: | Document-level event argument extraction aims to identify event arguments beyond sentence level, where a significant challenge is to model long-range dependencies. |
| Approach: | They propose a chain reasoning paradigm which captures long-range interdependence due to the chains’ compositional nature and generates decomposable first-order logic rules for reasoning. |
| Outcome: | The proposed method outperforms previous methods on two benchmarks and is robust enough to defend against adversarial attacks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been shown to be useful for building applications, but their use for fixing Android build errors remains underexplored. |
| Approach: | They propose a large-level language model agent with domain-specific tools for inspecting and manipulating the Gradle build environment. |
| Outcome: | The proposed agent outperforms a state-of-the-art coding agent that relies on a general-purpose shell significantly on 184 build errors. |
Copied to clipboard
| Challenge: | Existing retrieval methods struggle to achieve ideal results, a study finds . existing large language models lack prior knowledge of the content of superior legal articles . |
| Approach: | They propose to use a Chinese superior legal article retrieval dataset to find relevant articles with higher legal effectiveness. |
| Outcome: | The proposed dataset shows that existing retrieval methods struggle to achieve ideal results. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) systems focus on improving model performance, ignoring the need to quantify model uncertainty. |
| Approach: | They propose to introduce two uncertainty-guided loss terms to the conventional EDL and a series of uncertainty-guiding training strategies to solve these challenges. |
| Outcome: | The proposed method achieves better OOV/OOD detection performance and generalization ability on OOV entities compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | Existing red-teaming approaches for code generation rely on extensive human effort and are prone to generating malicious code under adversarial environments. |
| Approach: | They propose a red-teaming agent that engages victim models in multi-turn conversations to elicit vulnerable code. |
| Outcome: | Experiments show that RedCoder outperforms red-teaming methods in inducing vulnerabilities in code generation. |
Copied to clipboard
| Challenge: | Existing preference-based reward modeling methods face a recursive dependency where each verifier requires a meta-verifier, leading to continuous and costly dependence on human annotation. |
| Approach: | They propose a dual RM that couples discriminative and generative reward models under a non-parametric meta-reward. |
| Outcome: | The proposed model achieves strong performance across major preference benchmarks and even when trained exclusively on language modality, it exhibits robust cross-modal transfer on Omni-RewardBench. |
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: | PlotGen-Bench evaluates vision-language models' ability to generate executable visualization code from plots under realistic and complex visualization requirements. |
| Approach: | They propose a benchmark to evaluate plot-to-code generation in vision-language models . they use Matplot, Matplos, Mat3D, Mat4D, and Mat4E to evaluate their performance . |
| Outcome: | The proposed benchmark covers 9 major categories, 30 subcategories, and 3 core tasks . it covers 2D, 3D and animated plots across 5 widely used visualization libraries. |
Copied to clipboard
| Challenge: | Existing zero-shot cross-lingual transfer methods rely on parallel corpora or bilingual dictionaries . however, its effect is limited by the gap between embedding clusters of different languages . |
| Approach: | They propose Embedding-Push, Attention-Pull, and Robust targets to transfer English embeddings to virtual multilingual embedders without semantic loss. |
| Outcome: | Experimental results show that the proposed method outperforms existing methods on cross-lingual tasks and can achieve a better multilingual alignment. |
Copied to clipboard
| Challenge: | Existing language evaluation benchmarks for English are limited to English . lack of such benchmarks makes it difficult to replicate success in other languages . |
| Approach: | They introduce a large-scale Chinese language understanding evaluation benchmark . the benchmark uses a set of current state-of-the-art pre-trained Chinese models . |
| Outcome: | The first large-scale Chinese Language Understanding Evaluation (CLUE) benchmark is released . the benchmark evaluates models across a wide range of tasks on original Chinese text . existing language evaluation benchmarks are mostly limited to English . |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are expanding in scale and size, increasing computational costs . large-scale data compression techniques can reduce the size of training datasets while maintaining data integrity. |
| Approach: | They propose a large-scale data compression method to reduce the size of training data . they use a bifurcated quantization strategy to maximize the diversity of samples . |
| Outcome: | The proposed method significantly reduces the size of training data while maximizing the submodular gain. |
Copied to clipboard
| Challenge: | AGENTVIGIL is a black-box optimization framework to exploit indirect prompt injection vulnerabilities . indirect prompts compromise the core of LLM agents by manipulating contextual information rather than direct user prompts. |
| Approach: | They propose a black-box optimization framework to exploit indirect prompt injection vulnerabilities . they use a Monte Carlo tree-based algorithm to iteratively refine inputs . |
| Outcome: | The proposed framework achieves 71% and 70% success rates against two public benchmarks . |
Copied to clipboard
| Challenge: | Existing evaluation methods suffer from cognitive dimensional simplification and methodological unreliability due to the ”LLM-as-a-Judge” approach. |
| Approach: | They propose a six-tiered benchmark that evaluates ASG systems by prioritizing deterministic algorithms and introducing a GRADE approach for abstract abilities. |
| Outcome: | The proposed method provides the ASG field with a systematic, reproducible, and theoretically grounded benchmark to guide future research. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) provide a promising foundation for literature surveys, but guiding them to generate accurate, reliable content remains a fundamental challenge. |
| Approach: | They propose a feedback-driven framework that incorporates feedback across three dimensions: outline feedback for structural clarity, citation feedback for evidence validation, and content feedback for readability and analytical depth. |
| Outcome: | The proposed framework significantly improves both citation and content quality, demonstrating feedback as the critical mechanism for automatic survey generation. |
Copied to clipboard
| Challenge: | Despite significant progress in multimodal language models, it remains unclear whether visual grounding enhances their understanding of embodied knowledge compared to text-only models. |
| Approach: | They propose to assess vision-language models’ perceptual abilities across different sensory modalities through vector comparison and question-answering tasks with over 1,700 questions. |
| Outcome: | The proposed benchmark assesses the models’ perceptual abilities across different sensory modalities through vector comparison and question-answering tasks with over 1,700 questions. |
Copied to clipboard
| Challenge: | Existing methods for quantization of models are too complicated and can cause performance damage. |
| Approach: | They propose a self-adaptive mixed-precision (SAMP) toolkit to automatically control quantization rate by a mixed-presence architecture to balance model accuracy and efficiency. |
| Outcome: | The proposed toolkit has a higher speedup than PyTorch and FasterTransformer while ensuring the required accuracy. |
Copied to clipboard
| Challenge: | Influence functions are important for quantifying the impact of individual training data points on a model’s predictions. |
| Approach: | They conduct a systematic study to address a key question: do influence functions work on large language models? |
| Outcome: | The influence functions perform poorly across multiple tasks and are therefore unsuitable for large language models. |
Copied to clipboard
| Challenge: | Event detection (ED) requires fully labeled and high-quality training data. |
| Approach: | They propose a new trigger localization formulation using contrastive learning to distinguish ground-truth triggers from contexts and show a decent robustness for addressing partial annotation noise. |
| Outcome: | The proposed approach achieves an F1 score of over 60% in an extreme scenario where 90% of events are unlabeled. |
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 defense methods focus on detecting harmful prompts or reducing the likelihood of harmful responses. |
| Approach: | They propose a layer-specific editing method to align LLMs to harmful prompts by supervised fine-tuning and reinforcement learning. |
| Outcome: | The proposed method improves the performance of large language models against jailbreak attacks while maintaining performance on benign prompts. |
Copied to clipboard
| Challenge: | Using a subspace-inspired Low-Rank Adaptation method, large language models can be optimized for downstream tasks using parameter-efficient finetuning. |
| Approach: | They propose a subspace-inspired Low-Rank Adaptation method that decomposes LoRA weights into two subspaces and merges them into the frozen original weight. |
| Outcome: | The proposed method outperforms LoRA on commonsense reasoning, visual instruction tuning, and subject-driven text-to-image generation tasks. |
Copied to clipboard
| Challenge: | Experimental results show the effectiveness of our slot filling model at addressing the OOV problem. |
| Approach: | They propose a generative neural network model for slot filling based on a sequence-to-sequence model and a pointer network. |
| Outcome: | The proposed model is able to predict slot values on spoken language data. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) models often need to be trained with many manual labels to perform well. |
| Approach: | They propose to train named entity recognition systems using heuristic labeling rules . they create a graph with nodes representing candidate rules extracted from unlabeled data . |
| Outcome: | The proposed method achieves an average improvement of +20% over the baseline on three NER datasets. |
Copied to clipboard
| Challenge: | Existing datasets centered around the English language restrict development of Chinese scientific NLP. |
| Approach: | They present a large-scale Chinese scientific literature dataset based on Chinese papers . they use semi-structured data as a natural annotation for many supervised NLP tasks . |
| Outcome: | The proposed dataset can serve as a Chinese corpus and perform many supervised tasks. |
Copied to clipboard
| Challenge: | Current dialogue systems face diverse user requests and rapid change domains, making quickly adapt to scenarios with previous unseen slot types becomes a major challenge. |
| Approach: | They propose an incremental novel slot detection task which separates the dialogue system to deal with novel types as two major phrases: 1) model discovers unknown slots; 2) training model to possess the capability to handle new classes. |
| Outcome: | The proposed approach overcomes catastrophic forgetting during the process of INSD and is highly effective. |
Copied to clipboard
| Challenge: | Existing continual learning methods use data replay, parameter isolation and regularization to mitigate catastrophic forgetting. |
| Approach: | They propose a parameter-efficient continual learning framework that updates parameters offline and then trains using an online regularization method. |
| Outcome: | The proposed framework reduces catastrophic forgetting and saves the model with the changed parameters instead of all parameters. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been used in Knowledge Distillation (KD) to compress large models. |
| Approach: | They propose a Kullback-Leiber divergence method which adaptively allocates weights to combine RKL and FKL to reduce the size of Large Language Models (LLMs). |
| Outcome: | The proposed method outperforms baselines and improves diversity and quality of generated responses. |
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: | Named entity recognition datasets are notorious for their noisy nature due to annotation errors, inconsistencies, and subjective interpretations. |
| Approach: | They propose a method that considers NER as a constituency tree parsing problem and uses a tree-structured Conditional Random Fields with uncertainty evaluation for integration. |
| Outcome: | The proposed model exhibits superb performance even in extreme scenarios with 90% annotation noise. |
Copied to clipboard
| Challenge: | Existing models lack the ability to adhere to instructions, resulting in suboptimal performance. |
| Approach: | They propose an automated iterative instruction-following benchmark with integrated feedback mechanism. |
| Outcome: | The proposed benchmark identifies erroneous components in model responses and provides feedback accurately. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) face a shortage of long-term memory capabilities and limited personalization due to fixed context windows. |
| Approach: | They propose a Memory Operating System to achieve efficient memory management for AI agents . MemoryOS enables hierarchical memory integration and dynamic updating . |
| Outcome: | The proposed architecture enables hierarchical memory integration and dynamic updating. |
Copied to clipboard
| Challenge: | Recent detection methods struggle to capture fine-grained semantic differences, especially for short texts. |
| Approach: | They propose a framework for machine-revised text detection that integrates two modules to enhance discriminative semantic features. |
| Outcome: | The proposed method outperforms existing detectors in identifying machine-revised text across diverse practical scenarios, tasks, and LLMs. |
Copied to clipboard
| Challenge: | Analogical reasoning is effective in capturing linguistic regularities. |
| Approach: | They propose to use Chinese lexical knowledge to build an analogical reasoning task using a large dataset. |
| Outcome: | The proposed dataset proves to be reliable benchmark for evaluating Chinese word embeddings. |
Copied to clipboard
| Challenge: | Large language model editing methods suffer from overfitting, where factual updates can propagate beyond their intended scope, overemphasizing the edited target even when it’s contextually inappropriate. |
| Approach: | They propose a framework for precise and controllable knowledge editing that utilizes two-phase representations and a linear transformation to compute a directional "belief shift" vector. |
| Outcome: | The proposed framework significantly reduces overfitting across nearly all evaluation metrics and on COUNTERFACT and MQuAKE. |
Copied to clipboard
| Challenge: | Existing methods for parameter-efficient finetuning (PEFT) are limited and only finetune a small number of parameters using limited instruction data. |
| Approach: | They propose a method that inserts an adaptation layer into an LLM to integrate embeddings of entities appearing in the input text. |
| Outcome: | The proposed method can activate parameterized knowledge in an LLM without changing its parameters or input prompts. |
Copied to clipboard
| Challenge: | Existing methods to train low-latency multilayer perceptrons (MLPs) on graph tasks are based on graph nodes and lack graph structural information. |
| Approach: | They propose to distill graph structural information from Graph Neural Networks (GNNs) to low-latency multilayer perceptrons (MLPs) on graph tasks. |
| Outcome: | The proposed method does not require graph edges (edge-free setting) yet learns structure-aware MLPs. |
Copied to clipboard
| Challenge: | Knowledge Distillation (KD) is a predominant approach for BERT compression. |
| Approach: | They propose a weight-inherited distillation method which directly transfers knowledge from the teacher to a compact student model by inheriting the weights. |
| Outcome: | The proposed method outperforms state-of-the-art KD-based methods on GLUE and SQUAD benchmarks. |
Copied to clipboard
| Challenge: | Pre-trained language models like BERT have proven to be highly performant, but are often computationally expensive in many practical scenarios. |
| Approach: | They propose a speed-tunable FastBERT with adaptive inference time that can be flexibly adjusted under varying demands. |
| Outcome: | The proposed model achieves promising results in English and Chinese datasets. |
Copied to clipboard
| Challenge: | Existing safeguards relying on pre-filtering or fine-tuning are costly and diminish overall utility. |
| Approach: | They propose a lightweight method that leverages LVLMs’ inherent multimodal alignment for zero-shot toxic image detection. |
| Outcome: | The proposed method achieves a 66.9% defense success rate with only 3.2% false positive rate and 7.2% overhead. |
Copied to clipboard
| Challenge: | Existing Automated Essay Scoring (AES) methods focus on sentence-level features, whereas Large Language Models (LLMs) are sensitive to conventions & accuracy, language complexity, and organization. |
| Approach: | They propose to use large language models to aid in decision-making . they propose to analyze the reasoning of neural models by analyzing sentence-level features. |
| Outcome: | The proposed method improves understanding of neural approaches to Automated Essay Scoring (AES) and can also apply to other domains seeking transparency in model-driven decisions. |