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,742 papers · 148 categories

Trend · papers per month

1345 · Jun 201919922001200920172026
48 results for class-distribution

Friedman's method performs well for estimating class distributions.

problem Estimating prior class probabilities without label observations.
method Friedman's method and DeBias method for designing linear equation systems.
result Friedman's method performs well for binary and multi-class quantification.

Unified approach to non-standard classification tasks.

problem Non-standard classification tasks like semi-supervised, positive-unlabelled, multi-positive-unlabelled and noisy-label learning.
method Probabilistic, unified approach training a classifier to predict label-distributions, then inferring class-distributions.
result Unified model for various non-standard classification tasks.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

Bayesian model explains and improves black-box estimators for class distribution.

problem Calibrating probabilistic classifiers and uncertainty quantification for unlabeled data.
method Introduced a Bayesian model approximating the ground-truth generative process, using efficient MCMC sampling.
result The Bayesian model is competitive and sometimes superior to established point estimators.

New method removes pseudo-label bias for unsupervised domain adaptation.

problem Class imbalance and distribution shift between domains.
method Implicit class-conditioned domain alignment without explicit pseudo-label optimization.
result Effective in handling within-domain class imbalance and between-domain class distribution shift.

Extends uncertainty detection in neural networks to finer distinctions.

problem Detecting finer distinctions between certain, uncertain, and out-of-distribution points.
method Two-step approach: first builds class distribution using Kernel Activation Vectors, second determines test point confidence.
result Corrects overconfident NN decisions and learns to say 'I don't know' when uncertain.

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.

MixMOOD improves SSDL by selecting unlabelled data based on deep feature similarity.

problem Class distribution mismatch in semi-supervised learning.
method MixMOOD uses deep dataset dissimilarity measures to select unlabelled data.
result MixMOOD selects unlabelled data based on strong correlation with MixMatch accuracy.

Learning from class-imbalanced data continues to be a common and challenging problem in supervised learning as standard classification algorithms are designed to handle balanced class distributions. While different strategies exist to tackle this problem, methods which generate artificial data to achieve a balanced cla…

2017-11-02abs ↗pdf ↗

FedReLa: A novel data-level approach for imbalanced federated learning

problem Improving accuracy of federated learning models under class imbalance and data heterogeneity
method Re-labeling samples with a feature-dependent label re-allocator
result Significant improvements in accuracy for minority classes and overall accuracy on stepwise-imbalanced and long-tailed datasets

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 ↗

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Paper relaxes set-valued prediction in hierarchical classification by considering representation complexity.

problem Uncertainty in class labels in hierarchical multi-class classification problems.
method Introduces representation complexity for predicted sets, proposes three methods for inference.
result Recursive tree search method is computationally more efficient.

Paper improves deep learning for instance-level classification from label proportions.

problem Dealing with noisy pseudo-labeling and high-entropy class distributions in LLP.
method Introducing a two-stage training approach with constrained optimization and mixup strategy.
result Significant performance improvement in instance-level classification.

This report examines the Pinned AUC metric introduced and highlights some of its limitations. Pinned AUC provides a threshold-agnostic measure of unintended bias in a classification model, inspired by the ROC-AUC metric. However, as we highlight in this report, there are ways that the metric can obscure different kinds…

2019-03-05abs ↗pdf ↗

The paper addresses classification imbalance by framing it as a transfer learning problem.

problem Classification imbalance where one class is much rarer than the other.
method The paper studies oversampling procedures to balance classes, focusing on SMOTE and bootstrapping.
result The excess risk decomposes into balanced training rate and transfer cost, with SMOTE having a higher transfer cost.

PROTOCOL tackles imbalanced multi-view clustering by enhancing contrastive learning.

problem Class imbalance in real-world multi-view data.
method PROTOCOL uses partial optimal transport to perceive and mitigate imbalance, enhancing contrastive learning.
result PROTOCOL significantly improves clustering performance on imbalanced multi-view data.

