Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance, understanding when a classifier's predictions should and should not be trusted has received …
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
48 results for “classifier scores”
Most multi-class classifiers make their prediction for a test sample by scoring the classes and selecting the one with the highest score. Analyzing these prediction scores is useful to understand the classifier behavior and to assess its reliability. We present an interactive visualization that facilitates per-class an…
A new method improves data generation quality by correcting score mismatches.
problem Score mismatch issue in conditional score-based data generation methods.
method Denoising Likelihood Score Matching (DLSM) loss for classifier training.
result The proposed method outperforms previous methods on Cifar-10 and Cifar-100 benchmarks.
This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, a…
Classifies intrinsically linked tournaments by their score sequences.
problem Classifying intrinsically linked tournaments using their score sequences.
method Examining the score sequences of tournaments and identifying linkless sequences.
result The vast majority of score sequences for 8-vertex tournaments are linkless.
Bayesian classifier improves robustness with optimistic score ratio.
problem Limited information on class-conditional distribution.
method Optimistic score ratio for robust binary classification.
result Bayesian classifier using optimistic score ratio is robust and computationally tractable.
Proposes a new scoring function for linear classifiers to improve object positioning in feature space.
problem Lack of information about relative positions of recognized objects in feature space.
method Calculates a scoring function based on object distance from decision boundary and class centroid.
result Demonstrates effectiveness of the proposed method compared to other ensemble algorithms on multiple datasets.
BSAC improves credit scoring models by leveraging autoencoders and addressing imbalanced datasets.
problem Imbalanced and heterogeneous credit scoring datasets.
method Bagging Supervised Autoencoder Classifier (BSAC) that uses autoencoders and undersampling.
result BSAC improves classification of loan applicants, demonstrating robustness and effectiveness.
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…
Proposes a credit scoring system for Aave accounts.
problem Scoring the creditworthiness of DeFi accounts.
method Tree-based binary classifier for predicting delinquency.
result Validated the credit scoring system for Aave accounts.
Although a great methodological effort has been invested in proposing competitive solutions to the class-imbalance problem, little effort has been made in pursuing a theoretical understanding of this matter. In order to shed some light on this topic, we perform, through a novel framework, an exhaustive analysis of the …
Paper introduces a method to evaluate abstaining classifiers by considering missing predictions as counterfactuals.
problem Lack of a principled approach to evaluate and compare abstaining classifiers, especially when missing predictions are important.
method Develops a novel approach to treat abstentions as missing data, defining counterfactual scores and using causal inference methods to estimate them.
result Shows that under certain conditions, counterfactual scores can be identified and estimated efficiently, improving evaluation of abstaining classifiers.
Reduces quantifier variance with accuracy optimization of base classifier.
problem Minimizing quantifier variance under prior probability shift.
method Optimizes the Brier score of a base classifier for training data.
result Optimizing Brier score on training data reduces quantifier variance on test data.
Implementation of an Asymmetric Adjusted Activation Function for Class Imbalance Credit Scoringcs.LG
A new activation function improves credit scoring accuracy for imbalanced datasets.
problem Imbalanced datasets in credit scoring lead to underestimation of misclassification costs.
method Introduces ASIG, an asymmetric adjusted Sigmoid function.
result ASIG-embedded classifier outperforms traditional classifiers across various imbalance ratios.
The reliable measurement of confidence in classifiers' predictions is very important for many applications and is, therefore, an important part of classifier design. Yet, although deep learning has received tremendous attention in recent years, not much progress has been made in quantifying the prediction confidence of…
New metric scores perturbations across populations, not cells, improving model comparison.
problem Single-cell perturbation data overlaps, making per-cell accuracy unreliable.
method Average per-cell probability vectors over all cells of a perturbation to form a population profile and rank candidate perturbations.
result Classifier Discrimination Score (CDS) identifies true perturbation more reliably than pseudobulk-based scores.
In this work, we addressed the issue of combining linear classifiers using their score functions. The value of the scoring function depends on the distance from the decision boundary. Two score functions have been tested and four different combination strategies were investigated. During the experimental study, the pro…
Develops a fair classifier for deep learning models.
problem Ensuring fairness in classification models across different sub-populations.
method Applies Rawlsian principles to minimize error rate on the worst-off sub-population.
result Introduces a practical method to adapt any black-box deep learning model to be fair.
Detects changes in classifier scores to identify shifts in class priors.
problem Label shift changes in classification data.
method Sequential changepoint detection of classifier scores.
result Outperforms other detection procedures in label shift settings.
Improved conformal prediction for better conditional coverage of classifier predictions.
problem Achieving exact conditional coverage in finite samples for prediction sets.
method Developed a variant of conformal prediction targeting coverage conditional on confidence and trust score.
result Empirically improved conditional coverage properties compared to standard conformal prediction.
INK scores improve OOD detection for classifiers.
problem Detecting out-of-distribution inputs for classification models.
method INK scores operate on constrained latent embeddings modeled as a mixture of hyperspherical embeddings, optimizing in modern neural networks.
result INK establishes a new state-of-the-art in OOD detection.
Proposes a stable classifier using inflated argmax for multiclass classification.
problem Inherent instability of taking the maximizer in multiclass classification.
method Bagging for stable continuous scores, inflated argmax for stable labels.
result Inflated argmax provides necessary protection against unstable classifiers without loss of accuracy.
Score-based generative models achieve state-of-the-art classification accuracy on CIFAR-10.
problem Improving classification accuracy on natural image datasets.
method Score-based generative models applied to CIFAR-10.
result Score-based models achieve state-of-the-art classification accuracy on CIFAR-10.
Proposes a new method to measure classifier robustness.
problem Measuring robustness of classifiers is crucial but challenging.
method Weighting sample importance based on difficulty and using logistic regression as a theoretical case study.
result The proposed score is independent of sample choice and measures robustness effectively.
Enhances multi-tag classification using low-dimensional vector representations and virtual data.
problem Improving the performance of multi-tag classifiers.
method Embedding raw data into a low-dimensional feature space, then generating virtual data from linear operations on these vectors, to train multi-tag classifiers.
result Significant improvement in F1 scores (up to 224%) compared to training directly with raw data.
Proposes and evaluates three diagnostic graphics for probabilistic classifiers.
problem Evaluating and comparing probabilistic classifiers.
method Triptych of diagnostic graphics: reliability diagram, ROC curve, Murphy diagram.
result Visual diagnostics reveal distinct aspects of forecast performance.
We propose a novel confidence scoring mechanism for deep neural networks based on a two-model paradigm involving a base model and a meta-model. The confidence score is learned by the meta-model observing the base model succeeding/failing at its task. As features to the meta-model, we investigate linear classifier probe…
This paper considers fair probabilistic binary classification where the outputs of primary interest are predicted probabilities, commonly referred to as scores. We formulate the problem of transforming scores to satisfy fairness constraints that are linear in conditional means of scores while minimizing a cross-entropy…
Efficiently distills pretrained text-to-image models without real data, improving FID and CLIP scores.
problem Slow iterative refinement process of diffusion-based text-to-image models.
method Guided Score identity Distillation with Long and Short Classifier-Free Guidance.
result Achieves state-of-the-art FID performance with competitive CLIP score.
New method estimates grouping loss in neural networks to improve confidence scores.
problem Improving confidence scores in neural networks to reflect true posterior probabilities.
method Proposed an estimator to approximate the grouping loss.
result Modern neural networks exhibit grouping loss, especially in distribution shifts.
In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the score, into a cost-sensitive one. The procedure, uses order statistic to find an optimal threshold for…
Binary classification is highly used in credit scoring in the estimation of probability of default. The validation of such predictive models is based both on rank ability, and also on calibration (i.e. how accurately the probabilities output by the model map to the observed probabilities). In this study we cover the cu…
We propose a method to visualize class similarity in large-scale classifiers.
problem Analyzing hierarchical structures and relationships in large-scale classification.
method Compute class similarity based on prediction scores and visualize the class similarity matrix.
result Visualizing class similarity matrices reveals hierarchical structures and relationships.
A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calibrated over all protected groups, and then to post-process this score to obtain a binary decision. We study the feasibility of achieving vari…
New method improves certified robustness for classifier confidence.
problem Certifying confidence in classifier predictions.
method Randomized smoothing with modified Neyman-Pearson lemma.
result Certified radii for prediction confidence improved.
OTF uses optimal transport to measure classifier fairness.
problem Measuring and reducing unfairness in classifier predictions.
method Introduces Optimal Transport to Fairness (OTF) to quantify and reduce unfairness.
result OTF improves the balance between classifier performance and fairness.
We consider the two-group classification problem and propose a kernel classifier based on the optimal scoring framework. Unlike previous approaches, we provide theoretical guarantees on the expected risk consistency of the method. We also allow for feature selection by imposing structured sparsity using weighted kernel…
Online monitor detects classifier drift and adapts predictions.
problem Silent degradation of classifier accuracy under distributional shift.
method Sliding-window KS statistic with calibrated alarm thresholds.
result 86.6% valid detection across various shift conditions.
A new algorithm improves credit scoring accuracy for imbalanced data.
problem Poor classification of minority class in credit scoring data sets.
method Weighted-Hybrid-Sampling-Boost (WHSBoost) algorithm with balanced data sampling.
result WHSBoost outperforms other methods in credit scoring accuracy.
A new bias score method optimizes fairness in classification.
problem Ensuring fairness in binary classification under group constraints.
method Introducing bias scores and developing a post-hoc approach to adapt to fairness constraints.
result The method maintains high accuracy while ensuring fairness constraints.
ECP method improves image classifier uncertainty sets.
problem Generating reliable uncertainty sets for deep classifiers.
method Evidential Conformal Prediction (ECP) based on EDL.
result ECP outperforms state-of-the-art methods in set size and adaptivity.
New metrics improve performance in imbalanced classification problems.
problem Established metrics favor classifiers ignoring minority classes.
method Introduce robust modifications of F-score and MCC.
result TPR is bounded away from 0 in imbalanced settings.
We study the performance of data-driven, a priori and random approaches to label space partitioning for multi-label classification with a Gaussian Naive Bayes classifier. Experiments were performed on 12 benchmark data sets and evaluated on 5 established measures of classification quality: micro and macro averaged F1 s…
New analysis reveals gaps in selective classifiers, guiding improvements.
problem Improving selective classifiers to match perfect-ordering oracle performance.
method Formalized selective classification gap, decomposed into five sources of looseness.
result Monotone post-hoc calibration has limited impact on closing the gap.
Most binary classifiers work by processing the input to produce a scalar response and comparing it to a threshold value. The various measures of classifier performance assume, explicitly or implicitly, probability distributions and of the response belonging to either class, probability distributions for the…
Quantum Inception Scorequant-ph
Proposes qIS for quantum generative models, extending classical inception score.
problem Develop a metric to evaluate quantum generative models.
method Introduces qIS, relating quality to Holevo information of quantum channel.
result qIS enhances the quality of quantum generative models, showing physical limitations.
The study proposes a framework to accept OOD data based on competence scores.
problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.
We study strictly proper scoring rules in the Reproducing Kernel Hilbert Space. We propose a general Kernel Scoring rule and associated Kernel Divergence. We consider conditions under which the Kernel Score is strictly proper. We then demonstrate that the Kernel Score includes the Maximum Mean Discrepancy as a special …