Contrastive Bootstrapping for Label Refinement

• URL: http://arxiv.org/abs/2306.04544v1
• Date: Wed, 7 Jun 2023 15:49:04 GMT
• Title: Contrastive Bootstrapping for Label Refinement
• Authors: Shudi Hou, Yu Xia, Muhao Chen, Sujian Li
• Abstract summary: We propose a lightweight contrastive clustering-based bootstrapping method to iteratively refine the labels of passages. Experiments on NYT and 20News show that our method outperforms the state-of-the-art methods by a large margin.
• Score: 34.55195008779178
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Traditional text classification typically categorizes texts into pre-defined coarse-grained classes, from which the produced models cannot handle the real-world scenario where finer categories emerge periodically for accurate services. In this work, we investigate the setting where fine-grained classification is done only using the annotation of coarse-grained categories and the coarse-to-fine mapping. We propose a lightweight contrastive clustering-based bootstrapping method to iteratively refine the labels of passages. During clustering, it pulls away negative passage-prototype pairs under the guidance of the mapping from both global and local perspectives. Experiments on NYT and 20News show that our method outperforms the state-of-the-art methods by a large margin.

Related papers

• SelEx: Self-Expertise in Fine-Grained Generalized Category Discovery [55.72840638180451]
  Generalized Category Discovery aims to simultaneously uncover novel categories and accurately classify known ones. Traditional methods, which lean heavily on self-supervision and contrastive learning, often fall short when distinguishing between fine-grained categories. We introduce a novel concept called self-expertise', which enhances the model's ability to recognize subtle differences and uncover unknown categories.
  arXiv  Detail & Related papers  (2024-08-26T15:53:50Z)
• A Generic Method for Fine-grained Category Discovery in Natural Language Texts [38.297873969795546]
  We introduce a method that successfully detects fine-grained clusters of semantically similar texts guided by a novel objective function. The method uses semantic similarities in a logarithmic space to guide sample distributions in the Euclidean space. We also propose a centroid inference mechanism to support real-time applications.
  arXiv  Detail & Related papers  (2024-06-18T23:27:46Z)
• Scribble Hides Class: Promoting Scribble-Based Weakly-Supervised Semantic Segmentation with Its Class Label [16.745019028033518]
  We propose a class-driven scribble promotion network, which utilizes both scribble annotations and pseudo-labels informed by image-level classes and global semantics for supervision. Experiments on the ScribbleSup dataset with different qualities of scribble annotations outperform all the previous methods, demonstrating the superiority and robustness of our method.
  arXiv  Detail & Related papers  (2024-02-27T14:51:56Z)
• Revisiting Foreground and Background Separation in Weakly-supervised Temporal Action Localization: A Clustering-based Approach [48.684550829098534]
  Weakly-supervised temporal action localization aims to localize action instances in videos with only video-level action labels. We propose a novel clustering-based F&B separation algorithm. We evaluate our method on three benchmarks: THUMOS14, ActivityNet v1.2 and v1.3.
  arXiv  Detail & Related papers  (2023-12-21T18:57:12Z)
• Efficient Subclass Segmentation in Medical Images [3.383033695275859]
  One feasible way to reduce the cost is to annotate with coarse-grained superclass labels while using limited fine-grained annotations as a complement. There is a lack of research on efficient learning of fine-grained subclasses in semantic segmentation tasks. Our approach achieves comparable accuracy to a model trained with full subclass annotations, with limited subclass annotations and sufficient superclass annotations.
  arXiv  Detail & Related papers  (2023-07-01T07:39:08Z)
• Weak-shot Semantic Segmentation by Transferring Semantic Affinity and Boundary [23.331708585468814]
  We show that existing fully-annotated base categories can help segment objects of novel categories with only image-level labels. We propose a method under the WSSS framework to transfer semantic affinity and boundary from base categories to novel ones.
  arXiv  Detail & Related papers  (2021-10-04T15:37:25Z)
• Grafit: Learning fine-grained image representations with coarse labels [114.17782143848315]
  This paper tackles the problem of learning a finer representation than the one provided by training labels. By jointly leveraging the coarse labels and the underlying fine-grained latent space, it significantly improves the accuracy of category-level retrieval methods.
  arXiv  Detail & Related papers  (2020-11-25T19:06:26Z)
• Exploring the Hierarchy in Relation Labels for Scene Graph Generation [75.88758055269948]
  The proposed method can improve several state-of-the-art baselines by a large margin (up to $33%$ relative gain) in terms of Recall@50. Experiments show that the proposed simple yet effective method can improve several state-of-the-art baselines by a large margin.
  arXiv  Detail & Related papers  (2020-09-12T17:36:53Z)
• Cooperative Bi-path Metric for Few-shot Learning [50.98891758059389]
  We make two contributions to investigate the few-shot classification problem. We report a simple and effective baseline trained on base classes in the way of traditional supervised learning. We propose a cooperative bi-path metric for classification, which leverages the correlations between base classes and novel classes to further improve the accuracy.
  arXiv  Detail & Related papers  (2020-08-10T11:28:52Z)
• Self-Supervised Tuning for Few-Shot Segmentation [82.32143982269892]
  Few-shot segmentation aims at assigning a category label to each image pixel with few annotated samples. Existing meta-learning method tends to fail in generating category-specifically discriminative descriptor when the visual features extracted from support images are marginalized in embedding space. This paper presents an adaptive framework tuning, in which the distribution of latent features across different episodes is dynamically adjusted based on a self-segmentation scheme.
  arXiv  Detail & Related papers  (2020-04-12T03:53:53Z)

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.