New bounds for contrastive learning handle domain shifts and generalization.

problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.

In this work we approach the brain tumor segmentation problem with a cascade of two CNNs inspired in the V-Net architecture \cite{VNet}, reformulating residual connections and making use of ROI masks to constrain the networks to train only on relevant voxels. This architecture allows dense training on problems with hig…

2018-12-30abs ↗pdf ↗

Improved analysis for extreme multi-class CRL with better sample complexity.

problem Theoretical sample complexity of CRL in extreme multi-class settings is poorly understood.
method Improved U-Statistics estimator to capture class concentration, proving O(k)\mathcal{O}(k) sample complexity.
result Sample complexity is O(k)\mathcal{O}(k) for extreme multi-class learning, independent of class distribution.

Study finds optimal vocabulary size for neural machine translation.

problem Imbalanced class distribution in language data affects NMT performance.
method Casts NMT as a classification task, analyzes vocabulary sizes, and tests multiple languages.
result Certain vocabulary sizes outperform others, explaining NMT performance.

A novel method selects genes for high-dimensional gene expression data with class imbalance.

problem Class imbalance in gene expression datasets.
method Synthetic data balancing, greedy search, weighted robust score.
result The proposed method outperforms existing feature selection procedures.

Gynaecologists and obstetricians visually interpret cardiotocography (CTG) traces using the International Federation of Gynaecology and Obstetrics (FIGO) guidelines to assess the wellbeing of the foetus during antenatal care. This approach has raised concerns among professionals with regards to inter- and intra-variabi…

2019-08-06abs ↗pdf ↗

This Colloquium reviews statistical models for money, wealth, and income distributions developed in the econophysics literature since the late 1990s. By analogy with the Boltzmann-Gibbs distribution of energy in physics, it is shown that the probability distribution of money is exponential for certain classes of models…

2009-05-11abs ↗pdf ↗

Study identifies COVID-19 pneumonia from chest X-rays.

problem Identifying COVID-19 pneumonia from other types and healthy lungs using CXR images.
method Proposed a multi-class and hierarchical classification schema using CXR images, texture descriptors, and a pre-trained CNN model. Employed resampling algorithms and early/late fusion techniques.
result Achieved macro-avg F1-Score of 0.65 and F1-Score of 0.89 for COVID-19 identification in hierarchical classification scenario.

Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…

2014-05-09abs ↗pdf ↗

A Siamese Deep Forest (SDF) is proposed in the paper. It is based on the Deep Forest or gcForest proposed by Zhou and Feng and can be viewed as a gcForest modification. It can be also regarded as an alternative to the well-known Siamese neural networks. The SDF uses a modified training set consisting of concatenated pa…

2017-04-27abs ↗pdf ↗

The autoencoder is an artificial neural network model that learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar…

2017-11-21abs ↗pdf ↗

We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble methods, the models produced by the algorithm can be easily interpreted. The algo…

2017-10-26abs ↗pdf ↗

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…

2019-11-17abs ↗pdf ↗

Traditional recognition methods typically require large, artificially-balanced training classes, while few-shot learning methods are tested on artificially small ones. In contrast to both extremes, real world recognition problems exhibit heavy-tailed class distributions, with cluttered scenes and a mix of coarse and fi…

2019-04-09abs ↗pdf ↗

We study the problem of learning representations with controllable connectivity properties. This is beneficial in situations when the imposed structure can be leveraged upstream. In particular, we control the connectivity of an autoencoder's latent space via a novel type of loss, operating on information from persisten…

2019-06-21abs ↗pdf ↗

Study evaluates conformal prediction methods for safety in vision models under shifts and long-tailed data.

problem Safety guarantees of conformal prediction methods under distribution shifts and long-tailed data.
method Empirical evaluation of post-hoc and training-based conformal prediction methods on large-scale datasets and models.
result Performance of conformal prediction methods degrades significantly under distribution shifts and long-tailed data.