OWAdapt: An adaptive loss function for deep learning using OWA operators

• URL: http://arxiv.org/abs/2305.19443v2
• Date: Thu, 12 Oct 2023 12:02:34 GMT
• Title: OWAdapt: An adaptive loss function for deep learning using OWA operators
• Abstract summary: We propose a fuzzy adaptive loss function for enhancing deep learning performance in classification tasks. Our approach introduces aggregation operators, leveraging the power of fuzzy logic to improve classification accuracy. Our method outperforms other commonly used loss functions, such as the standard cross-entropy or focal loss.
• Score: 0.8437187555622164
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In this paper, we propose a fuzzy adaptive loss function for enhancing deep learning performance in classification tasks. Specifically, we redefine the cross-entropy loss to effectively address class-level noise conditions, including the challenging problem of class imbalance. Our approach introduces aggregation operators, leveraging the power of fuzzy logic to improve classification accuracy. The rationale behind our proposed method lies in the iterative up-weighting of class-level components within the loss function, focusing on those with larger errors. To achieve this, we employ the ordered weighted average (OWA) operator and combine it with an adaptive scheme for gradient-based learning. Through extensive experimentation, our method outperforms other commonly used loss functions, such as the standard cross-entropy or focal loss, across various binary and multiclass classification tasks. Furthermore, we explore the influence of hyperparameters associated with the OWA operators and present a default configuration that performs well across different experimental settings.

Related papers

• Variational Rectification Inference for Learning with Noisy Labels [74.85528327499662]
  We propose variational rectification inference (VRI) to formulate the adaptive rectification for loss functions.<n>VRI is constructed as a hierarchical Bayes by treating the rectifying vector as a latent variable.<n>By introducing the variational term in VRI, the conditional posterior is estimated accurately and avoids collapsing to a Dirac delta function.
  arXiv  Detail & Related papers  (2026-03-18T01:25:08Z)
• SeWA: Selective Weight Average via Probabilistic Masking [51.015724517293236]
  We show that only a few points are needed to achieve better and faster convergence. We transform the discrete selection problem into a continuous subset optimization framework. We derive the SeWA's stability bounds, which are sharper than that under both convex image checkpoints.
  arXiv  Detail & Related papers  (2025-02-14T12:35:21Z)
• Improving GBDT Performance on Imbalanced Datasets: An Empirical Study of Class-Balanced Loss Functions [3.559225731091162]
  This paper presents the first comprehensive study on adapting class-balanced loss functions to three Gradient Boosting Decision Trees (GBDT) algorithms. We conduct extensive experiments on multiple datasets to evaluate the impact of class-balanced losses on different GBDT models. Our results demonstrate the potential of class-balanced loss functions to enhance GBDT performance on imbalanced datasets.
  arXiv  Detail & Related papers  (2024-07-19T15:10:46Z)
• Automated Loss function Search for Class-imbalanced Node Classification [15.384438539835164]
  Class-imbalanced node classification tasks are prevalent in real-world scenarios. We introduce a high-performance, flexible, and generalizable automated loss function search framework to tackle this challenge.
  arXiv  Detail & Related papers  (2024-05-23T03:12:49Z)
• Optimizing for ROC Curves on Class-Imbalanced Data by Training over a Family of Loss Functions [3.06506506650274]
  Training reliable classifiers under severe class imbalance is a challenging problem in computer vision. Recent work has proposed techniques that mitigate the effects of training under imbalance by modifying the loss functions or optimization methods. We propose training over a family of loss functions, instead of a single loss function.
  arXiv  Detail & Related papers  (2024-02-08T04:31:21Z)
• Class-attribute Priors: Adapting Optimization to Heterogeneity and Fairness Objective [54.33066660817495]
  Modern classification problems exhibit heterogeneities across individual classes. We propose CAP: An effective and general method that generates a class-specific learning strategy. We show that CAP is competitive with prior art and its flexibility unlocks clear benefits for fairness objectives beyond balanced accuracy.
  arXiv  Detail & Related papers  (2024-01-25T17:43:39Z)
• Generalized Inter-class Loss for Gait Recognition [11.15855312510806]
  Gait recognition is a unique biometric technique that can be performed at a long distance non-cooperatively. Previous gait works focus more on minimizing the intra-class variance while ignoring the significance in constraining inter-class variance. We propose a generalized inter-class loss which resolves the inter-class variance from both sample-level feature distribution and class-level feature distribution.
  arXiv  Detail & Related papers  (2022-10-13T06:44:53Z)
• Improved Algorithms for Neural Active Learning [74.89097665112621]
  We improve the theoretical and empirical performance of neural-network(NN)-based active learning algorithms for the non-parametric streaming setting. We introduce two regret metrics by minimizing the population loss that are more suitable in active learning than the one used in state-of-the-art (SOTA) related work.
  arXiv  Detail & Related papers  (2022-10-02T05:03:38Z)
• Adaptive Self-supervision Algorithms for Physics-informed Neural Networks [59.822151945132525]
  Physics-informed neural networks (PINNs) incorporate physical knowledge from the problem domain as a soft constraint on the loss function. We study the impact of the location of the collocation points on the trainability of these models. We propose a novel adaptive collocation scheme which progressively allocates more collocation points to areas where the model is making higher errors.
  arXiv  Detail & Related papers  (2022-07-08T18:17:06Z)
• CMW-Net: Learning a Class-Aware Sample Weighting Mapping for Robust Deep Learning [55.733193075728096]
  Modern deep neural networks can easily overfit to biased training data containing corrupted labels or class imbalance. Sample re-weighting methods are popularly used to alleviate this data bias issue. We propose a meta-model capable of adaptively learning an explicit weighting scheme directly from data.
  arXiv  Detail & Related papers  (2022-02-11T13:49:51Z)
• Adversarially Robust Learning via Entropic Regularization [31.6158163883893]
  We propose a new family of algorithms, ATENT, for training adversarially robust deep neural networks. Our approach achieves competitive (or better) performance in terms of robust classification accuracy.
  arXiv  Detail & Related papers  (2020-08-27T18:54:43Z)
• AP-Loss for Accurate One-Stage Object Detection [49.13608882885456]
  One-stage object detectors are trained by optimizing classification-loss and localization-loss simultaneously. The former suffers much from extreme foreground-background imbalance due to the large number of anchors. This paper proposes a novel framework to replace the classification task in one-stage detectors with a ranking task.
  arXiv  Detail & Related papers  (2020-08-17T13:22:01Z)
• Learning Adaptive Loss for Robust Learning with Noisy Labels [59.06189240645958]
  Robust loss is an important strategy for handling robust learning issue. We propose a meta-learning method capable of robust hyper tuning. Four kinds of SOTA loss functions are attempted to be minimization, general availability and effectiveness.
  arXiv  Detail & Related papers  (2020-02-16T00:53:37Z)

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.