Improved Multi-label Classification under Temporal Concept Drift: Rethinking Group-Robust Algorithms in a Label-Wise Setting

• URL: http://arxiv.org/abs/2203.07856v1
• Date: Tue, 15 Mar 2022 13:08:03 GMT
• Title: Improved Multi-label Classification under Temporal Concept Drift: Rethinking Group-Robust Algorithms in a Label-Wise Setting
• Abstract summary: In document classification we often deal with hundreds of classes, including very infrequent ones. Class imbalance and drift can sometimes be mitigated by resampling the training data, but what if the target distribution is determined by unknown future events? We evaluate several group-robust optimization algorithms, initially proposed to mitigate group-level disparities. We find that Invariant Risk Minimization and Spectral Decoupling outperform sampling-based approaches to class imbalance and concept drift.
• Score: 10.655403615541141
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In document classification for, e.g., legal and biomedical text, we often deal with hundreds of classes, including very infrequent ones, as well as temporal concept drift caused by the influence of real world events, e.g., policy changes, conflicts, or pandemics. Class imbalance and drift can sometimes be mitigated by resampling the training data to simulate (or compensate for) a known target distribution, but what if the target distribution is determined by unknown future events? Instead of simply resampling uniformly to hedge our bets, we focus on the underlying optimization algorithms used to train such document classifiers and evaluate several group-robust optimization algorithms, initially proposed to mitigate group-level disparities. Reframing group-robust algorithms as adaptation algorithms under concept drift, we find that Invariant Risk Minimization and Spectral Decoupling outperform sampling-based approaches to class imbalance and concept drift, and lead to much better performance on minority classes. The effect is more pronounced the larger the label set.

Related papers

• Class-Grouped Normalized Momentum and Faster Hyperparameter Exploration to Tackle Class Imbalance in Federated Learning [16.216002257704826]
  Class imbalance poses a critical challenge in federated learning (FL), where underrepresented classes suffer from poor predictive performance.<n>We propose FedCGNM, a client-side in FL that partitions classes into a small number of groups based on minimum within-group variance.<n>To efficiently optimize these rates in small-client regimes, we introduce FedHOO, an X-armed-bandit (XAB) based algorithm.
  arXiv  Detail & Related papers  (2026-07-01T21:09:50Z)
• Embedding-perturbed Exploration Preference Optimization for Flow Models [23.146684617048674]
  We propose a novel framework that sustains optimization through embedding-level perturbation.<n>Our method introduces structured, embedding-level perturbations within sample groups, guaranteeing a robust variance.<n>Our approach significantly outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-05-15T09:56:40Z)
• Locally Adaptive Multi-Objective Learning [50.29753546978998]
  We work in an online setting where the data distribution can change arbitrarily over time.<n>Existing approaches to this problem aim to minimize the set of objectives over the entire time horizon.<n>We consider an alternative procedure that achieves local adaptivity by replacing one part of the multi-objective learning method with an adaptive online algorithm.
  arXiv  Detail & Related papers  (2026-02-16T17:31:48Z)
• Empirical risk minimization algorithm for multiclass classification of S.D.E. paths [2.3940819037450987]
  We propose a classification algorithm that relies on the minimization of the L 2 risk. We establish rates of convergence for the resulting predictor. A simulation study highlights the numerical performance of our classification algorithm.
  arXiv  Detail & Related papers  (2025-03-18T09:06:19Z)
• Fair Class-Incremental Learning using Sample Weighting [27.82760149957115]
  We show that naively using all the samples of the current task for training results in unfair catastrophic forgetting for certain sensitive groups including classes. We propose a fair class-incremental learning framework that adjusts the training weights of current task samples to change the direction of the average gradient vector. Experiments show that FSW achieves better accuracy-fairness tradeoff results than state-of-the-art approaches on real datasets.
  arXiv  Detail & Related papers  (2024-10-02T08:32:21Z)
