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

50101151201 · Jun 202019922001200920172026
48 results for classifier confusion

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.

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 ↗

ConfusionFlow visualizes classifier confusion over time for model comparison.

problem Insufficient performance analysis of classifiers.
method Interactive, model-agnostic visualization tool combining confusion matrices and temporal analysis.
result ConfusionFlow facilitates detailed, comparative analysis of classifier performance over time.

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.

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 ↗

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.

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.

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.

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.

Paper proposes MCC to reduce class confusion for versatile DA.

problem Class confusion in DA methods limits their performance across different scenarios.
method Introduces Minimum Class Confusion (MCC) loss function to handle various DA scenarios.
result MCC significantly improves performance on diverse DA scenarios, including Multi-Source and Multi-Target DA.

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.

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 work improves deep learning from noisy crowdsourced labels.

problem Learning label correction and neural classifier from noisy crowdsourced data.
method Coupled Cross-Entropy Minimization (CCEM) with identifiability and regularization.
result The CCEM criterion correctly identifies annotators' confusion and neural classifier under realistic conditions.

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.

Given a binary prediction problem, which performance metric should the classifier optimize? We address this question by formalizing the problem of Metric Elicitation. The goal of metric elicitation is to discover the performance metric of a practitioner, which reflects her innate rewards (costs) for correct (incorrect)…

2018-06-05abs ↗pdf ↗

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.

We propose a framework for constructing and analyzing multiclass and multioutput classification metrics, i.e., involving multiple, possibly correlated multiclass labels. Our analysis reveals novel insights on the geometry of feasible confusion tensors -- including necessary and sufficient conditions for the equivalence…

2019-08-24abs ↗pdf ↗

Research tackles investor confusion in ESG rankings, offering tailored strategies.

problem Widespread confusion among investors regarding ESG rankings.
method Developed ESG ensemble strategies, integrated ESG scores into RL model, proposed Double-Mean-Variance model, introduced ESG-adjusted CAPMs.
result Optimized portfolios that balance financial returns and ESG-focused outcomes.

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 ↗

We introduce a novel method to combat label noise when training deep neural networks for classification. We propose a loss function that permits abstention during training thereby allowing the DNN to abstain on confusing samples while continuing to learn and improve classification performance on the non-abstained sampl…

2019-05-27abs ↗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.

Recent works on adversarial perturbations show that there is an inherent trade-off between standard test accuracy and adversarial accuracy. Specifically, they show that no classifier can simultaneously be robust to adversarial perturbations and achieve high standard test accuracy. However, this is contrary to the stand…

2018-06-07abs ↗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 ↗

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.

Clarifies confusion on feature relevance quantification in explainable AI.

problem Confusion between observational and interventional conditional probabilities in feature relevance quantification.
method Uses Shapley values and clarifies the distinction between observational and interventional conditional probabilities based on Pearl's causality theory.
result Unconditional expectations are the right notion for dropping features, contradicting theoretical justification of SHAP.

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 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.

Faced with distribution shift between training and test set, we wish to detect and quantify the shift, and to correct our classifiers without test set labels. Motivated by medical diagnosis, where diseases (targets) cause symptoms (observations), we focus on label shift, where the label marginal p(y)p(y) changes but the …

2018-02-12abs ↗pdf ↗

The past few decades has seen increased interest in the application of social robots to interventions for Autism Spectrum Disorder as behavioural coaches [4]. We consider that robots embedded in therapies could also provide quantitative diagnostic information by observing patient behaviours. The social nature of ASD sy…

2019-09-09abs ↗pdf ↗

Binary and multiclass epilepsy detection methods using EEG features.

problem Epilepsy diagnosis from EEG data.
method Feature extraction from power spectrum, spectrogram, and bispectrogram; eight machine learning algorithms used.
result Random forest and backpropagation algorithms achieved highest accuracy for binary and multiclass classification.