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

Trend · papers per month

148297445593 · Jun 202019922001200920172026
48 results for Statistical Classification

We give complete algorithms and source code for constructing (multilevel) statistical industry classifications, including methods for fixing the number of clusters at each level (and the number of levels). Under the hood there are clustering algorithms (e.g., k-means). However, what should we cluster? Correlations? Ret…

2016-07-17abs ↗pdf ↗

Revises GNN neighborhood aggregation for more accurate node classification.

problem Flaws in benchmark GNN models for node classification.
method Statistical signal processing approach to neighborhood aggregation.
result Novel insights for designing more efficient GNN models.

Proposes a new method to improve Bayesian computation accuracy using flexible classification.

problem Bayesian computations accuracy check using rank-based simulation-based calibration has limitations.
method Replaces marginal rank test with a flexible classification approach that learns from data.
result Improves statistical power and provides an interpretable divergence measure of miscalibration.

This work analyzes label embedding for large multiclass classification problems.

problem Label embedding for large multiclass classification problems.
method Analysis of label embedding in extreme multiclass classification, presenting an excess risk bound and showing a trade-off between computational and statistical efficiency.
result The statistical penalty for label embedding vanishes with sufficiently low coherence under the Massart noise condition.

Binary classification is a common statistical learning problem in which a model is estimated on a set of covariates for some outcome indicating the membership of one of two classes. In the literature, there exists a distinction between hard and soft classification. In soft classification, the conditional class probabil…

2014-11-19abs ↗pdf ↗

Dual-stage sEMG classification improves gesture recognition accuracy.

problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.

Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing with the computational burden is via a tree decomposition of the output space. Whil…

2015-11-10abs ↗pdf ↗

The paper proves statistical consistency and fairness guarantees for a plug-in algorithm.

problem Establishing statistical guarantees for fairness-aware binary classification.
method Proves statistical consistency and derives finite sample guarantees for the plug-in algorithm.
result The plug-in algorithm is statistically consistent and guarantees fairness and differential privacy.

Unified framework for set-valued classification tackles ambiguous multi-class datasets.

problem Ambiguous multi-class datasets in modern statistics.
method Unified statistical framework encompassing various set-valued classification formulations.
result Infinite sample optimal strategies and plug-in principle for data-driven algorithms.

Two new undersampling methods improve classification accuracy for imbalanced datasets.

problem Class imbalance and distributional differences in large datasets lead to biased models and poor predictive performance.
method Mutual information-based stratified simple random sampling and support points optimization.
result Empirical results show higher balanced classification accuracy compared to traditional techniques.

Paper tackles class-incremental time series classification with dual-stream feature extraction.

problem Class-incremental continual learning for multivariate time series data.
method Dual-stream feature extraction pipeline combining deep temporal embedding features and statistical features.
result Competitive average accuracy across multiple datasets with low forgetting rates.

We show how binary classification methods developed to work on i.i.d. data can be used for solving statistical problems that are seemingly unrelated to classification and concern highly-dependent time series. Specifically, the problems of time-series clustering, homogeneity testing and the three-sample problem are addr…

2012-10-22abs ↗pdf ↗

Paper provides optimal statistical guarantees for adversarial robustness in Gaussian classification.

problem Understanding statistical risks for adversarial robustness in Gaussian classification models.
method Established minimax lower bounds and designed an efficient estimator for excess risk.
result Optimal minimax guarantees for excess risk under Gaussian mixture model with AdvSNR.

Optimal downsampling improves GLM performance in imbalanced classification.

problem Improving GLM performance in imbalanced classification.
method Proposed a pseudo maximum likelihood estimator for optimal downsampling.
result The introduced estimator outperforms existing alternatives in both synthetic and empirical data.

CuBAS selects informative data points based on curvature for better classification.

problem Lack of efficient sampling strategies for maximizing dataset informativeness.
method Information-geometric framework using curvature scores to select labeled data.
result Consistent and statistically significant improvements over random and uncertainty-based sampling.

Paper connects GLM and LRM for better classification performance.

problem Improving classification performance using statistical inference.
method Derives a statistical test based on SVM and permutation analysis.
result MLE-based inference provides better parameter estimation.

Deep learning architectures have demonstrated state-of-the-art performance for object classification and have become ubiquitous in commercial products. These methods are often applied without understanding (a) the difficulty of a classification task given the input data, and (b) how a specific deep learning architectur…

2019-07-09abs ↗pdf ↗

Statistical uncertainties are rarely incorporated in machine learning algorithms, especially for anomaly detection. Here we present the Bayesian Anomaly Detection And Classification (BADAC) formalism, which provides a unified statistical approach to classification and anomaly detection within a hierarchical Bayesian fr…

2019-02-22abs ↗pdf ↗

This paper examines error bounds for deep learning classifiers with noisy labels.

problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.

We study high-dimensional Gaussian mixture classification using statistical physics methods.

problem Classifying high-dimensional Gaussian mixture with general covariance matrices.
method Replica method from statistical physics for asymptotic analysis of convex classifiers.
result Construction and validation of a de-biased estimator for variable selection.

Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In classification problems there are two general techniques using random projections. T…

2019-11-25abs ↗pdf ↗

The paper develops a statistical theory explaining overfitting in imbalanced classification.

problem Overfitting in high-dimensional imbalanced classification.
method Developed a statistical theory for support vector machines and logistic regression.
result Overfitting is more severe for the minority class due to truncation or skewing effects in high-dimensional data.

New tests for binary classification regression functions without distribution assumptions.

problem Testing regression functions in binary classification without distributional assumptions.
method Conditional kernel mean embeddings and resampling-based framework.
result Distribution-free hypothesis tests with exact type I error control.

Unified platform for statistical and machine learning in bioinformatics.

problem Workflow inefficiencies in using multiple tools for data analysis.
method Automated hyperparameter optimization, feature importance analysis, statistical tests.
result Accelerates biological discovery workflows with methodological soundness.

The paper investigates AI robustness through experiments and statistical analysis.

problem Inaccurate AI predictions can lead to safety and adoption issues.
method Design of experiments framework to study AI classification robustness.
result AI algorithms' robustness is influenced by various factors.

Adapts Neyman-Pearson classification for both source and target distribution shifts.

problem Minimizing errors while controlling both Type-I and Type-II errors under distribution shifts.
method Derives an adaptive procedure that guarantees improved error rates and adapts to uninformative sources.
result Automatic adaptation to uninformative sources avoids negative transfer.

The classification of shapes is of great interest in diverse areas ranging from medical imaging to computer vision and beyond. While many statistical frameworks have been developed for the classification problem, most are strongly tied to early formulations of the problem - with an object to be classified described as …

2019-01-22abs ↗pdf ↗

Defines a similarity measure for classification distributions.

problem Measuring similarity between classification distributions.
method Proposes task similarity, a novel measure quantifying performance of source distributions on target distributions.
result Empirical task similarity correlates with transfer efficiency and semantic similarity of source distributions.

Study shows MDA's effectiveness even when more components are assumed than in actual data.

problem Classification error in overspecified Mixture Discriminant Analysis.
method Two-component Gaussian mixture model, EM algorithm, theoretical analysis of convergence and error rates.
result EM algorithm converges exponentially fast to Bayes risk with suitable initialization.

New statistical theory explains contrastive learning effectiveness.

problem Understanding why contrastive learning works well for representation extraction.
method Developed a new theoretical framework based on approximate sufficient statistics.
result Near-sufficient encoders derived from contrastive learning can be adapted for downstream tasks.

Paper introduces a new method for classifying interval-valued time series.

problem Classification of interval-valued time series.
method Extends point-valued time series imaging methods to interval-valued scenarios using DKD_K-distance and employs deep learning for classification.
result Proposed method achieves superior classification performance compared to existing methods.

This paper improves binary classification methods beyond accuracy, especially in imbalanced datasets.

problem Binary classification performance metrics often fail to reflect real-world consequences, especially in imbalanced datasets.
method Derives a generalized Bayes-optimal classifier from accuracy to any performance metric, removing assumptions and providing finite-sample statistical guarantees.
result Optimal classification performance depends on class imbalance properties, providing new insights and guarantees.

Fitting models for non-Poisson point processes is complicated by the lack of tractable models for much of the data. By using large samples of independent and identically distributed realizations and statistical learning, it is possible to identify absence of fit through finding a classification rule that can efficientl…

2007-12-02abs ↗pdf ↗

For high dimensional data, some of the standard statistical techniques do not work well. So modification or further development of statistical methods are necessary. In this paper, we explore these modifications. We start with the important problem of estimating high dimensional covariance matrix. Then we explore some …

2018-08-08abs ↗pdf ↗

Deep-learning method improves hypothesis testing for independence.

problem Improving hypothesis testing for independence using deep learning.
method Proposes deep-testing, a novel procedure that uses a deep neural network to distinguish between data generated under and outside a given statistical model.
result Deep-testing achieves the highest overall power against nineteen competing methods across various dependence structures.

Paper introduces a new project control method using Monte Carlo and statistical learning.

problem Project control under uncertainty.
method Integrates Earned Value Methodology with Monte Carlo simulation and statistical learning.
result Estimates probabilities of project success and duration.

New method uses contours of segmented images for X-ray classification.

problem Classifying X-ray images of segmented radiography.
method Develops a new approach for image analysis of multivariate planar curves, addressing alignment issues.
result Demonstrates the robustness and appeal of the proposed method through detection of cardiomegaly and numerical experiments.