BCE3S: Binary Cross-Entropy Based Tripartite Synergistic Learning for Long-tailed Recognition

• URL: http://arxiv.org/abs/2511.14097v1
• Date: Tue, 18 Nov 2025 03:30:38 GMT
• Title: BCE3S: Binary Cross-Entropy Based Tripartite Synergistic Learning for Long-tailed Recognition
• Abstract summary: Long-tailed recognition tasks require high intra-class compactness and inter-class separability.<n>Existing methods based on cross-entropy (CE) loss struggle to learn features with desirable properties.<n>We propose a binary cross-entropy (BCE)-based tripartite synergistic learning, termed BCE3S.
• Score: 6.191659600489302
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For long-tailed recognition (LTR) tasks, high intra-class compactness and inter-class separability in both head and tail classes, as well as balanced separability among all the classifier vectors, are preferred. The existing LTR methods based on cross-entropy (CE) loss not only struggle to learn features with desirable properties but also couple imbalanced classifier vectors in the denominator of its Softmax, amplifying the imbalance effects in LTR. In this paper, for the LTR, we propose a binary cross-entropy (BCE)-based tripartite synergistic learning, termed BCE3S, which consists of three components: (1) BCE-based joint learning optimizes both the classifier and sample features, which achieves better compactness and separability among features than the CE-based joint learning, by decoupling the metrics between feature and the imbalanced classifier vectors in multiple Sigmoid; (2) BCE-based contrastive learning further improves the intra-class compactness of features; (3) BCE-based uniform learning balances the separability among classifier vectors and interactively enhances the feature properties by combining with the joint learning. The extensive experiments show that the LTR model trained by BCE3S not only achieves higher compactness and separability among sample features, but also balances the classifier's separability, achieving SOTA performance on various long-tailed datasets such as CIFAR10-LT, CIFAR100-LT, ImageNet-LT, and iNaturalist2018.

Related papers

• Silhouette Loss: Differentiable Global Structure Learning for Deep Representations [0.0]
  We introduce Soft Silhouette Loss, a novel differentiable objective inspired by the classical silhouette coefficient from clustering analysis.<n>Our formulation evaluates each sample against all classes in the batch, providing a batch-level notion of global structure.<n>It can be seamlessly combined with cross-entropy, and is also complementary to supervised contrastive learning.
  arXiv  Detail & Related papers  (2026-03-27T12:11:47Z)
• MatchTIR: Fine-Grained Supervision for Tool-Integrated Reasoning via Bipartite Matching [60.886768806064936]
  Tool-Integrated Reasoning empowers large language models to tackle complex tasks by interleaving reasoning steps with external tool interactions.<n>Existing reinforcement learning methods rely on outcome- or trajectory-level rewards, assigning uniform advantages to all steps within a trajectory.<n>We propose MatchTIR, a framework that introduces fine-grained supervision via bipartite matching-based turn-level reward assignment and dual-level advantage estimation.
  arXiv  Detail & Related papers  (2026-01-15T18:59:23Z)
• DRL: Discriminative Representation Learning with Parallel Adapters for Class Incremental Learning [63.65467569295623]
  We propose the Discriminative Representation Learning (DRL) framework to specifically address these challenges.<n>To conduct incremental learning effectively and yet efficiently, the DRL's network is built upon a PTM.<n>Our DRL consistently outperforms other state-of-the-art methods throughout the entire CIL period.
  arXiv  Detail & Related papers  (2025-10-14T03:19:15Z)
• TRiCo: Triadic Game-Theoretic Co-Training for Robust Semi-Supervised Learning [15.638836465479619]
  TRiCo is a novel triadic game-theoretic co-training framework that rethinks the structure of semi-supervised learning.<n>By addressing key limitations in existing SSL frameworks, TRiCo provides a principled and generalizable solution.
  arXiv  Detail & Related papers  (2025-09-25T20:10:41Z)
• A Generalized Learning Framework for Self-Supervised Contrastive Learning [9.01200351672698]
  Self-supervised contrastive learning (SSCL) has recently demonstrated superiority in multiple downstream tasks.<n>We generalize the standard SSCL methods to a Generalized Learning Framework (GLF) consisting of two parts: the aligning part and the constraining part.
  arXiv  Detail & Related papers  (2025-08-19T08:00:29Z)
• CKAA: Cross-subspace Knowledge Alignment and Aggregation for Robust Continual Learning [80.18781219542016]
  Continual Learning (CL) empowers AI models to continuously learn from sequential task streams.<n>Recent parameter-efficient fine-tuning (PEFT)-based CL methods have garnered increasing attention due to their superior performance.<n>We propose Cross-subspace Knowledge Alignment and Aggregation (CKAA) to enhance robustness against misleading task-ids.
  arXiv  Detail & Related papers  (2025-07-13T03:11:35Z)
• BCE vs. CE in Deep Feature Learning [33.24161955363104]
  We compare binary CE (BCE) and cross-entropy (CE) in deep feature learning.<n>BCE can also maximize the intra-class compactness and inter-class distinctiveness when reaching its minimum.<n>BCE measures the absolute values of decision scores and adjust the positive/negative decision scores across all samples to uniformly high/low levels.
  arXiv  Detail & Related papers  (2025-05-09T06:18:31Z)
• Long-Tail Learning with Rebalanced Contrastive Loss [1.4443576276330394]
  We present Rebalanced Contrastive Learning (RCL), an efficient means to increase the long tail classification accuracy. RCL addresses three main aspects: Feature space balancedness, Intra-Class compactness and Regularization. Our experiments on three benchmark datasets demonstrate the richness of the learnt embeddings and increased top-1 balanced accuracy RCL provides to the BCL framework.
  arXiv  Detail & Related papers  (2023-12-04T09:27:03Z)
• A dual-branch model with inter- and intra-branch contrastive loss for long-tailed recognition [7.225494453600985]
  Models trained on long-tailed datasets have poor adaptability to tail classes and the decision boundaries are ambiguous. We propose a simple yet effective model, named Dual-Branch Long-Tailed Recognition (DB-LTR), which includes an imbalanced learning branch and a Contrastive Learning Branch (CoLB) CoLB can improve the capability of the model in adapting to tail classes and assist the imbalanced learning branch to learn a well-represented feature space and discriminative decision boundary.
  arXiv  Detail & Related papers  (2023-09-28T03:31:11Z)
• Class Anchor Margin Loss for Content-Based Image Retrieval [97.81742911657497]
  We propose a novel repeller-attractor loss that falls in the metric learning paradigm, yet directly optimize for the L2 metric without the need of generating pairs. We evaluate the proposed objective in the context of few-shot and full-set training on the CBIR task, by using both convolutional and transformer architectures.
  arXiv  Detail & Related papers  (2023-06-01T12:53:10Z)
• Semi-supervised Contrastive Learning with Similarity Co-calibration [72.38187308270135]
  We propose a novel training strategy, termed as Semi-supervised Contrastive Learning (SsCL) SsCL combines the well-known contrastive loss in self-supervised learning with the cross entropy loss in semi-supervised learning. We show that SsCL produces more discriminative representation and is beneficial to few shot learning.
  arXiv  Detail & Related papers  (2021-05-16T09:13:56Z)
• Generalized Zero-Shot Learning Via Over-Complete Distribution [79.5140590952889]
  We propose to generate an Over-Complete Distribution (OCD) using Conditional Variational Autoencoder (CVAE) of both seen and unseen classes. The effectiveness of the framework is evaluated using both Zero-Shot Learning and Generalized Zero-Shot Learning protocols.
  arXiv  Detail & Related papers  (2020-04-01T19:05:28Z)

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.