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.
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 aim of this paper was to compare soft confusion matrix approach and Bayes metaclassifier under the multi-label classification framework. Although the methods were successfully applied under the multi-label classification framework, they have not been compared directly thus far. Such comparison is of vital importanc…
Proposes a new method for deep ensembles that improves accuracy and calibration.
problem Improving accuracy and calibration of deep ensembles.
method Estimates confusion matrices of ensemble members and weighs them according to their inferred performance.
result Empirically shows superiority of soft Dawid Skene over ensemble averaging.
Paper proposes using truncated normal distribution for RRC model, improving detection of minority classes.
problem Improving weak classifiers in RRC models.
method Proposes using truncated normal distribution and soft confusion matrix for RRC model.
result Truncated-normal-based SCM algorithm outperforms beta distribution in discovering minority classes.
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…
In this work, we propose a PAC-Bayes bound for the generalization risk of the Gibbs classifier in the multi-class classification framework. The novelty of our work is the critical use of the confusion matrix of a classifier as an error measure; this puts our contribution in the line of work aiming at dealing with perfo…
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.
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.
We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…
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.
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.
IRT metrics improve model evaluation by assessing latent characteristics.
problem Limitations of classic metrics like precision and F1.
method Introducing psychometric metrics like Item Response Theory (IRT).
result IRT complements classical metrics, offering new insights.
In this work we addressed the issue of applying a stochastic classifier and a local, fuzzy confusion matrix under the framework of multi-label classification. We proposed a novel solution to the problem of correcting label pairwise ensembles. The main step of the correction procedure is to compute classifier-specific c…
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.
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.
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.
In this work, we addressed the issue of applying a stochastic classifier and a local, fuzzy confusion matrix under the framework of multi-label classification. We proposed a novel solution to the problem of correcting label pairwise ensembles. The main step of the correction procedure is to compute classifier- specific…
The predictive performance of supervised learning algorithms depends on the quality of labels. In a typical label collection process, multiple annotators provide subjective noisy estimates of the "truth" under the influence of their varying skill-levels and biases. Blindly treating these noisy labels as the ground trut…
Machine learning experiments often contain errors, especially in confusion matrices and statistical tests.
problem Errors in machine learning experiments, particularly in confusion matrices and statistical tests.
method Analyzed 49 papers describing 2456 experiments, checking for errors in confusion matrices and statistical significance.
result 22 out of 49 papers contain demonstrable errors, with 7 statistical and 16 related to confusion matrix inconsistency.
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.
When response variables are nominal and populations are cross-classified with respect to multiple polytomies, questions often arise about the degree of association of the responses with explanatory variables. When populations are known, we introduce a nominal association vector and matrix to evaluate the dependence of …
New algorithm optimizes complex metrics in online learning.
problem Optimizing non-decomposable metrics in sequential learning.
method General online algorithm for various metrics.
result Achieves O(nlnn) regret for concave and smooth metrics. Paper finds a fast method for a matrix norm proximal operator.
problem Optimizing mixed ℓ1,∞ matrix norms efficiently. method Closed-form computation using soft-thresholding, iterative algorithm for thresholds.
result Mixed ℓ1,∞ prox can be computed in closed form. 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.
GS-B3SE 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-B3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph. result GS-B3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness. 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.
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.
This paper studies how neural network architecture affects the speed of training. We introduce a simple concept called gradient confusion to help formally analyze this. When gradient confusion is high, stochastic gradients produced by different data samples may be negatively correlated, slowing down convergence. But wh…
Constructs noncommutative spaces for D-branes on complex algebraic spaces.
problem Mathematical model for D-branes on noncommutative spaces.
method Toric geometry, Azumaya schemes, invertible sheaves.
result Embeds algebraic Calabi-Yau spaces into soft noncommutative schemes.
This paper introduces a high frequency trade execution model to evaluate the economic impact of supervised machine learners. Extending the concept of a confusion matrix, we present a 'trade information matrix' to attribute the expected profit and loss of the high frequency strategy under execution constraints, such as …
Exploring how noise and curvature affect optimization and generalization.
problem The interaction between noise and curvature in optimization and generalization.
method Analyzing the speed of minimizing expected loss with stochastic methods, distinguishing between Fisher, Hessian, and gradient covariance matrices.
result Clarifying the role of curvature and noise in estimating the generalization gap.
Recent studies have shown that reinforcement learning (RL) models are vulnerable in various noisy scenarios. For instance, the observed reward channel is often subject to noise in practice (e.g., when rewards are collected through sensors), and is therefore not credible. In addition, for applications such as robotics, …
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, …
A new method improves graph-based semi-supervised classification by removing noise and mixed signs.
problem Inaccurate soft labels and noise in graph-based semi-supervised classification.
method Triple-matrix-recovery-based robust auto-weighted label propagation framework (ALP-TMR).
result Improved robustness to noise and outliers in label estimation.
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 analyzes how periodic and soft target updates stabilize linear Q-learning.
problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.
Unified view of label shift estimation methods.
problem Label distribution changes but class-conditional distributions remain the same.
method Unified view of two approaches: BBSE and MLLS.
result Unified framework and theoretical characterization of MLLS.
A new method for sparse PCA using orthogonal rotations and soft-thresholding.
problem Sparse PCA with a new basis using orthogonal rotations.
method Initialize with leading principal components, apply kimesk orthogonal rotation, and soft-threshold the rotated components. result The proposed method is more stable and explains more variance compared to alternatives.
Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-…
New solutions for soft materials' nonlinear behavior in growing spheroidal inclusions.
problem Understanding soft materials' behavior under microstructure effects.
method Presented an accurate semi-inverse solution for isotropically growing spheroidal inclusions.
result Existence of a non-spherical asymptotic shape and associated asymptotic pressure (isomorphic pressure).
Theory models nonlinear soft tissue elasticity and remodeling using extended Finsler geometry.
problem Understanding and predicting the behavior of nonlinear soft tissues, especially in biologic contexts.
method Formulated a continuum mechanical theory incorporating extended Finsler geometry to describe the complex behaviors of fibrous soft solids.
result The model quantifies residual strains from growth, remodeling, and degradation, and predicts equilibrium configurations.
Proposes a technique to balance imbalanced data classes.
problem Imbalanced data in classification problems.
method Synthesizes data samples near actual data for minority classes.
result Significantly more balanced and fair classification results achieved.
We study consistency of learning algorithms for a multi-class performance metric that is a non-decomposable function of the confusion matrix of a classifier and cannot be expressed as a sum of losses on individual data points; examples of such performance metrics include the macro F-measure popular in information retri…
Boosting theory extended to handle cost-sensitive and multi-objective losses.
problem Real-world prediction problems with different error costs.
method Developed a comprehensive theory of cost-sensitive and multi-objective boosting.
result Established a dichotomy for binary classification and a more intricate landscape for multiclass settings.
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…