Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

107213320426 · Jun 202019922001200920172026
48 results for majority class

The paper extends logistic regression for unbounded majority classes and derives asymptotic properties.

problem Infinitely imbalanced logistic regression inference.
method Derive a second order expansion for slope parameter under unbounded majority class.
result The second order term converges to a normal distribution with a variance depending only on the minority class's mean.

A new oversampling framework generates minority samples by perturbing majority classes.

problem Oversampling in imbalanced classification often neglects majority classes, leading to samples spread across the minority space.
method Introduces a counterfactual objective to generate new minority samples by perturbing majority samples.
result Generated minority samples are near the decision boundary and significantly outperform state-of-the-art methods.

M2m method improves deep learning performance on class-imbalanced datasets.

problem Class imbalance in labeled training datasets causes deep neural networks to generalize poorly to minority classes.
method Augment less-frequent classes by translating samples from more-frequent classes.
result Significantly improves generalization on minority classes compared to existing methods.

Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.

problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.

Paper introduces a new performance metric for class imbalance datasets.

problem Challenges in selecting and comparing models for imbalanced datasets.
method Proposes a new performance measure based on the harmonic mean of Recall and Selectivity normalized in class labels.
result The proposed measure is less sensitive to changes in the majority class and more sensitive to changes in the minority class.

New bounds on majority voting's accuracy for multi-class classification problems.

problem Determining the accuracy of majority voting for multi-class classification.
method Analyzing the majority voting function under different voter conditions and distributions.
result The error rate of majority voting exponentially decays or grows with the number of voters under certain conditions.

Estimates for polynomial operators using determinant majorization and subharmonics.

problem Bounding solutions of polynomial operators on Euclidean domains.
method Combines Alexandrov estimate and determinant majorization, using subharmonics and semiconvex approximation.
result Includes classical Alexandrov-Bakelman-Pucci estimate for linear operators.

RaRecognize learns to recognize rare classes in a stream of data.

problem Learning to recognize rare classes in a continuous stream of data.
method Estimates a general decision boundary, learns individual rare subclasses, flags new subclasses.
result RaRecognize outperforms state-of-the-art baselines on real-world datasets.

Framework learns to transform majority to minority samples for balanced classification.

problem Imbalanced classification leading to biased predictions.
method Minimizes MMD and uses triplet loss for global alignment and boundary awareness.
result Consistent improvements over classical and generative baselines in AUROC, G-mean, F1-score, and MCC.

Image classification datasets are often imbalanced, characteristic that negatively affects the accuracy of deep-learning classifiers. In this work we propose balancing GAN (BAGAN) as an augmentation tool to restore balance in imbalanced datasets. This is challenging because the few minority-class images may not be enou…

2018-03-26abs ↗pdf ↗

Unified approach for federated learning using MM optimization.

problem Scaling stochastic optimization to federated learning.
method Unified Majorize-Minimize (MM) framework for stochastic optimization, extended to federated learning.
result Unified algorithm \QSMM\ for federated learning that aggregates surrogate majorizing functions.

Majority Vote is optimal for reliable data labeling under certain conditions.

problem Reliable data labeling requires aggregating multiple annotators' labels, but the optimality of Majority Vote is not well understood.
method Characterized conditions under which Majority Vote achieves the optimal label estimation error.
result Majority Vote optimally recovers labels for a given class distribution under tolerable annotation noise limits.

Logistic regression is a widely used method in several fields. When applying logistic regression to imbalanced data, for which majority classes dominate over minority classes, all class labels are estimated as `majority class.' In this article, we use an F-measure optimization method to improve the performance of logis…

2019-05-07abs ↗pdf ↗

Paper establishes sufficient condition for comparing linear combinations of infinite-mean risks.

problem Comparing linear combinations of infinite-mean risks under stochastic dominance.
method Introduced a new class of distributions and used majorization order to compare weights.
result Linear combinations of random variables are stochastically larger when their weight vectors are smaller in majorization order.

The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class domains should be used instead of class distributions or densities to construct …

2016-01-18abs ↗pdf ↗

In machine learning, Domain Adaptation (DA) arises when the distribution gen- erating the test (target) data differs from the one generating the learning (source) data. It is well known that DA is an hard task even under strong assumptions, among which the covariate-shift where the source and target distributions diver…

2012-12-11abs ↗pdf ↗

Analysis shows data imbalance slows learning curves for minority and majority classes.

problem Data imbalance impacts learning dynamics and model performance.
method Theoretical analysis of GD and SGD, including per-class normalization.
result Data imbalance causes sub-optimal learning trajectories for minority and majority classes.

Decision trees can be biased towards minority class, contrary to belief.

problem Bias in decision trees towards minority class in imbalanced datasets.
method Critical evaluation of past literature, specific conditions analysis, tree-fitting adjustments, and post-hoc calibration methods.
result Decision trees can be biased towards minority class under specific conditions, not always towards majority.

Model for detecting rare labels in imbalanced crowdsourcing data.

problem Detecting rare labels in imbalanced crowdsourcing data.
method Generative aggregation model combining item difficulty and class-dependent annotator competence.
result Our model achieves the highest minority recall while maintaining competitive balanced accuracy.

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.

LoRAS improves model performance on imbalanced datasets by better oversampling the minority class.

problem Imbalanced datasets lead to poor model performance, especially for the majority class.
method Localized Random Affine Shadowsampling (LoRAS) to oversample minority class data.
result LoRAS generates better ML models in terms of F1-Score and Balanced accuracy compared to SMOTE and its extensions.

Proposes a method to balance imbalanced image datasets using capsule-GAN.

problem Imbalanced datasets challenge deep learning techniques.
method Capsule-GAN, combining GANs and capsule networks, addresses imbalance by generating minority class samples.
result Improves learning from imbalanced data with fewer parameters.

Local semi-supervised method improves brain tissue classification in child MRI.

problem Inaccurate detection of brain tissue classes due to intensity variations in early developing brains.
method Kernel Fisher Discriminant Analysis (KFDA) combined with SSIM for perceptual image quality assessment.
result Optimal brain partitioning into subdomains with different average intensity values and separating surfaces between brain parts.

New bounds for optimal transport using Gaussian processes and rate-distortion functions.

problem Finding bounds for entropic optimal transport with mutual information constraints.
method Lifting technique to construct a Gaussian process and applying the majorizing measure theorem.
result Maximum expected inner product is equivalent to a truncated integral involving the rate-distortion function.

A new graph-based sampling method improves classification of imbalanced COVID-19 datasets.

problem Classification of imbalanced COVID-19 datasets.
method Modified Random Walk Under-sampling based on graphs.
result The method increases the boundary of the minority class without raising outliers.

WDL models density curves using Wasserstein distance and flexible mixture models.

problem Modeling entire distribution and non-negativity constraints.
method Wasserstein distance, Semi-parametric Conditional Gaussian Mixture Models (SCGMM), Majorization-Minimization optimization.
result WDL better characterizes nonlinear dependence of conditional densities.

Paper introduces a new identifiability criterion for DAGs using conditional variances.

problem Challenges in discovering causal relationships from observational data.
method Introduces a novel identifiability criterion for DAGs using conditional variances. Uses weak majorization on Cholesky factor of covariance matrix for learning DAGs.
result Demonstrates effectiveness of the new approach in recovering DAGs through simulations and real data analysis.

In many healthcare settings, intuitive decision rules for risk stratification can help effective hospital resource allocation. This paper introduces a novel variant of decision tree algorithms that produces a chain of decisions, not a general tree. Our algorithm, αα-Carving Decision Chain (ACDC), sequentially carves o…

2016-06-16abs ↗pdf ↗