Papers by Yuxian Meng
GNN-SL: Sequence Labeling Based on Nearest Examples via GNN (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing sequence labeling algorithms can be decomposed into two parts . |
| Approach: | They propose a graph neural networks sequence labeling (GNN-SL) that augments the vanilla SL model output with similar tagging examples retrieved from the whole training set. |
| Outcome: | The proposed model performs well on three sequence labeling tasks. |
Is Word Segmentation Necessary for Deep Learning of Chinese Representations? (P19-1)
Copied to clipboard
| Challenge: | Using word-based models, we compare word-oriented models with char-based ones . word-driven models are more vulnerable to data sparsity and the presence of out-of-vocabulary words . |
| Approach: | They benchmark word-based models with char-based model which does not involve word segmentation in four NLP benchmark tasks. |
| Outcome: | The proposed model outperforms char-based models in four NLP benchmark tasks. |
Dependency Parsing as MRC-based Span-Span Prediction (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing address the issue that edges should be constructed at the text span/subtree level rather than word level. |
| Approach: | They propose a method that constructs dependency trees by directly modeling span-span relations by modeling subtree-subtree relationships. |
| Outcome: | The proposed method constructs dependency trees by modeling span-span relations . it can retrieve missing spans in the span proposal stage, which leads to higher recall . |
ConRPG: Paraphrase Generation using Contexts as Regularizer (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for paraphrase generation lack reliable supervision signals. |
| Approach: | They propose an unsupervised paradigm for paraphrase generation based on contextual language models, candidate filtering and paraphrase model training based upon the selected candidates. |
| Outcome: | The proposed paradigm outperforms existing paraphrase generation methods in supervised and unsupervised setups. |
An MRC Framework for Semantic Role Labeling (2022.coling-1)
Copied to clipboard
| Challenge: | Existing work on semantic role labels ignores the semantic connection between the two tasks . et al. (2010) defined two types of semantic roles: core roles and non-core roles. |
| Approach: | They propose to use machine reading comprehension to bridge the gap between these two tasks . they formalize predicate disambiguation as multiple-choice machine reading understanding . |
| Outcome: | The proposed framework achieves state-of-the-art or comparable results to previous work . it uses the descriptions of candidate senses of a given predicate as options to select the correct sense . |
Self Question-answering: Aspect-based Sentiment Analysis by Role Flipped Machine Reading Comprehension (2021.findings-emnlp)
Copied to clipboard
| Challenge: | unified Aspect-based Sentiment Analysis (ABSA) aims to couple aspect terms with their corresponding opinion terms, which might make it easier to predict sentiment polarities. |
| Approach: | They propose a new paradigm to pair aspect terms with their corresponding opinion terms . they propose to use a machine learning paradigm to solve the unified ABSA task . |
| Outcome: | The proposed framework can solve the ABSA task without any additional data annotation or transformation. |
kFolden: k-Fold Ensemble for Out-Of-Distribution Detection (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies studying OOD detection in NLP often rely on external data to diversify model predictions. |
| Approach: | They propose a framework which mimics OOD detection behavior without external data . they take text classification as an archetype and compare them to existing datasets . |
| Outcome: | The proposed framework can resolve in- and out-distribution examples in a natural way using existing datasets. |
Fast Nearest Neighbor Machine Translation (2022.findings-acl)
Copied to clipboard
| Challenge: | Fast kNN-MT uses the entire corpus as the datastore for the nearest neighbor search . knn-MT is two-orders slower than vanilla MT models . |
| Approach: | They propose a fast kNN-MT model that uses the entire corpus as the datastore for nearest neighbor search. |
| Outcome: | The proposed model is two-orders faster than kNN-MT and is only two times slower than the standard model. |
ChineseBERT: Chinese Pretraining Enhanced by Glyph and Pinyin Information (2021.acl-long)
Copied to clipboard
| Challenge: | ChineseBERT model incorporates glyph and pinyin information of Chinese characters into pretraining . proposed model achieves new performance boost over baseline models with fewer training steps . |
| Approach: | They propose a ChineseBERT model that incorporates glyph and pinyin information into pretraining . the glyph embedding is obtained based on different fonts of a character, and the pinyink embeddment characterizes the pronunciation of Chinese characters. |
| Outcome: | The proposed model achieves new performance boosts over baseline models with fewer training steps. |
Paraphrase Generation as Unsupervised Machine Translation (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for paraphrase generation rely on labeled datasets or are limited in narrow domains. |
| Approach: | They propose a paradigm for paraphrase generation by treating the task as unsupervised machine translation based on pairs of unlabeled monolingual sentences. |
| Outcome: | The proposed paradigm can generate paraphrases on a large unlabeled monolingual corpus without relying on bilingual sentence pairs. |
BertGCN: Transductive Text Classification by Combining GNN and BERT (2021.findings-acl)
Copied to clipboard
| Challenge: | Text classification is a core task in natural language processing (NLP) Graph neural networks (GNNs) serve as an effective approach for transductive learning. |
| Approach: | They propose a model that combines large scale pretraining and transductive learning for text classification. |
| Outcome: | The proposed model achieves SOTA performance on a wide range of datasets. |
Triggerless Backdoor Attack for NLP Tasks with Clean Labels (2022.naacl-main)
Copied to clipboard
Leilei Gan, Jiwei Li, Tianwei Zhang, Xiaoya Li, Yuxian Meng, Fei Wu, Yi Yang, Shangwei Guo, Chun Fan
| Challenge: | Backdoor attacks are a new threat to neural natural language processing models due to the fragility and lack of interpretability of NLP models. |
| Approach: | They propose a method to perform backdoor attacks without an external trigger . they propose to use clean-labeled examples to generate poisoned clean-labelled examples . |
| Outcome: | The proposed strategy is effective and hard to defend due to its triggerless nature. |
Layer-wise Model Pruning based on Mutual Information (2021.emnlp-main)
Copied to clipboard
| Challenge: | In spite of impressive results of neural networks, the huge model size has hindered their applications in cases where computation and memory resources are limited. |
| Approach: | They propose a method for layer-wise pruning using mutual information based feature selection in SVMs and logistic regression. |
| Outcome: | The proposed pruning strategy offers greater speedup and higher performance than weight-based pruning methods. |
Sentence Similarity Based on Contexts (2022.tacl-1)
Copied to clipboard
| Challenge: | Existing methods to measure sentence similarity face limited dataset size and training-test gap . existing methods lack large-scale labeled datasets with labeles that are labor-intensive and expensive . |
| Approach: | They propose a framework that measures sentence similarity by comparing probabilities of generating two sentences given the same context. |
| Outcome: | The proposed framework achieves significant performance boosts over baselines under supervised and unsupervised settings. |
Dice Loss for Data-imbalanced NLP Tasks (2020.acl-main)
Copied to clipboard
| Challenge: | Using dice loss, we find that data imbalance is a common issue in many NLP tasks . data imbalance affects the performance of many tasks, such as tagging and machine reading comprehension . |
| Approach: | They propose to use dice loss to replace the standard cross-entropy objective for data-imbalanced NLP tasks. |
| Outcome: | The proposed training objective achieves significant performance boost on a wide range of data imbalanced tasks. |
A Unified MRC Framework for Named Entity Recognition (2020.acl-main)
Copied to clipboard
| Challenge: | Named entity recognition is divided into nested NER and flat NER depending on whether entities are nesting. |
| Approach: | They propose to formulate named entity recognition task as machine reading comprehension task instead of sequence labeling problem . |
| Outcome: | The proposed framework achieves vast amount of performance boost over current models on nested and flat NER datasets. |
Summarize, Outline, and Elaborate: Long-Text Generation via Hierarchical Supervision from Extractive Summaries (2022.coling-1)
Copied to clipboard
| Challenge: | Existing models focus on local word prediction, and cannot make high level plans on what to generate. |
| Approach: | They propose a pipelined system that summarises, outlines and elaborates on each bullet point to generate the corresponding segment. |
| Outcome: | The proposed system produces long texts with significantly better quality and faster convergence speed. |