Search Results for author:
Found 15 papers, 9 papers with code
Making Parameter-efficient Tuning More Efficient: A Unified Framework for Classification Tasks
Specifically, we re-formulate both token and sentence classification tasks into a unified language modeling task, and map label spaces of different tasks into the same vocabulary space.
Are Large Language Models Good Prompt Optimizers?
Despite the success, the underlying mechanism of this approach remains unexplored, and the true effectiveness of LLMs as Prompt Optimizers requires further validation.
Making Harmful Behaviors Unlearnable for Large Language Models
Specifically, we introduce ``security vectors'', a few new parameters that can be separated from the LLM, to ensure LLM's responses are consistent with the harmful behavior.
Cross-Linguistic Syntactic Difference in Multilingual BERT: How Good is It and How Does It Affect Transfer?
We demonstrate that the distance between the distributions of different languages is highly consistent with the syntactic difference in terms of linguistic formalisms.
Learning "O" Helps for Learning More: Handling the Concealed Entity Problem for Class-incremental NER
In this work, we conduct an empirical study on the "Unlabeled Entity Problem" and find that it leads to severe confusion between "O" and entities, decreasing class discrimination of old classes and declining the model's ability to learn new classes.
Searching for Optimal Subword Tokenization in Cross-domain NER
Input distribution shift is one of the vital problems in unsupervised domain adaptation (UDA).
Plug-Tagger: A Pluggable Sequence Labeling Framework Using Language Models
Specifically, for each task, a label word set is first constructed by selecting a high-frequency word for each class respectively, and then, task-specific vectors are inserted into the inputs and optimized to manipulate the model predictions towards the corresponding label words.
KNN-BERT: Fine-Tuning Pre-Trained Models with KNN Classifier
Pre-trained models are widely used in fine-tuning downstream tasks with linear classifiers optimized by the cross-entropy loss, which might face robustness and stability problems.
Template-free Prompt Tuning for Few-shot NER
Prompt-based methods have been successfully applied in sentence-level few-shot learning tasks, mostly owing to the sophisticated design of templates and label words.
Backdoor Attacks on Pre-trained Models by Layerwise Weight Poisoning
\textbf{P}re-\textbf{T}rained \textbf{M}odel\textbf{s} have been widely applied and recently proved vulnerable under backdoor attacks: the released pre-trained weights can be maliciously poisoned with certain triggers.
SENT: Sentence-level Distant Relation Extraction via Negative Training
In this work, we propose the use of negative training (NT), in which a model is trained using complementary labels regarding that ``the instance does not belong to these complementary labels".
TextFlint: Unified Multilingual Robustness Evaluation Toolkit for Natural Language Processing
To guarantee user acceptability, all the text transformations are linguistically based, and we provide a human evaluation for each one.
Toward Recognizing More Entity Types in NER: An Efficient Implementation using Only Entity Lexicons
In this work, we explore the way to quickly adjust an existing named entity recognition (NER) system to make it capable of recognizing entity types not defined in the system.
BERT-ATTACK: Adversarial Attack Against BERT Using BERT
Adversarial attacks for discrete data (such as texts) have been proved significantly more challenging than continuous data (such as images) since it is difficult to generate adversarial samples with gradient-based methods.
Simplify the Usage of Lexicon in Chinese NER
This method avoids designing a complicated sequence modeling architecture, and for any neural NER model, it requires only subtle adjustment of the character representation layer to introduce the lexicon information.
Ranked #8 on
Chinese Named Entity Recognition
on Resume NER
Chinese Named Entity Recognition
named-entity-recognition
+2
