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

Trend · papers per month

91183274365 · Jun 202019922001200920172026
48 results for class confusion

PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.

problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.

A widespread approach in machine learning to evaluate the quality of a classifier is to cross -- classify predicted and actual decision classes in a confusion matrix, also called error matrix. A classification tool which does not assume distributional parameters but only information contained in the data is based on th…

2019-02-04abs ↗pdf ↗

Data collection and annotation are time-consuming in machine learning, expecially for large scale problem. A common approach for this problem is to transfer knowledge from a related labeled domain to a target one. There are two popular ways to achieve this goal: adversarial learning and self training. In this article, …

2018-10-10abs ↗pdf ↗

Exploits class similarity for better machine learning models with confidence labels and projective loss functions.

problem Poor model performance due to confusing similar classes.
method Exploits class similarity with confidence labels and projective loss functions.
result Improved model performance on noisy labels.

There are a variety of Domain Adaptation (DA) scenarios subject to label sets and domain configurations, including closed-set and partial-set DA, as well as multi-source and multi-target DA. It is notable that existing DA methods are generally designed only for a specific scenario, and may underperform for scenarios th…

2019-12-08abs ↗pdf ↗

EAST aligns neural network classifiers with user-defined evaluation metrics.

problem Mismatch between neural network training and evaluation metrics leads to suboptimal performance.
method EAST uses dynamic thresholding, soft-set confusion matrix, and annealing to align neural network predictions with target evaluation metrics.
result EAST improves alignment between training objectives and evaluation metrics, outperforming existing methods.

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.

Optimizes classification algorithms with bounds on error rates.

problem Bounding uncertainties in classifier outputs for diagnostic testing.
method Set-theoretic and probabilistic arguments to derive uniform error bounds.
result Optimal partition minimizes the largest Gershgorin radius of the confusion matrix.

Unified framework for comparing classification metrics across different imbalance rates.

problem Differences in scale and sensitivity to class imbalance rates in classification metrics.
method Introduces outperformance standardization (OPS) function to map metrics to a common scale.
result Unified o-value metric provides clear comparison across different imbalance rates.

Paper recovers top-two answers and confusion probability in multi-choice crowdsourcing.

problem Recovering top-two answers and confusion probability in multi-choice crowdsourcing tasks.
method Proposes a two-stage inference algorithm based on a model quantifying task difficulty and worker reliability.
result Achieves minimax optimal convergence rate and outperforms other algorithms in synthetic and real data experiments.

Proposes FACT, a diagnostic for understanding group fairness trade-offs.

problem Group fairness notions often conflict with each other, requiring a cost in model performance.
method Characterizes trade-offs via the fairness-confusion tensor and optimizes accuracy and fairness objectives.
result Demonstrates the use of FACT on synthetic and real datasets to understand accuracy-fairness trade-offs.

This paper compares unstructured and structured EM-based semi-supervised learning methods.

problem Semi-supervised learning with EM algorithm for structured prediction.
method Comparative study between unstructured and structured EM-based semi-supervised learning methods.
result Structured EM is more robust to class confusion in flood mapping datasets.

We define a notion of semi-conjugacy between orientation-preserving actions of a group on the circle, which for fixed point free actions coincides with a classical definition of Ghys. We then show that two circle actions are semi-conjugate if and only if they have the same bounded Euler class. This settles some existin…

2014-10-30abs ↗pdf ↗

GS-B3^3SE improves label shift estimation by smoothing priors on a graph.

problem Label shift adaptation when source and target distributions share conditional but not marginal probabilities.
method Graph-Smoothed Bayesian Black-Box Shift Estimator (GS-B3^3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph.
result GS-B3^3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness.

CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.

problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.

Ideally, what confuses neural network should be confusing to humans. However, recent experiments have shown that small, imperceptible perturbations can change the network prediction. To address this gap in perception, we propose a novel approach for learning robust classifier. Our main idea is: adversarial examples for…

2018-10-30abs ↗pdf ↗

Machine learning classification limits estimated using Kullback-Leibler divergence and Cohen's Kappa.

problem Estimating the best possible performance of machine learning classification algorithms.
method Relating Kullback-Leibler divergence to Cohen's Kappa and using the Chernoff-Stein Lemma to estimate error rates.
result Classification algorithms could not have performed any better due to underlying probability density functions for the two classes.

New method quantifies classifier uncertainty, revealing large variability in performance metrics.

problem Uncertainty in classifier performance metrics due to small data sets.
method Probability model of the confusion matrix to quantify uncertainty.
result Large uncertainties in classification performance metrics can lead to misleading conclusions.

This paper investigates how machine learning APIs change over time and proposes an efficient method to monitor these changes.

problem Understanding and assessing changes in machine learning APIs over time.
method Systematic investigation of ML API shifts, proposing a principled adaptive sampling algorithm (MASA) for efficient estimation of confusion matrix shifts.
result MASA can accurately estimate confusion matrix shifts using up to 90% fewer samples compared to random sampling.

Combines human and model predictions for improved accuracy.

problem Improving classification accuracy when both human and model predictions are imperfect.
method Uses confusion matrices and calibration to combine probabilistic model outputs with human class-level predictions.
result Human-model combinations consistently outperform either alone, with accuracy gains even with limited human input.

In the last few years, many different performance measures have been introduced to overcome the weakness of the most natural metric, the Accuracy. Among them, Matthews Correlation Coefficient has recently gained popularity among researchers not only in machine learning but also in several application fields such as bio…

2010-08-17abs ↗pdf ↗

This paper visualizes uncertainty in classifier performance metrics.

problem Overemphasis on model performance metrics risks overlooking uncertainty.
method Developed visualizations of confusion matrix metric distributions.
result Uncertainty in performance metrics can overshadow model differences.

Consistent algorithms for multiclass learning with complex metrics and constraints.

problem Learning with complex performance metrics and constraints.
method General framework for designing consistent algorithms by viewing the problem as an optimization over feasible confusion matrices.
result Rates of convergence to the optimal (feasible) classifier, showing asymptotic consistency.

Several recent deep neural networks experiments leverage the generalist-specialist paradigm for classification. However, no formal study compared the performance of different clustering algorithms for class assignment. In this paper we perform such a study, suggest slight modifications to the clustering procedures, and…

2016-09-13abs ↗pdf ↗

Context: Conducting experiments is central to research machine learning research to benchmark, evaluate and compare learning algorithms. Consequently it is important we conduct reliable, trustworthy experiments. Objective: We investigate the incidence of errors in a sample of machine learning experiments in the domain …

2019-09-10abs ↗pdf ↗

Unified approach optimizes neural network training for various metrics.

problem Training and evaluation of neural network binary classifiers often use different metrics.
method Combines differentiable approximation and probabilistic soft sets.
result Effective in optimizing for metrics like F1-Score across various domains.

Proposes TFDF to learn transferable and discriminative features for unsupervised domain adaptation.

problem Difficult to induce supervised classifier without labeled data in unsupervised domain adaptation.
method TFDF optimizes transferability and discriminability by aligning distributions and minimizing class confusion.
result TFDF achieves better performance on real-world datasets compared to existing methods.

We discuss promising recent contributions on quantifying feature relevance using Shapley values, where we observed some confusion on which probability distribution is the right one for dropped features. We argue that the confusion is based on not carefully distinguishing between observational and interventional conditi…

2019-10-29abs ↗pdf ↗

In the past decades, intensive efforts have been put to design various loss functions and metric forms for metric learning problem. These improvements have shown promising results when the test data is similar to the training data. However, the trained models often fail to produce reliable distances on the ambiguous te…

2018-02-09abs ↗pdf ↗