A review of statistical SSL methods showing improved classifier performance.
problem Forming classifiers from limited labeled data and many unlabeled data.
method Statistical approaches to semi-supervised learning.
result A classifier from partially labeled data can have lower expected error rate.
Optimal kernel sum classifiers analyzed for statistical efficiency.
problem Analyzing the statistical efficiency of optimal kernel sum classifiers.
method Combining optimization tools with learning theory bounds to analyze sample complexity.
result Justifies assumptions in prior work on multiple kernel learning and provides a new form of Rademacher complexity.
New method compares classifiers using GSD-front, addressing statistical uncertainty and robustness.
problem Comparing classifiers with multiple quality metrics and statistical uncertainty.
method Proposes GSD-front and statistical tests for robust comparisons.
result Reliable method for comparing classifiers with statistical uncertainty and robustness.
The article explains how to estimate confusion matrices for classifiers using unlabeled data.
problem Estimating sensitivity and specificity of binary medical diagnostic tests without gold standard tests.
method Modifying diagnostic test solutions to estimate confusion matrices for classifiers on unlabeled data.
result The approach can be used to estimate accuracy statistics for supervised or unsupervised binary classifiers on unlabeled data.
Study controls error rates of binary classifiers using hypothesis testing.
problem Traditional binary classifiers have uncontrolled error rates.
method Combines binary classification with statistical hypothesis testing.
result Trained classifiers can be made to meet target error rate thresholds.
New method bypasses statistical and classifier-based detection of adversarial examples.
problem Vulnerability of deep learning classifiers to adversarial examples.
method Classifier-based adaptation of statistical test method and Logit Mimicry Attack.
result Reduces detection performance to less than 2.2% TPR and 1.6% TPR for statistical test and classifier-based methods, respectively, even at 5% FPR.
The paper classifies Lorentzian Lie groups based on Codazzi tensors and quasi-statistical structures.
problem Classifying Lorentzian Lie groups based on specific tensor properties.
method Classification of three-dimensional Lorentzian Lie groups based on Ricci tensors and quasi-statistical structures associated with different affine connections.
result The paper classifies three-dimensional Lorentzian Lie groups based on Codazzi tensors and quasi-statistical structures associated with Bott, canonical, and Kobayashi-Nomizu connections.
Survey of methods for classifier comparison using precision.
problem Lack of methods for classifier comparison using precision.
method Statistical methods for precision comparison, accounting for inter-precision correlation.
result Methods to test global null hypothesis of model comparison using precision.
THORS converts arbitrary classifiers to cost-sensitive ones efficiently.
problem Making classifiers cost-sensitive without extensive knowledge.
method THORS uses order statistics to find optimal thresholds.
result THORS provides theoretical guarantees and lower time complexity.
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.
Develops theory of homogeneous statistical manifolds and classifies Lie groups.
problem Understanding statistical manifolds and Lie groups.
method Constructs examples and classifies Lie groups using information geometry.
result Explicit examples of homogeneous statistical manifolds of low dimension constructed.
Paper proposes a statistical model for detecting mu-suppression in EEG signals.
problem Detecting mu-suppression in motor imagery EEG signals.
method Proposes a statistical model based on the generalized extreme value distribution (GEV) and a linear classifier.
result Preliminary results show good classification accuracy in detecting mu-suppression and distinguishing EEG events.
Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.
problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.
E-C2ST uses E-values for high-dimensional data two-sample tests.
problem Statistical testing for high-dimensional data.
method Combines split likelihood ratio tests and predictive independence tests, using E-values for anytime-valid sequential tests.
result E-C2ST achieves enhanced statistical power by partitioning datasets into multiple batches.
Rule-based classifiers quantify uncertainty using Bernoulli random variables.
problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.
Random Hyperboxes is a simple yet effective ensemble classifier.
problem Improving classification accuracy using ensemble methods.
method Random subsets of sample and feature spaces are used to train individual hyperbox-based classifiers, which are then combined into an ensemble.
result The proposed classifier outperforms other fuzzy min-max neural networks and ensemble methods on 20 datasets.
Bayesian model compares classifier accuracies across multiple datasets.
problem Shortcomings of null hypothesis significance tests in comparing classifier accuracies.
method Bayesian hierarchical model analyzing cross-validation results.
result Posterior probability of classifier accuracies being equivalent or different.
The stability of statistical analysis is an important indicator for reproducibility, which is one main principle of scientific method. It entails that similar statistical conclusions can be reached based on independent samples from the same underlying population. In this paper, we introduce a general measure of classif…
New correlation measures improve classifier performance assessment.
problem Improving assessment of classifiers and raters.
method Introducing CO-, ANTI-, and COANTI-correlation coefficients.
result Demonstrated new measures are powerful for classifying confusion matrices.
Test assesses if a linear classifier is random or significant.
problem Determining if a linear classifier captures meaningful differences between classes.
method Proposes a homogeneity test related to linear separability, establishes upper bounds for p-values.
result Upper bounds for p-values are highly accurate for normally distributed samples.
A test detects unfairness in machine learning classifiers.
problem Detecting and mitigating algorithmic biases in machine learning.
method Optimal transport theory to quantify and mitigate bias.
result Proposes a statistical test for detecting unfair classifiers.
Method uses aggregate crop statistics to improve satellite-based crop type mapping.
problem Limited field-level crop labels for training satellite-based maps.
method Corrects classifier by accounting for shifts in crop type composition and feature means.
result Substantial improvements in overall classification accuracy, reducing misclassifications by 21.9% on average.
The paper classifies statistical Einstein manifolds in exponential families.
problem Classifying statistical Einstein manifolds in exponential families.
method Deriving partial differential equations for potential functions, obtaining special and group-invariant solutions.
result Special and group-invariant solutions of the equations for potential functions of exponential families.
Bounds on VC dimension for 1NN classifiers with fixed prototype sets.
problem No theoretical results for VC dimension of 1NN classifiers with fixed size prototype sets.
method Collected and used relevant theoretical results to provide explicit lower and upper bounds.
result Explicit lower and upper bounds for VC dimension of 1NN classifiers with fixed prototype set size.
Paper proposes a new method to compare classifiers across multiple datasets.
problem Comparing classifiers over multiple datasets with multiple criteria.
method Adopting decision theory, the paper introduces generalized stochastic dominance for ranking classifiers.
result Generalized stochastic dominance can be used to rank classifiers and statistically tested.
Classifier detects LLM-generated text with guarantees.
problem Detecting fake LLM-generated text to prevent misuse.
method Trained classifier without auxiliary info, distinguishing human and LLM text.
result Achieves higher accuracy than existing detectors with type-I error control.
A framework for prototype-based classifiers in changing data environments.
problem Learning in non-stationary environments with concept drift.
method Analytical methods from statistical physics applied to LVQ systems.
result Basic LVQ algorithms are suitable for non-stationary environments, but weight decay does not improve performance.
A framework assesses the trustworthiness of probabilistic classifiers using local calibration error.
problem Assessing the trustworthiness of probabilistic classifiers beyond traditional metrics.
method I-trustworthy framework linking local calibration to trustworthiness; Kernel Local Calibration Error (KLCE) method for hypothesis testing.
result The effectiveness of the proposed test statistic demonstrated through simulated and real-world datasets.
Tests for classifier independence without ground truth labels.
problem Validation of classifier independence without ground truth labels.
method Exact solution for independent binary classifiers using algebraic geometry.
result Self-consistent test for classifier independence without ground truth labels.
Derives asymptotic generalization error for large-margin classifiers.
problem Understanding the generalization error of large-margin classifiers.
method Statistical physics replica method for deriving asymptotic expression.
result Establishes phase transition boundary for class separability.
Improved outbreak detection using machine learning fusion of statistical algorithms.
problem Balancing detection of outbreaks with false alarms.
method Train a fusion classifier using p-values and additional features.
result Fusion classifier using p-values and additional features improves outbreak detection.
Error bounds based on worst likely assignments use permutation tests to validate classifiers. Worst likely assignments can produce effective bounds even for data sets with 100 or fewer training examples. This paper introduces a statistic for use in the permutation tests of worst likely assignments that improves error b…
The authors argue against the classification of forecasting methods as machine learning or statistical.
problem The classification of forecasting methods as machine learning or statistical limits insights into their appropriateness and effectiveness.
method Alternative characteristics of forecasting methods are proposed to draw meaningful conclusions.
result The distinction between machine learning and statistical forecasting methods is not fundamental.
This paper considers the challenge of evaluating a set of classifiers, as done in shared task evaluations like the KDD Cup or NIST TREC, without expert labels. While expert labels provide the traditional cornerstone for evaluating statistical learners, limited or expensive access to experts represents a practical bottl…
Paper classifies plant electrical signals to identify external stimuli.
problem Classifying external stimuli using plant electrical response.
method Computed 11 statistical features from plant electrical signals and used discriminant analysis.
result Raw electrical signals contain enough information for stimulus classification.
New method uses sequential statistics for classifier parameter estimation without paired data.
problem Removing need for paired input-output data in classification problems.
method Introduces Caesar Cipher analogy and novel loss function for unsupervised learning.
result Estimates classifier parameters using sequential statistics without paired data.
Differentially private fair binary classification algorithm developed.
problem Balancing privacy and fairness in binary classification.
method Decoupling technique for fairness, refinement for differential privacy.
result Algorithm maintains fairness, privacy, and utility guarantees.
CCCDs tackle class imbalance in classification.
problem Class imbalance in statistical classification.
method Class cover catch digraphs (CCCDs) for graph theoretic solutions.
result CCCD classifiers perform well in class imbalance scenarios.
Paper tackles classification without labels using statistical mixtures in collider physics.
problem Training models on imperfect simulations in high energy physics.
method Classification without labels (CWoLa) paradigm, distinguishing statistical mixtures of classes.
result Optimal classifier in CWoLa is also optimal in fully-supervised case.
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.
The φ-sectional curvature of statistical structures on almost contact metric manifolds is always non-positive.
problem Analyzing the φ-sectional curvature of statistical structures on almost contact metric manifolds.
method Investigating the φ-sectional curvature induced by a statistical structure and deriving sufficient conditions.
result The φ-sectional curvature is always non-positive.
Study assesses linear classifiers for virus genotyping and subtyping.
problem Challenges in classifying viral sequences, especially in alignment-free methods.
method Comprehensive evaluation of linear classifiers on HCV genomes, varying parameters and sequence lengths.
result Several classifiers perform well under specific conditions, providing robust assessment.
Online monitoring system for safety classifiers with shift detection and conformal adaptation
problem Detecting and adapting to distributional shifts in deployed safety classifiers
method Calibrated sequential statistics for online monitoring, conformal abstention for adaptation
result 86.6% valid detection with mean latency of 39.5 steps
Subset selection improves weak supervision performance.
problem Optimizing the use of weakly-labeled data.
method Combining pretrained data representations with the cut statistic for subset selection.
result Subset selection improves weak supervision performance by up to 19%.
A novel method classifies shapes by their square-root velocity function.
problem Classifying shapes in infinite-dimensional, curved spaces.
method Square-root velocity function, tangent spaces, principal components, combining pairwise classifiers.
result Improves classification accuracy by separating shapes and reducing dimensionality.
We consider a discriminative learning (regression) problem, whereby the regression function is a convex combination of k linear classifiers. Existing approaches are based on the EM algorithm, or similar techniques, without provable guarantees. We develop a simple method based on spectral techniques and a `mirroring' tr…
Neural networks approximate likelihood ratios for complex models.
problem Difficulty in computing likelihood ratios for modern models.
method Applying the likelihood ratio trick with neural network classifiers.
result Different neural network setups can approximate likelihood ratios with varying performance.
New method reveals good classifiers are common in over-parameterized models.
problem Understanding how over-parameterized models generalize well.
method Developed a methodology to compute the full distribution of test errors.
result Test errors concentrate around a small typical value ε* rather than the worst-case model.