Active Learning by Acquiring Contrastive Examples

• URL: http://arxiv.org/abs/2109.03764v1
• Date: Wed, 8 Sep 2021 16:40:18 GMT
• Title: Active Learning by Acquiring Contrastive Examples
• Authors: Katerina Margatina, Giorgos Vernikos, Lo\"ic Barrault, Nikolaos Aletras
• Abstract summary: We propose an acquisition function that opts for selecting textitcontrastive examples, i.e. data points that are similar in the model feature space. We compare our approach with a diverse set of acquisition functions in four natural language understanding tasks and seven datasets.
• Score: 8.266097781813656
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Common acquisition functions for active learning use either uncertainty or diversity sampling, aiming to select difficult and diverse data points from the pool of unlabeled data, respectively. In this work, leveraging the best of both worlds, we propose an acquisition function that opts for selecting \textit{contrastive examples}, i.e. data points that are similar in the model feature space and yet the model outputs maximally different predictive likelihoods. We compare our approach, CAL (Contrastive Active Learning), with a diverse set of acquisition functions in four natural language understanding tasks and seven datasets. Our experiments show that CAL performs consistently better or equal than the best performing baseline across all tasks, on both in-domain and out-of-domain data. We also conduct an extensive ablation study of our method and we further analyze all actively acquired datasets showing that CAL achieves a better trade-off between uncertainty and diversity compared to other strategies.

Related papers

• Diversify and Conquer: Diversity-Centric Data Selection with Iterative Refinement [8.509688686402438]
  Finetuning large language models on instruction data is crucial for enhancing pre-trained knowledge and improving instruction-following capabilities. This work addresses the question: How can we determine the optimal subset of data for effective training? Our method employs k-means clustering to ensure the selected subset effectively represents the full dataset.
  arXiv  Detail & Related papers  (2024-09-17T17:25:31Z)
• Active Learning Principles for In-Context Learning with Large Language Models [65.09970281795769]
  This paper investigates how Active Learning algorithms can serve as effective demonstration selection methods for in-context learning. We show that in-context example selection through AL prioritizes high-quality examples that exhibit low uncertainty and bear similarity to the test examples.
  arXiv  Detail & Related papers  (2023-05-23T17:16:04Z)
• Multi-task Bias-Variance Trade-off Through Functional Constraints [102.64082402388192]
  Multi-task learning aims to acquire a set of functions that perform well for diverse tasks. In this paper we draw intuition from the two extreme learning scenarios -- a single function for all tasks, and a task-specific function that ignores the other tasks. We introduce a constrained learning formulation that enforces domain specific solutions to a central function.
  arXiv  Detail & Related papers  (2022-10-27T16:06:47Z)
• DIWIFT: Discovering Instance-wise Influential Features for Tabular Data [29.69737486124891]
  Tabular data is one of the most common data storage formats in business applications, ranging from retail, bank and E-commerce. One of the critical problems in learning tabular data is to distinguish influential features from all the predetermined features. We propose a novel method for discovering instance-wise influential features for tabular data (DIWIFT) Our method minimizes the validation loss on the validation set and is thus more robust to the distribution shift existing in the training dataset and test dataset.
  arXiv  Detail & Related papers  (2022-07-06T16:07:46Z)
• An Empirical Investigation of Commonsense Self-Supervision with Knowledge Graphs [67.23285413610243]
  Self-supervision based on the information extracted from large knowledge graphs has been shown to improve the generalization of language models. We study the effect of knowledge sampling strategies and sizes that can be used to generate synthetic data for adapting language models.
  arXiv  Detail & Related papers  (2022-05-21T19:49:04Z)
• A Lagrangian Duality Approach to Active Learning [119.36233726867992]
  We consider the batch active learning problem, where only a subset of the training data is labeled. We formulate the learning problem using constrained optimization, where each constraint bounds the performance of the model on labeled samples. We show, via numerical experiments, that our proposed approach performs similarly to or better than state-of-the-art active learning methods.
  arXiv  Detail & Related papers  (2022-02-08T19:18:49Z)
• Assessing Data Efficiency in Task-Oriented Semantic Parsing [54.87705549021248]
  We introduce a four-stage protocol which gives an approximate measure of how much in-domain "target" data a requires to achieve a certain quality bar. We apply our protocol in two real-world case studies illustrating its flexibility and applicability to practitioners in task-oriented semantic parsing.
  arXiv  Detail & Related papers  (2021-07-10T02:43:16Z)
• One-Round Active Learning [13.25385227263705]
  One-round active learning aims to select a subset of unlabeled data points that achieve the highest utility after being labeled. We propose DULO, a general framework for one-round active learning based on the notion of data utility functions. Our results demonstrate that while existing active learning approaches could succeed with multiple rounds, DULO consistently performs better in the one-round setting.
  arXiv  Detail & Related papers  (2021-04-23T23:59:50Z)
• Sampling Approach Matters: Active Learning for Robotic Language Acquisition [42.69529080098759]
  We present an exploration of active learning approaches applied to three grounded language problems of varying complexity. We report on how characteristics of the underlying task, along with design decisions such as feature selection and classification model, drive the results.
  arXiv  Detail & Related papers  (2020-11-16T15:18:10Z)
• A Markov Decision Process Approach to Active Meta Learning [24.50189361694407]
  In supervised learning, we fit a single statistical model to a given data set, assuming that the data is associated with a singular task. In meta-learning, the data is associated with numerous tasks, and we seek a model that may perform well on all tasks simultaneously.
  arXiv  Detail & Related papers  (2020-09-10T15:45:34Z)
• Causal Feature Selection for Algorithmic Fairness [61.767399505764736]
  We consider fairness in the integration component of data management. We propose an approach to identify a sub-collection of features that ensure the fairness of the dataset.
  arXiv  Detail & Related papers  (2020-06-10T20:20:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.