A new concept of confidence in learning is defined and analyzed.
problem Understanding and quantifying trust in learning processes.
method Formal axioms, continuum measures, vector fields, loss functions.
result Confidence can be represented and optimized in learning.
Algorithm constructs confidence sets for deep neural networks with PAC guarantees.
problem Ensuring reliable predictions for deep neural networks with high confidence.
method Combines calibrated prediction and learning theory bounds.
result Constructs PAC confidence sets for various deep models.
Improves binary classification from positive data with skewed confidence.
problem Skewed confidence in positive data affects the performance of Pconf classifiers.
method Parameterized model of skewed confidence and hyperparameter selection.
result Proposed method effectively cancels out the negative impact of skewed confidence.
CoinDICE estimates confidence intervals for unknown behavior policies in reinforcement learning.
problem Estimating value of a target policy using only behavior policy data.
method Function space embedding, generalized empirical likelihood method, Lagrangian optimization.
result Valid confidence intervals with tighter and more accurate estimates than existing methods.
Responds to critiques on tests for causal parameter confidence intervals.
problem Testing nominal confidence interval coverage for causal parameters estimated by machine learning.
method Rejoinder to critiques on nearly assumption-free tests.
result Clarifies and supports the original research's approach.
Research aims to improve confidence intervals for RKHS elements in online learning.
problem Improper confidence intervals lead to suboptimal regret bounds in kernel-based bandit and reinforcement learning.
method Formalizes the open problem of online confidence intervals in RKHS and reviews existing results.
result Identifies the online nature of observation points as the main challenge for tight confidence intervals.
New tighter confidence bounds for sequential kernel regression.
problem Quantifying uncertainty in sequential learning algorithms.
method Martingale tail inequalities and conic programming.
result New confidence bounds are tighter than existing ones.
This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.
problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.
The paper shows over-confidence in models isn't just due to over-parametrization.
problem Over-confidence in machine learning models, especially in binary classification.
method Theoretical analysis of logistic regression and other binary classification problems.
result Logistic regression is inherently over-confident in certain settings, but over-confidence is not always the case.
This paper improves confidence measurement in deep metric learning models.
problem Measuring confidence in deep metric learning models is challenging.
method Approximates class distributions using Gaussian kernel smoothing and calibrates the confidence metric.
result Improves generalization and robustness of deep metric learning models.
Meta-learned confidence improves few-shot learning accuracy.
problem Improving accuracy in few-shot learning with unreliable model confidence.
method Meta-learning confidence weights for query samples to improve transductive inference performance.
result Meta-learned confidence leads to new state-of-the-art results on benchmark datasets.
The paper develops optimal confidence regions for categorical data.
problem Constructing tight confidence regions for categorical data.
method Develops new theory for minimum average volume confidence regions.
result Shows optimality of the regions for categorical data and its implications for machine learning.
Paper defines and solves a problem in representation learning to ensure fairness with high confidence.
problem Learning fair representations with high confidence guarantees for all downstream tasks.
method Formally defines the problem, introduces FRG framework, proves high probability fairness, and demonstrates effectiveness empirically.
result FRG framework provides high-confidence guarantees for limiting unfairness across all downstream models and tasks.
DBLE improves confidence calibration of DNNs by learning distances in representation space.
problem Poor confidence calibration of deep neural networks (DNNs).
method DBLE trains a confidence model jointly with the classification model, using distances in the representation space.
result DBLE outperforms alternative single-model confidence calibration approaches and ensemble methods.
A new differentiable UCB algorithm for linear bandits learns adaptive confidence bounds.
problem Inability of UCB to strike optimal exploration-exploitation due to confidence bounds.
method Proposes a differentiable linear bandit algorithm and a gradient estimator for learning adaptive confidence bounds.
result Achieves a i l d e O ( β ^ d T ) ilde{\mathcal{O}}(\hatβ\sqrt{dT}) i l d e O ( β ^ d T ) upper bound of T T T -round regret. Imitation learning (IL) aims to learn an optimal policy from demonstrations. However, such demonstrations are often imperfect since collecting optimal ones is costly. To effectively learn from imperfect demonstrations, we propose a novel approach that utilizes confidence scores, which describe the quality of demonstrat…
New method optimizes offline linear bandits using different confidence sets.
problem Optimizing offline learning for linear contextual bandits.
method Introduces a family of pessimistic learning rules based on ℓ p \ell_p ℓ p confidence sets. result The π ^ ∞ \hatπ_\infty π ^ ∞ rule achieves minimax performance and strictly dominates other predictors. Framework for confidence estimation in deep CT reconstructions.
problem Uncertainty in deep learning-based CT reconstructions.
method Sequential likelihood mixing framework with log-linear forward model.
result Deep models yield tighter confidence regions than classical methods.
The paper investigates how dataset quality and heterogeneity affect model confidence in machine learning.
problem Understanding how dataset quality and heterogeneity impact model confidence in machine learning.
method The study uses theoretical explanations and experimental demonstrations to investigate the effects of dataset size, label noise, and class heterogeneity on model confidence.
result Label noise reduces model confidence, while reduced dataset size increases it, and class heterogeneity leads to inconsistent confidence across classes.
Paper tackles weakly supervised learning from similarity-confidence data.
problem Learning binary classifier from unlabeled data pairs with confidence of similarity.
method Proposes an unbiased estimator of classification risk from Sconf data and risk correction scheme.
result Demonstrates effectiveness of proposed methods through experiments.
Deep learning architectures have proved versatile in a number of drug discovery applications, including the modelling of in vitro compound activity. While controlling for prediction confidence is essential to increase the trust, interpretability and usefulness of virtual screening models in drug discovery, techniques t…
We provide the asymptotic distribution of the major indexes used in the statistical literature to quantify disparate treatment in machine learning. We aim at promoting the use of confidence intervals when testing the so-called group disparate impact. We illustrate on some examples the importance of using confidence int…
The paper presents a method to compute trusted confidence bounds for LECs in CPS.
problem Non-transparent predictions of LECs make CPS safety challenging.
method Inductive Conformal Prediction (ICP) and Triplet Network architecture.
result Efficient real-time computation of trusted confidence bounds.
The paper provides a method to find optimal machine learning model parameters with confidence.
problem Finding optimal machine learning model parameters that generalize well to the entire population.
method Constructs valid confidence sets for the optimal parameter using only training data.
result Valid confidence sets for optimal machine learning model parameters can be generated using bootstrapping techniques.
New method for accurate uncertainty estimation in deep learning predictions.
problem Insufficient methods for assessing prediction uncertainty in deep learning.
method Valid non-parametric bootstrap method for deep neural networks.
result Accurate confidence intervals and simultaneous confidence bands for survival data.
Improved drug-protein interaction prediction using FTL method.
problem Predicting drug-protein interactions from noisy data with uncertain labels.
method Filtered Transfer Learning (FTL) method that fine-tunes a deep neural network across multiple tiers of data confidence.
result FTL method outperforms deep neural networks trained on single confidence ranges.
The paper improves confidence intervals for test error using cross-validation.
problem Improving confidence intervals for test error in machine learning.
method Develops central limit theorems and consistent estimators for cross-validation.
result Provides asymptotically-exact confidence intervals and hypothesis tests.
Develops confidence intervals for ECE, a measure of model calibration.
problem Ensuring the calibration of probabilistic predictions in machine learning models.
method Develops confidence intervals for the ℓ 2 \ell_2 ℓ 2 Expected Calibration Error (ECE), considering top-1-to- k k k calibration. result Shows asymptotic normality and different convergence rates for calibrated and miscalibrated models, developing methods to construct valid confidence intervals.
Paper improves confidence intervals and variance estimation for deep learning models.
problem Improving confidence intervals and variance estimation in deep learning models.
method Residual-based framework for conditional variance estimation; robust bootstrap procedure for confidence intervals.
result First non-asymptotic bounds for variance estimation using ReLU networks.
A method uses confidence scores to handle noisy labels for each instance.
problem Learning with noisy labels where each instance's label can randomly change.
method Introduces confidence-scored instance-dependent noise (CSIDN) to estimate transition distributions for each instance.
result Demonstrates the utility and effectiveness of CSIDN through experiments with synthetic and real-world noise.
Paper introduces a novel method for estimating model confidence in deep neural classifiers.
problem Reliable confidence estimation for deep neural classifiers in safety-critical applications.
method Proposes a novel target criterion (true class probability) and learns it from data with an auxiliary model.
result The proposed method outperforms strong baselines in various tasks and network architectures.
Paper proposes a method to improve deep neural networks' confidence estimates.
problem Overconfident predictions limit practical use of deep neural networks in safety-critical applications.
method Proposes a novel loss function, Correctness Ranking Loss, to regularize class probabilities.
result The method produces well-ranked confidence estimates and is effective for out-of-distribution detection and active learning.
Softmax confidence misrepresents uncertainty in neural networks.
problem Neural networks fail to increase uncertainty on out-of-distribution data.
method Investigates two implicit biases in softmax confidence.
result Softmax confidence correlates with epistemic uncertainty due to decision boundary structure and deep network filtering.
Bayesian approach calibrates DNN confidence for field use.
problem DNN models give false predictions with high confidence in real-world applications.
method Bayesian approach using Gaussian Process Regression to correct confidence with minimal labeled operation data.
result Significantly reduces high-confidence errors with minimal labeled data.
Study compares imputation methods' effects on IML confidence intervals.
problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.
Optimal learning via moderate deviations theory improves statistical accuracy.
problem Statistical estimation of expected loss in various models.
method Develops confidence intervals using moderate deviation principle.
result Proposed confidence intervals are statistically optimal.
TeLeS improves ASR confidence estimation by considering temporal alignment and lexical errors.
problem Inaccurate confidence scores from E2E ASR models, especially for overconfident predictions.
method Proposes TeLeS, a novel confidence score that considers temporal alignment and lexical errors, and uses shrinkage loss to handle data imbalance.
result TeLeS generalizes well across different languages and ASR models, leading to significant WER reduction.
In classification applications, we often want probabilistic predictions to reflect confidence or uncertainty. Dropout, a commonly used training technique, has recently been linked to Bayesian inference, yielding an efficient way to quantify uncertainty in neural network models. However, as previously demonstrated, conf…
The paper tackles confidence calibration for exploratory machine learning problems.
problem Difficulty in curating datasets and confusion about category validity.
method Introduces four new algorithms for category-specific confidence estimation, including kernel density ratios.
result Kernel density ratios provide a novel approach to confidence calibration, especially for exploratory problems.
Proposes a new confidence criterion for deep neural networks to predict failures.
problem Predicting failures in deep neural networks.
method Introduces True Class Probability (TCP) as a new confidence criterion and proposes a learning scheme to estimate it.
result The proposed approach consistently outperforms existing methods in failure prediction.
Generative models need per-sample confidence scores to improve quality and stability.
problem Generative models produce unreliable outputs and lack confidence measures.
method Flow Matching with Confidence (FMwC) injects noise and integrates it through the network, providing per-sample confidence scores.
result The confidence score correlates with the velocity field's divergence, offering insights into generative processes.
In the field of reinforcement learning there has been recent progress towards safety and high-confidence bounds on policy performance. However, to our knowledge, no practical methods exist for determining high-confidence policy performance bounds in the inverse reinforcement learning setting---where the true reward fun…
We present a confidence-based single-layer feed-forward learning algorithm SPIRAL (Spike Regularized Adaptive Learning) relying on an encoding of activation spikes. We adaptively update a weight vector relying on confidence estimates and activation offsets relative to previous activity. We regularize updates proportion…
We shrink confidence sets for equivalent discrete distributions using permutation equivalence.
problem Building high-probability confidence sets for equivalent discrete distributions.
method Exploiting permutation-equivalence to refine confidence sets.
result Confidence sets shrink at asymptotic rates of O ( 1 / ∑ k ∈ K n k ) O(1/\sqrt{\sum_{k\in \mathcal K} n_k}) O ( 1/ ∑ k ∈ K n k ) and O ( 1 / max k ∈ K n k ) O(1/\max_{k\in K} n_{k}) O ( 1/ max k ∈ K n k ) . Develops spatial uncertainty guarantees for image segmentation models.
problem Ensuring reliable segmentation predictions for biomedical images.
method Adapting conformal inference to imaging, using transformed logit scores and calibration datasets.
result Confidence sets provide spatial uncertainty guarantees with desired probability.
New metrics CWSA and CWSA+ improve model evaluation under confidence thresholds.
problem Lack of metrics capturing model reliability under confidence thresholds.
method Introducing CWSA and CWSA+ metrics that reward confident accuracy and penalize overconfident mistakes.
result CWSA and CWSA+ outperform classical metrics in trust-sensitive tests.
New attacks can infer model training membership using only label predictions, not confidence.
problem Inferring whether a data point was used to train a machine learning model.
method Evaluate model's predicted labels under perturbations to infer membership.
result Label-only attacks perform as well as confidence-based attacks and break defenses that rely on confidence masking.
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…