Papers by Xiaodong Zhang
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: | a new method for dialogue representation and understanding is proposed . pre-trained language models (PLMs) are inappropriate for dialogue understanding tasks . |
| Approach: | They propose a method that trains pre-trained language models to fit dialogues . they use a hierarchical segment-wise self-attention network to model dialogues more comprehensively . |
| Outcome: | The proposed method outperforms existing models and achieves a 3.3% improvement on average. |
Copied to clipboard
| Challenge: | a novel approach to contrastive learning for language understanding is not fully explored . contrastive training has been widely applied to self-supervised representation learning . |
| Approach: | They propose a label anchored contrastive learning approach for language understanding using a class label. |
| Outcome: | The proposed approach improves on GLUE and CLUE benchmarks by 4.1% compared to the state-of-the-art approaches . the proposed approach also improves under the few-shot and data imbalance settings . |
Copied to clipboard
| Challenge: | Pre-trained language models (LMs) have shown effectiveness in literature understanding tasks, especially when tuned via contrastive learning. |
| Approach: | They propose a multi-task contrastive learning framework that enables common knowledge sharing across different scientific literature understanding tasks while preventing task-specific skills from interfering with each other. |
| Outcome: | The proposed framework outperforms state-of-the-art pre-trained language models on a comprehensive dataset. |
Copied to clipboard
| Challenge: | Existing dialogue state tracking approaches predict the dialogue state of a target turn sequentially based on the ground-truth previous dialogue state. |
| Approach: | They propose a method that predicts dialogue state sequentially based on previous dialogue state . they propose generating a previously “predicted” dialogue state using ground-truth previous dialogue states . |
| Outcome: | The proposed method achieves 67.51%, 68.24%, 70.30%, 71.38%, and 81.27% joint goal accuracy on MultiWOZ 2.0-2.4 datasets. |
Copied to clipboard
| Challenge: | Large language models perform well in offline machine translation when the complete source sentence is provided . however, in many real scenarios, the source tokens arrive in a streaming manner and simultaneous machine translation is required . |
| Approach: | They propose a new paradigm that includes constructing supervised fine-tuning data for simultaneous machine translation (SiMT) to achieve SiMT, source and target tokens are rearranged into interleaved sequences, separated by special tokens according to varying latency requirements. |
| Outcome: | The proposed approach achieves state-of-the-art performance across various SiMT benchmarks and evaluation metrics while maintaining efficient auto-regressive decoding. |
Copied to clipboard
| Challenge: | Existing datasets do not cover documents with complex spatial structures and a lack of spatial information for document entity classification. |
| Approach: | They propose a new spatial bias in attention calculation based on the K-nearest-neighbor graph of document entities that limits entities’ attention to their local radius. |
| Outcome: | The proposed model outperforms baselines in most entity types and is highly parameter-efficient compared to existing methods. |
Copied to clipboard
| Challenge: | Existing methods only consider feature information of entity pairs, but our model exploits both feature information and previous predictions of entity pair. |
| Approach: | They propose a document-level relation extraction model with iterative inference to extract relations between entities from raw texts. |
| Outcome: | The proposed model outperforms existing methods on three commonly-used datasets. |
Copied to clipboard
| Challenge: | Existing methods for explaining "black-box" models such as Influence Functions are becoming more popular. |
| Approach: | They propose a semantic-based evaluation metric that can better align with humans’ judgment of explanations than the widely adopted diagnostic or re-training measures. |
| Outcome: | The proposed method can better align with humans’ judgment of explanations than diagnostic or re-training measures. |
Copied to clipboard
| Challenge: | Prior work has shown that decomposing sentences at different levels of granularity has improved paragraph generation. |
| Approach: | They propose a model for continuous decomposing granularity for neural paraphrase generation that incorporates granules into attention. |
| Outcome: | The proposed model outperforms baseline models on Quora question pairs and Twitter URLs on two benchmarks. |
Copied to clipboard
| Challenge: | Existing methods to reduce memory usage for large language models neglect inter-layer dependency between layers and huge memory consumption in pre-computation. |
| Approach: | They propose a method that compresses the KV cache by layer-wise retaining crucial context. |
| Outcome: | The proposed method reduces memory usage by layer-wise retaining crucial context . it can improve 2.2x throughput compared to Accelerate with over 54% memory reduction . |
Copied to clipboard
| Challenge: | Existing studies on the social simulation of large language model intelligent agents have shown that even expert agents 1 perform significantly worse on challenging social tasks compared to expert agents. |
| Approach: | They propose a framework that dynamically injects a variety of social strategies into expert agents, thereby automating the construction of high-quality social dialogue training corpus. |
| Outcome: | The proposed framework enables the integration of social strategies into language agents and improves their performance on social tasks. |
Copied to clipboard
| Challenge: | Existing approaches to enhance speech translation focus on enhancing knowledge transfer . factors in speech that are not relevant to translation content, such as timbre and rhythm, often limit the efficiency of knowledge transfer. |
| Approach: | They propose a framework that excludes content-agnostic perturbations from speech representations to mitigate their negative impact on ST. |
| Outcome: | The proposed framework significantly improves translation performance across all translation directions in three settings and achieves preeminent performance under a *transcript-free* setting. |
Copied to clipboard
| Challenge: | We present a new information extraction system that can construct temporal event graphs from news documents. |
| Approach: | They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction . |
| Outcome: | The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities. |
Copied to clipboard
| Challenge: | Current dense retrieval methods compute similarities between dense vectors but overlook the real query intents. |
| Approach: | They propose a neuro-symbolic information retrieval method that leverages first-order logic to optimize the embeddings of naive natural language by considering the logical consistency between queries and documents. |
| Outcome: | The proposed method outperforms existing methods on negative-constraint queries under zero-shot and low-resource retrieval tasks. |
Copied to clipboard
| Challenge: | Existing answer selection approaches for community question answering lack additional answer summaries due to redundancy and lengthiness issues of crowdsourced answers. |
| Approach: | They constructed a dataset which contains a corresponding reference summary for each original lengthy answer. |
| Outcome: | The proposed model improves the performance of a question and candidate answer on a WikiHowQA dataset. |
Copied to clipboard
| Challenge: | Existing methods for multi-agent collaboration use a fixed communication graph and manage collaboration structure and shared memory in separate modules. |
| Approach: | They propose a framework that uses an evolving hypergraph topology for multi-agent collaboration. |
| Outcome: | The proposed framework achieves 3.2% to 7.8% accuracy gains over state-of-the-art methods and efficient, reducing token consumption by up to 23.5%. |
Copied to clipboard
| Challenge: | Existing methods for commonsense reasoning rely on human-crafted features and knowledge bases, but unsupervised learning is not feasible due to the lack of labeled training data or comprehensive knowledge bases. |
| Approach: | They propose two unsupervised models based on the Deep Structured Semantic Models framework to tackle two commonsense reasoning tasks: Winograd Schema Challenge (WSC) and Pronoun Disambiguation (PDP). |
| Outcome: | The proposed models capture contextual information in the sentence and co-reference information between pronouns and nouns, and achieve significant improvement over previous state-of-the-art approaches. |
Copied to clipboard
| Challenge: | Entity linking is challenging in high-value domains with myriad entities . standard classification approaches suffer from the annotation bottleneck . |
| Approach: | They propose a self-supervised approach to learn domain knowledge for biomedical entity linking . it generates self-reported mention examples on unlabeled text and trains contextual encoder . |
| Outcome: | The proposed method outperforms existing methods by 20 points in accuracy on biomedical datasets. |
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods to learn representations of knowledge graphs are conceptually simple and can be applied to tasks like factoid question answering (Saxena et al., 2020) and reasoning. |
| Approach: | They propose a Hierarchical Transformer model to jointly learn Entity-relation composition and Relational contextualization based on a source entity’s neighborhood. |
| Outcome: | The proposed model achieves state-of-the-art on multiple link prediction datasets and can be integrated into BERT and demonstrate its effectiveness on two Freebase factoid question answering datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks for understanding and reasoning about entire soft-ware repositories focus on small, self-contained code snippets. |
| Approach: | They propose a repository-level code question answering benchmark to facilitate research on automated QA systems in real-world repositories. |
| Outcome: | The proposed benchmarks are designed to facilitate research on automated QA systems in real-world repositories. |
Copied to clipboard
| Challenge: | Existing routing strategies rely on local token probabilities or post-hoc verification, introducing significant inference overhead. |
| Approach: | They propose a step-wise collaboration framework that generates only the first token of each reasoning step and routes it to a larger model only when initial token entropy exceeds a threshold. |
| Outcome: | The proposed approach reduces inference latency while preserving accuracy. |
Copied to clipboard
| Challenge: | Using customized retrieval models, model transferability and scalability are limited. |
| Approach: | They propose a modular retrieval model where individual modules correspond to key skills that can be reused across datasets. |
| Outcome: | The proposed model outperforms self-supervised retrievers in zero-shot evaluations and achieves state-of-the-art fine-tuned retrieval performance on NQ, HotpotQA and OTT-QA. |
Copied to clipboard
| Challenge: | Existing MWP encoders work in a unimodal setting and map problem description to latent representation, then for decoding. |
| Approach: | They propose a Compositional Math Word Problem Solver which maps problem description to latent representation and decodes it in an interactive way. |
| Outcome: | Extensive experiments show that the proposed model outperforms state-of-the-art models on public benchmarks. |
Copied to clipboard
| Challenge: | Existing non-simultaneous sign language translation methods suffer from inherent inference delays in real-time scenarios. |
| Approach: | They propose an adaptive policy for simultaneous sign language translation that progressively converts incrementally received sign video into its corresponding natural sentence. |
| Outcome: | The proposed policy excels in situations requiring extremely low latency. |
Copied to clipboard
| Challenge: | Experimental results show that MoNET outperforms previous DST methods in alleviating state momentum issues and improving the anti-noise ability. |
| Approach: | They propose to use previous state of each turn in training data as input to learn to predict current state. |
| Outcome: | The proposed model outperforms existing methods on multiWOZ datasets and shows that it can update and correct slot values and improve anti-noise ability. |
Copied to clipboard
| Challenge: | Data augmentation is a critical technique in deep learning. |
| Approach: | They propose a novel text augmentation paradigm leveraging large language models . they incorporate seed text into a context expanded by LLM and ask it to regenerate a variant based on the expanded context. |
| Outcome: | The proposed model generates high-quality and diverse augmented text with a transplant-then-regenerate approach. |
Copied to clipboard
| Challenge: | Existing question answering systems rely on raw text and structured knowledge graphs. |
| Approach: | They build an end-to-end system to answer multiple choice questions with semi-structured tables as its knowledge. |
| Outcome: | The proposed system improves on the state-of-the-art question answering system with tabMCQ dataset. |
Copied to clipboard
| Challenge: | XGLUE provides a benchmark dataset to train large-scale cross-lingual pre-trained models . XCLUE provides 11 diversified tasks that cover both understanding and generation scenarios . |
| Approach: | They introduce a new benchmark dataset to train large-scale cross-lingual pre-trained models using multilingual and bilingual corpora. |
| Outcome: | The proposed dataset is labeled in English and includes only natural language understanding tasks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) heavily rely on high-quality training data, making data valuation crucial for optimizing model performance. |
| Approach: | They propose a third-party data valuation approach that assesses the value of individual data samples and proposes a learning strategy to approximate LinFiK. |
| Outcome: | The proposed approach surpasses baselines in effectiveness and efficiency, showing significant scalability advantages as LLM parameters increase. |
Copied to clipboard
| Challenge: | Multimodal large language models (MLLMs) have made rapid progress in perception and alignment, but their reasoning ability often lags behind strong text-only LLMs. |
| Approach: | They propose a method that transfers reasoning knowledge in the gradient space while preserving multimodal alignment. |
| Outcome: | Experiments on multimodal reasoning benchmarks show that DRIFT outperforms naive merging and standard SFT. |
Copied to clipboard
| Challenge: | Recent researches have explored graph neural network (GNN) techniques on text classification, but they are faced with the problems of fixed corpus level graph structure which don’t support online testing and high memory consumption. |
| Approach: | They propose a graph neural network model that builds graphs for each input text with global parameters sharing instead of a single graph for the whole corpus. |
| Outcome: | The proposed model outperforms existing models on several text classification datasets even with consuming less memory. |
Copied to clipboard
| Challenge: | Existing methods for generating summary from text and image ignore that the image can improve the ability of the encoder to identify highlights of a news event or document. |
| Approach: | They propose a multimodal selective gate network that takes reciprocal relationships between textual and multi-level visual features into account to select highlights of the event. |
| Outcome: | The proposed model can generate summary for a given sentence-image pair using visual signals . it can also capture highlights embedded in the image more accurately, the authors show . |
Copied to clipboard
| Challenge: | Existing studies for sentiment-to-sentiment "translation" only change the underlying sentiment and fail to keep the semantic content. |
| Approach: | They propose a cycled reinforcement learning method that combines neutralization module and emotionalization module. |
| Outcome: | The proposed method outperforms state-of-the-art systems on Yelp and Amazon review datasets. |
Copied to clipboard
| Challenge: | Existing methods to generate human-aligned content with a “jailbreak prompt” are inefficient and repetitive, causing inefficiency and a lack of experience. |
| Approach: | They propose a framework that integrates past attack experiences to aid current jailbreak attempts. |
| Outcome: | The proposed framework improves both attack effectiveness and efficiency compared to the current black-box jailbreak method. |
Copied to clipboard
| Challenge: | Existing benchmarks rarely focus on instruction-following in long-context scenarios or stability on different inputs. |
| Approach: | They propose a scalable dataset to evaluate LLMs’ instruction-following capabilities and stability across long contexts. |
| Outcome: | The proposed method evaluates LLMs’ instruction-following capabilities and stability across long contexts. |
Copied to clipboard
| Challenge: | Existing evaluations of multi-hop question answering systems focus on comparing final answers of reasoning method and given ground-truths. |
| Approach: | They propose a "Planner-Executor-Reasoner" architecture that evaluates reasoning . they propose PER-DP and PER QA architectures that provide ground-truths . |
| Outcome: | The proposed model improves the performance of multi-hop question answering systems. |
Copied to clipboard
| Challenge: | Pre-trained language models have achieved remarkable performance in OpenQA, but for practical deployment, knowledge distillation is crucial to maintain high performance while operating under computational constraints. |
| Approach: | They propose an algorithm to perform unsupervised knowledge distillation without the guidance of labels to achieve 99.5% of performance. |
| Outcome: | The proposed algorithm achieves 99.5% of performance in a commercial question-answering system. |
Copied to clipboard
| Challenge: | Existing methods for sign language translation (SLT) rely on signer identity labels, which is often impractical and costly in real-world applications. |
| Approach: | They propose a signer diversity-driven data augmentation method that can generalize to signers not encountered during training. |
| Outcome: | The proposed method achieves state-of-the-art results without relying on signer identity labels. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have outstanding performance by learning a large number of model parameters on large amounts of data. |
| Approach: | They propose a method of grouping and pruning similar experts to improve the model’s parameter efficiency by a range of natural language tasks. |
| Outcome: | The proposed method outperforms other model pruning methods on a range of natural language tasks. |
Copied to clipboard
| Challenge: | Pruning has become a widely adopted technique for reducing the hardware requirements of large language models (LLMs). |
| Approach: | They propose to use model pruning techniques to maintain high performance while reducing hardware requirements for large language models (LLMs). |
| Outcome: | The proposed model pruning law can be generalized to larger dataset sizes, larger model sizes, and higher pruning rates, offering valuable insights for resource allocation in pruned LLMs. |