TKIL improves class-balanced performance in incremental learning.
problem Catastrophic forgetting in sequential learning tasks.
method Introduces Tangent Kernel for Incremental Learning (TKIL) based on Neural Tangent Kernel (NTK).
result TKIL achieves better overall accuracy and variance across classes.
BOSS learns from one labeled sample per class to match fully supervised performance.
problem Achieving fully supervised performance with minimal labeled data.
method Combines class prototype refining, class balancing, and self-training.
result BOSS achieves comparable test accuracies to fully supervised learning.
New approach tackles class imbalance in long-tailed datasets using domain adaptation techniques.
problem Class imbalance in long-tailed datasets leading to poor model performance.
method Proposes a meta-learning approach to estimate differences between class-conditioned distributions.
result Validated approach on six benchmark datasets and three loss functions.
Random Forest variable importance is improved by class balancing techniques.
problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.
A modified GAN improves thermal comfort classification models by balancing imbalanced datasets.
problem Imbalanced thermal comfort datasets make it hard to train accurate models.
method Proposed a modified conditional GAN (comfortGAN) to balance the dataset.
result A balanced dataset trained with comfortGAN yields higher classification accuracy.
CBDA improves active learning for semantic segmentation, especially with imbalanced classes.
problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.
In real-world classification problems, the class balance in the training dataset does not necessarily reflect that of the test dataset, which can cause significant estimation bias. If the class ratio of the test dataset is known, instance re-weighting or resampling allows systematical bias correction. However, learning…
Active learning method balances bias and variance under class imbalance.
problem Active learning under label shift when class proportions differ.
method Mediated Active Learning under Label Shift (MALLS) using a 'medial distribution'.
result MALLS reduces asymptotic sample complexity under arbitrary label shift.
Deep learning classifies autism vs controls with high accuracy using large fMRI dataset.
problem Classification difficulty of autism vs typically developing controls with fMRI data.
method Ensemble CNN model trained on 43,858 fMRI datapoints, employing class-balancing and visualization methods.
result Deep learning models achieve AUROCs of 0.6774, 0.7680, and 0.9222 for ASD vs TD, gender, and task vs rest classifications.
Solutions to Strominger system found for square of Kähler class.
problem Finding solutions to Strominger system with specific balanced classes.
method Deforming Calabi-Yau and Hermitian-Yang-Mills metrics.
result Classes that are squares of Kähler metrics admit solutions.
C-t3VAE improves class representation in long-tailed generative models.
problem Latent geometric bias in VAEs under class imbalance.
method Per-class Student's t-distribution priors, closed-form objective, equal-weight latent mixture.
result Consistently lower FID scores and better class-balanced generation for severely imbalanced datasets.
New algorithm reduces misclassification costs in neural networks.
problem Reduces costs of misclassified instances in neural networks.
method Adaptive Cost-Sensitive Learning (AdaCSL) adjusts loss function to bridge class distribution mismatches.
result Deep neural networks with AdaCSL outperform other methods on cost-sensitive binary classification tasks.
Study shows pre-trained models can handle long-tailed relations well, improving classifier performance.
problem Challenges in long-tailed relation classification due to class imbalance.
method Used instance-balanced sampling to pre-train models and then improved classifier performance through attentive relation routing.
result Robust classifier with attentive relation routing achieves better long-tailed classification ability.
We used convolutional neural networks (CNNs) for automatic sleep stage scoring based on single-channel electroencephalography (EEG) to learn task-specific filters for classification without using prior domain knowledge. We used an openly available dataset from 20 healthy young adults for evaluation and applied 20-fold …
D-CBRS manages memory for continual learning by accounting for intra-class diversity.
problem Forgetting in continual learning, especially with class-imbalanced data.
method D-CBRS introduces a novel approach to store instances in memory, considering intra-class diversity.
result D-CBRS outperforms existing methods on data sets with intra-class diversity.
Study examines how balancing methods affect model behavior in imbalanced classification problems.
problem Impact of balancing methods on model behavior in imbalanced classification problems.
method Used Explainable Artificial Intelligence tools (variable importance method, partial dependence profile, accumulated local effects) to compare model behavior before and after balancing.
result Significant changes in model behavior due to balancing methods, leading to biased models.
AREBA algorithm improves learning from imbalanced, nonstationary data.
problem Learning from imbalanced, nonstationary data in online settings.
method Adaptive REBAlancing (AREBA) algorithm that selectively includes examples to maintain class balance.
result AREBA significantly outperforms other algorithms in learning speed and quality.
IB-GAN improves multivariate time series classification under imbalance.
problem Class imbalance in multivariate time series classification.
method Unified approach combining data augmentation and classification via GANs.
result Significant performance gains for under-observed classes.
Randomizing the Fourier-transform (FT) phases of temporal-spatial data generates surrogates that approximate examples from the data-generating distribution. We propose such FT surrogates as a novel tool to augment and analyze training of neural networks and explore the approach in the example of sleep-stage classificat…
Method improves few-shot one-class classification.
problem Learning binary classifier with data from only one class.
method Modified MAML algorithm to learn initialization for few-shot OCC.
result Method leads to better results than classical approaches.
New model explains neural collapse and limits on minority classes in imbalanced datasets.
problem Understanding and predicting performance limits of deep learning models on imbalanced datasets.
method Layer-Peeled Model, a nonconvex optimization program isolating top layers and applying constraints.
result Reveals a new phenomenon called Minority Collapse that limits deep learning models on minority classes.
The data processing inequality doesn't always hold in practice, showing benefits in low-level tasks.
problem The data processing inequality suggests no benefit in pre-processing for classification.
method Theoretical and empirical study of binary classification setup with deep neural networks.
result Pre-classification processing can improve classification accuracy for any finite number of training samples.
New method improves unsupervised feature learning for natural data.
problem Natural data's correlated and long-tail distribution challenges instance-level contrastive learning.
method Cross-level instance-group discrimination (CLD) to integrate between-instance similarity.
result CLD achieves new state-of-the-art performance on various datasets.
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
Synthetic data augmentation can improve imbalanced classification metrics.
problem Improving imbalanced classification metrics
method Developing a framework for analyzing the effects of synthetic data augmentation on score-based classification
result Augmentation can improve AUROC, AUPRC, balanced accuracy, and F1 score
The choice of normalization affects the coefficients in regularized regression models.
problem The impact of normalization on the coefficients of regularized regression models.
method Investigated lasso, ridge, and elastic net regression with different normalization methods for binary and mixed features.
result Normalization affects the coefficients of regularized regression models, and specific scaling methods can mitigate this effect.
For classification problems with significant class imbalance, subsampling can reduce computational costs at the price of inflated variance in estimating model parameters. We propose a method for subsampling efficiently for logistic regression by adjusting the class balance locally in feature space via an accept-reject …
This paper extends neural collapse to class-imbalanced datasets using an unconstrained ReLU feature model.
problem Understanding neural collapse in class-imbalanced datasets with cross-entropy loss.
method Generalized neural collapse to class-imbalanced settings using an unconstrained ReLU feature model.
result Class-means converge to orthogonal vectors with different lengths, and classifier weights align to these vectors.
Muon optimizes deep learning models on imbalanced data by learning all components equally.
problem Generalization issues in deep learning models on imbalanced data.
method Introduced Spectral Gradient Descent (SpecGD) as a canonical form of Muon and Shampoo, and studied its performance on imbalanced data.
result SpecGD learns all principal components of imbalanced data at equal rates, unlike vanilla GD which prioritizes dominant components.
This paper optimizes performative risk by focusing on convex properties and developing efficient algorithms.
problem Performative risk, the loss experienced by decision makers, is not optimized by stable models.
method Identifying convex properties of loss function and model-induced distribution shift, developing algorithms for optimization.
result Optimization of performative risk with better sample efficiency than generic methods.
Plug-in method improves performative prediction accuracy.
problem Learning under performative feedback with slow convergence rates.
method Plug-in performative optimization using models.
result Plug-in method can be superior to model-agnostic strategies.
We present a new methodology of computing incremental contribution for performance ratios for portfolio like Sharpe, Treynor, Calmar or Sterling ratios. Using Euler's homogeneous function theorem, we are able to decompose these performance ratios as a linear combination of individual modified performance ratios. This a…
The computation of convolution layers in deep neural networks typically rely on high performance routines that trade space for time by using additional memory (either for packing purposes or required as part of the algorithm) to improve performance. The problems with such an approach are two-fold. First, these routines…
New causal models perform poorly when evaluated on biased training sets.
problem Sample selection bias affects the evaluation of causal models' prediction performance.
method Re-evaluated prediction performance of causal models on a genetic perturbation data set, proposing a less-biased evaluation set.
result Causal models have similar or worse performance when evaluated on a less-biased set compared to standard association-based estimators.
A new framework for performative prediction robust to distributional misspecification.
problem Performative prediction models can be influenced by their own predictions, leading to suboptimal outcomes.
method Introduces distributionally robust performative prediction (DRPO) to approximate the true performative optimum (PO) robustly.
result DRPO provides provable guarantees as a robust approximation to the true PO when the nominal distribution map is misspecified.
Study compares Islamic banks' accounting and market performance.
problem Assessing the relationship between Islamic banks' accounting and market performance.
method Selected six Islamic banks, collected data from 2009-2013, used random-effect models.
result Superior accounting performance does not correlate with superior market performance.
The study evaluates AI model performance measures for medical use.
problem Selecting appropriate performance measures for AI models in medical practice.
method Assessed 32 performance measures across five domains for binary outcomes.
result 17 measures are both proper and reflect decision-analytic performance.
SHIFT framework identifies subgroups with large ML model performance decay.
problem Large model performance decay in subgroups when deployed.
method Subgroup-scanning Hierarchical Inference Framework (SHIFT) for performance drift.
result SHIFT identifies interpretable subgroups with large performance decay and suggests targeted actions to mitigate it.
New framework for predicting decisions that influence their own outcomes.
problem Predictions that affect the outcomes they predict, leading to undesirable distribution shift.
method Risk minimization framework combining statistics, game theory, and causality.
result Necessary and sufficient conditions for retraining to converge to a performatively stable point of minimal loss.
The paper explores how machine learning models can be learnable despite label shifts.
problem Learnability of binary classification models in the presence of label shifts.
method Developed a performative empirical risk function that is an unbiased estimate of the true risk on the shifted distribution.
result PAC-learnable hypothesis spaces remain PAC-learnable for performative scenarios.
New approach tackles decision-making under predictions that shape outcomes.
problem Challenges in learning optimal decision rules when predictions influence outcomes.
method Introduces performative omniprediction, a predictor that encodes optimal decision rules for multiple objectives.
result Efficient performative omnipredictors exist under a natural restriction of outcome performativity.
This paper extends performative prediction to nonlinear cases.
problem Performative prediction's effectiveness is limited by linear assumptions in real-world applications.
method Formulated a maximum margin approach loss function and extended it to nonlinear spaces using kernel methods.
result Derived conditions for performative stability in both linear and nonlinear cases.
Learn2Evaluate uses learning curves to estimate high-dimensional prediction performance.
problem Estimating test performance in high-dimensional data settings is challenging.
method Learn2Evaluate uses learning curves to estimate test performance at the total sample size.
result Learn2Evaluate provides a lower confidence bound for performance estimation.
New method improves consistency of reinforcement learning performance evaluations.
problem Inconsistent performance results in reinforcement learning due to flawed evaluation metrics.
method Proposes a new comprehensive evaluation methodology for reinforcement learning algorithms.
result Demonstrates improved reliability of performance measurements for reinforcement learning algorithms.
Machine learning predicts ship performance changes over time.
problem Estimating ship hydrodynamic performance over time.
method Machine learning methods (NL-PCR, NL-PLSR, probabilistic ANN) calibrated with in-service data.
result Probabilistic ANN model performs best in predicting ship performance changes.
Survey of performative prediction, a machine learning setup causing distribution shifts.
problem Machine learning models causing shifts in the environment they predict.
method Classification of performative prediction settings based on distribution map information.
result Introduction of new solution concepts and theoretical analyses.
Proposes a Siamese NN for algorithm selection focusing on alike performing instances.
problem Lack of effective meta-features for algorithm selection via meta-learning.
method Siamese Neural Network architecture with 'Algorithm-Performance Personas' concept.
result Proposed metric outperforms standard performance metrics in training sample selection.
MO-PaDGAN generates diverse, high-performance designs with multiple metrics.
problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.