• Group & Reweight: A Novel Cost-Sensitive Approach to Mitigating Class Imbalance in Network Traffic Classification [8.38878965125967]
  This paper focuses on network traffic classification in the presence of severe class imbalance. We design a group & reweight strategy for alleviating class imbalance. Results show that our approach can not only suppress the negative effect of class imbalance but also improve the comprehensive performance in prediction.
  arXiv  Detail & Related papers  (2024-09-28T02:45:14Z)
• Bi-discriminator Domain Adversarial Neural Networks with Class-Level Gradient Alignment [87.8301166955305]
  We propose a novel bi-discriminator domain adversarial neural network with class-level gradient alignment. BACG resorts to gradient signals and second-order probability estimation for better alignment of domain distributions. In addition, inspired by contrastive learning, we develop a memory bank-based variant, i.e. Fast-BACG, which can greatly shorten the training process.
  arXiv  Detail & Related papers  (2023-10-21T09:53:17Z)
• The Cascaded Forward Algorithm for Neural Network Training [61.06444586991505]
  We propose a new learning framework for neural networks, namely Cascaded Forward (CaFo) algorithm, which does not rely on BP optimization as that in FF. Unlike FF, our framework directly outputs label distributions at each cascaded block, which does not require generation of additional negative samples. In our framework each block can be trained independently, so it can be easily deployed into parallel acceleration systems.
  arXiv  Detail & Related papers  (2023-03-17T02:01:11Z)
• Compound Batch Normalization for Long-tailed Image Classification [77.42829178064807]
  We propose a compound batch normalization method based on a Gaussian mixture. It can model the feature space more comprehensively and reduce the dominance of head classes. The proposed method outperforms existing methods on long-tailed image classification.
  arXiv  Detail & Related papers  (2022-12-02T07:31:39Z)
• Interpolation-based Contrastive Learning for Few-Label Semi-Supervised Learning [43.51182049644767]
  Semi-supervised learning (SSL) has long been proved to be an effective technique to construct powerful models with limited labels. Regularization-based methods which force the perturbed samples to have similar predictions with the original ones have attracted much attention. We propose a novel contrastive loss to guide the embedding of the learned network to change linearly between samples.
  arXiv  Detail & Related papers  (2022-02-24T06:00:05Z)
• Envelope Imbalance Learning Algorithm based on Multilayer Fuzzy C-means Clustering and Minimum Interlayer discrepancy [14.339674126923903]
  This paper proposes a deep instance envelope network-based imbalanced learning algorithm with the multilayer fuzzy c-means (MlFCM) and a minimum interlayer discrepancy mechanism based on the maximum mean discrepancy (MIDMD) This algorithm can guarantee high quality balanced instances using a deep instance envelope network in the absence of prior knowledge.
  arXiv  Detail & Related papers  (2021-11-02T04:59:57Z)
• Learning with Multiclass AUC: Theory and Algorithms [141.63211412386283]
  Area under the ROC curve (AUC) is a well-known ranking metric for problems such as imbalanced learning and recommender systems. In this paper, we start an early trial to consider the problem of learning multiclass scoring functions via optimizing multiclass AUC metrics.
  arXiv  Detail & Related papers  (2021-07-28T05:18:10Z)
• Adaptive Sampling for Minimax Fair Classification [40.936345085421955]
  We propose an adaptive sampling algorithm based on the principle of optimism, and derive theoretical bounds on its performance. By deriving algorithm independent lower-bounds for a specific class of problems, we show that the performance achieved by our adaptive scheme cannot be improved in general.
  arXiv  Detail & Related papers  (2021-03-01T04:58:27Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)
• Progressive Identification of True Labels for Partial-Label Learning [112.94467491335611]
  Partial-label learning (PLL) is a typical weakly supervised learning problem, where each training instance is equipped with a set of candidate labels among which only one is the true label. Most existing methods elaborately designed as constrained optimizations that must be solved in specific manners, making their computational complexity a bottleneck for scaling up to big data. This paper proposes a novel framework of classifier with flexibility on the model and optimization algorithm.
  arXiv  Detail & Related papers  (2020-02-19T08:35:15Z)

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.