Challenge: Despite recent success of deep neural networks in natural language processing, the extent to which they can demonstrate human-like generalization capacities remains unclear.
Approach: They propose an analysis method to evaluate whether models can draw inferences composed of veridical inference and arbitrary inference types.
Outcome: The proposed model performs poorly on transitivity inference tasks, suggesting it lacks generalization capacity for drawing composite inferences from training examples.

Similar Papers

How well do NLI models capture verb veridicality? (D19-1)

Copied to clipboard

Challenge: In natural language inference, contexts are considered veridical if they allow us to infer that their underlying propositions make true claims about the real world.
Approach: They propose to use a dataset for veridicality evaluation consisting of 1,500 sentence pairs, covering 137 unique verbs.
Outcome: The proposed model learns to make correct inferences about veridicality in verb-complement constructions.
Do Neural Models Learn Systematicity of Monotonicity Inference in Natural Language? (2020.acl-main)

Copied to clipboard

Challenge: Despite the success of language models using neural networks, it remains unclear to what extent neural models have the generalization ability to perform inferences.
Approach: They propose a method to evaluate whether neural models can learn systematicity of monotonicity inference in natural language.
Outcome: The proposed method shows that neural models can perform inferences on unseen combinations of lexical and logical phenomena when syntactic structures are similar between training and test sets.
Probing Linguistic Systematicity (2020.acl-main)

Copied to clipboard

Challenge: Existing evidence that deep natural language understanding models do not learn systematically is lacking.
Approach: They examine whether deep natural language understanding models exhibit systematicity . they find that network architectures can generalize non-systematically .
Outcome: The proposed model generalizes non-systematically, but is unsatisfactory, the authors argue . they show that the current state-of-the-art models do not generalize systematically .
A synthetic data approach for domain generalization of NLI models (2024.acl-long)

Copied to clipboard

Challenge: Natural Language Inference (NLI) datasets are important benchmark tasks for LLMs . however, their realistic performance on out-of-distribution/domain data is less well-understood . a T5-small model trained with our data improves around 7% on average compared to the best alternative dataset .
Approach: They propose a new approach for generating NLI data in diverse domains and lengths . they show that models trained on this data have the best generalization to completely new downstream test settings .
Outcome: The proposed model can be trained on datasets with high-quality examples with meaningful premises and high accuracy.
The Learnability of Model-Theoretic Interpretation Functions in Artificial Neural Networks (2026.findings-acl)

Copied to clipboard

Challenge: Entity vectors improve scores on basic event, while gated architectures benefit most.
Approach: They extend entity-level semantic representations, modern architectures, principled competing event generation, extended systematicity tests and a two-dimensional difficulty analysis disaggregating results by modifier complexity.
Outcome: The proposed model-theoretic interpretation functions generalize systematically to out-of-training-sample sentences.
Systematicity, Compositionality and Transitivity of Deep NLP Models: a Metamorphic Testing Perspective (2022.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on robustness-like metamorphic relations, which limit the scope of linguistic properties they can test.
Approach: They propose three new classes of metamorphic relations which address the properties of systematicity, compositionality and transitivity.
Outcome: The proposed methods show that metamorphic models do not always behave according to expected linguistic properties.
Deep Learning for Natural Language Inference (N19-5)

Copied to clipboard

Challenge: This tutorial discusses cutting-edge research on NLI, including recent advance on dataset development, cutting- edge deep learning models, and highlights from recent research on using NLI to understand capabilities and limits of deep learning for language understanding and reasoning.
Approach: This tutorial discusses cutting-edge research on NLI, including recent advance on dataset development and cutting- edge deep learning models.
Outcome: This tutorial discusses cutting-edge research on NLI, including recent advance on dataset development, cutting- edge deep learning models, and highlights from recent research on using NLI to understand capabilities and limits of deep learning model for language understanding and reasoning.
Deep Latent Variable Models of Natural Language (D18-3)

Copied to clipboard

Challenge: In this tutorial, we will discuss the challenges of applying neural variational inference to NLP problems.
Approach: The tutorial will cover deep latent variable models in the case where exact inference over the latent variables is tractable.
Outcome: The proposed tutorial will cover deep latent variable models in the case where inference cannot be performed tractably and when it is not .
Do Language Models Perform Generalizable Commonsense Inference? (2021.findings-acl)

Copied to clipboard

Challenge: Recent work has applied pretrained language models to populate commonsense knowledge graphs (CKGs) but there is a lack of understanding on their generalization to multiple CKGs, unseen relations, and novel entities.
Approach: They analyze the ability of pretrained language models to perform generalizable commonsense inference in terms of knowledge capacity, transferability and induction.
Outcome: The proposed models can adapt to different schemas defined by multiple CKGs but fail to generalize to new relations.
SETI: Systematicity Evaluation of Textual Inference (2023.findings-acl)

Copied to clipboard

Challenge: Existing pre-trained language models (PLMs) have shown remarkable performance on this task, but little is known about their ability to address compositional generalization.
Approach: They propose a benchmark to evaluate pre-trained language models' systematicity in the domain of textual inference.
Outcome: The proposed benchmark evaluates pre-trained language models on six widely used PLMs.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations