Papers with regularizers
Joint Representation Learning of Cross-lingual Words and Entities via Attentive Distant Supervision (D18-1)
Copied to clipboard
| Challenge: | Existing methods for learning word and entity representations in monolingual settings are limited. |
| Approach: | They propose a method for joint representation learning of cross-lingual words and entities that captures mutually complementary knowledge and enables cross-linguistic inferences. |
| Outcome: | The proposed method captures mutually complementary knowledge and enables cross-lingual inferences among knowledge bases and texts. |
Paragraph-level Rationale Extraction through Regularization: A case study on European Court of Human Rights Cases (2021.naacl-main)
Copied to clipboard
Ilias Chalkidis, Manos Fergadiotis, Dimitrios Tsarapatsanis, Nikolaos Aletras, Ion Androutsopoulos, Prodromos Malakasiotis
| Challenge: | Interpretability or explainability is an emerging field of research in NLP . experimental results indicate that the newly introduced task is very challenging . |
| Approach: | They propose to extract rationales as paragraphs in multi-paragraph structured court cases . they also propose a constraint that allows models to be more specific . |
| Outcome: | The proposed task is very challenging and there is a large scope for further research. |
Fine-tuning Pre-trained Language Models for Few-shot Intent Detection: Supervised Pre-training and Isotropization (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent studies show that fine-tuning pre-trained language models with a small set of labeled utterances in a supervised manner is helpful, but it yields an anisotropic feature space, which may suppress the expressive power of the semantic representations. |
| Approach: | They propose to regularize supervised pre-training towards isotropy by contrastive learning and correlation matrix regularizers. |
| Outcome: | The proposed methods improve supervised pre-training by regularizing the feature space towards isotropy. |
System 1 + System 2 = Better World: Neural-Symbolic Chain of Logic Reasoning (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Current NLP models require more than the ability to learn informative representations from data for logic tasks. |
| Approach: | They propose an architecture that explicitly conducts neural logic reasoning on top of the representation learning models. |
| Outcome: | The proposed architecture improves on the commonsense knowledge graph completion task on a commonsensible task with the two-system architecture. |
Learning Disentangled Textual Representations via Statistical Measures of Similarity (2022.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to disentangle a sensitive attribute from textual representations require training and multiple parameter updates. |
| Approach: | They propose a family of regularizers for learning disentangled representations that do not require training. |
| Outcome: | The proposed regularizers are faster and faster and achieve better results when combined with pretrained and randomly initialized text encoders. |
Unsupervised Learning of PCFGs with Normalizing Flow (P19-1)
Copied to clipboard
| Challenge: | Existing induction models unable to incorporate semantics and morphology into induction . current models lack a robust model for generating morphologically rich sentences . |
| Approach: | They propose a PCFG inducer which uses context embeddings to generalize over rare, morphologically rich forms. |
| Outcome: | The proposed model produces grammars with state-of-the-art accuracy on a variety of languages. |
Privacy Regularization: Joint Privacy-Utility Optimization in LanguageModels (2021.naacl-main)
Copied to clipboard
Fatemehsadat Mireshghallah, Huseyin Inan, Marcello Hasegawa, Victor Rühle, Taylor Berg-Kirkpatrick, Robert Sim
| Challenge: | Neural language models have a high capacity for memorization of training samples . however, this can cause privacy degradation and disparate impact on subgroups of users . |
| Approach: | They propose two privacy-preserving regularization methods for training language models that enable joint optimization of utility and privacy. |
| Outcome: | The proposed methods have favorable utility-privacy trade-off, faster training and uniform treatment of under-represented subgroups. |
Text Generation Model Enhanced with Semantic Information in Aspect Category Sentiment Analysis (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for ACSA fail to model relations of target words and opinion words in a sentence including multiple aspects. |
| Approach: | They propose to incorporate AMR into a text generation model to model relations of target words and opinion words in a sentence including multiple aspects. |
| Outcome: | The proposed method outperforms state-of-the-art methods on three datasets. |
The Role of n-gram Smoothing in the Age of Neural Networks (2024.naacl-long)
Copied to clipboard
| Challenge: | n-gram smoothing techniques were used to overcome overfitting problems in neural language models for decades. |
| Approach: | They propose to convert any n-gram smoothing technique into a regularizer compatible with neural language models. |
| Outcome: | The proposed regularizers outperform label smoothing on language modeling and machine translation. |
An Empirical Study of In-context Learning in LLMs for Machine Translation (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent studies focus on optimizing translation quality, with limited attention to understanding specific aspects of ICL that influence the said quality. |
| Approach: | They conduct the first of its kind, exhaustive study of in-context learning for machine translation (MT) they establish that ICL is primarily example-driven and not instruction-driven . |
| Outcome: | The proposed model is based on examples and not instruction-driven learning. |
Time-dependent Entity Embedding is not All You Need: A Re-evaluation of Temporal Knowledge Graph Completion Models under a Unified Framework (2021.emnlp-main)
Copied to clipboard
| Challenge: | Various temporal knowledge graph (KG) completion models have been proposed . knowledge graphs are typically static and store facts in their current state . |
| Approach: | They propose to use temporal embeddings and a score function to model temporal knowledge graphs . they classify the temporal embedded methods into two classes: timestamp and time-dependent . |
| Outcome: | The proposed models outperform current models on ICEWS datasets with 3000 experiments and 13159 GPU hours. |
Stochastic Bridges as Effective Regularizers for Parameter-Efficient Tuning (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for tuning pre-trained language models ignore the running cost and only optimize the terminal cost. |
| Approach: | They propose to use stochastic bridges to regularize intermediate states and use regularization as running cost of PETs. |
| Outcome: | The proposed methods can be used to tune large pre-trained language models . they can be compared to full-parameter fine-tuning by tuning a small number of parameters . |