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

108216323431 · Jun 202019922001200920172026
48 results for confidence accuracy

Calibrates network confidence for unsupervised domain adaptation.

problem Calibrating a model trained on a source domain to a target domain without labeled data.
method Estimates network accuracy on the target domain and calibrates prediction confidence directly in the target domain.
result Significantly outperforms existing methods across standard datasets.

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.

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.

ATC predicts target domain accuracy using only labeled and unlabeled data.

problem Predicting out-of-distribution performance with limited labeled data.
method Average Thresholded Confidence (ATC) method that learns a threshold on model confidence.
result ATC outperforms previous methods across various types of distribution shifts and datasets.

Learn low-degree functions with few random queries.

problem Learning low-degree functions from limited random queries.
method Learn bounded functions f:{1,1}no[1,1]f:\{-1,1\}^n o[-1,1] of degree at most dd with L2L_2-accuracy ε\varepsilon and confidence 1δ1-δ from log(fracnδ)εd1Cd3/2logd\log( frac{n}δ)\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}} random queries.
result Learn low-degree functions efficiently with logarithmic number of random queries.

Specialists outperform generalists in ensemble classification.

problem Determining the accuracy of an ensemble of classifiers when individual classifier accuracies are known.
method Proved upper and lower bounds on ensemble accuracy, constructed specialist and generalist classifiers.
result Upper and lower bounds on ensemble accuracy, practical implications for classifier construction.

This paper extends the existing literature on empirical estimation of the confidence intervals associated to the Detrended Fluctuation Analysis (DFA). We used Montecarlo simulation to evaluate the confidence intervals. Varying the parameters in DFA technique, we point out the relationship between those and the standard…

2016-02-01abs ↗pdf ↗

In this paper, we propose a new method called ProfWeight for transferring information from a pre-trained deep neural network that has a high test accuracy to a simpler interpretable model or a very shallow network of low complexity and a priori low test accuracy. We are motivated by applications in interpretability and…

2018-07-19abs ↗pdf ↗

A new OOD detector using an overlap index improves accuracy without high computational costs.

problem Effective OOD detection for machine learning models in open-world scenarios.
method Proposes an overlap index-based confidence score function for OOD detection.
result The proposed method achieves competitive accuracy with lower computational costs compared to state-of-the-art detectors.

A modification of the confidence screening mechanism based on adaptive weighing of every training instance at each cascade level of the Deep Forest is proposed. The idea underlying the modification is very simple and stems from the confidence screening mechanism idea proposed by Pang et al. to simplify the Deep Forest …

2019-01-04abs ↗pdf ↗

Safety-critical applications require machine learning models that output accurate and calibrated probabilities. While uncalibrated deep networks are known to make over-confident predictions, it is unclear how model confidence is impacted by the variations in the data, such as label noise or class size. In this paper, w…

2020-02-23abs ↗pdf ↗

Paper uses evidence theory to improve stock price forecasting accuracy.

problem Inaccurate stock price predictions due to time series limitations.
method Applies evidence theory's confidence functions and Dempster combination rule to stock price forecasting.
result Improved accuracy in stock price predictions compared to classic methods.

Develops a method to find costly high-confidence errors in black box models.

problem Finding rare high-confidence errors missed by random sampling.
method Adversarial perturbation-guided search technique to find errors at rates greater than expected given model confidence.
result Our Adversarial Distance search discovers high-confidence errors at a rate greater than expected given model confidence.

LLMs generate answers under incomplete context, and their uncertainty should scale with missing information.

problem Evaluating the quality of LLM answers under incomplete context.
method A controlled framework with varying context availability, and two uncertainty measures (sampling-based confidence and response entropy) evaluated on SQuAD.
result Response entropy increases with context removal and explains more variance in accuracy than confidence, suggesting it is a more responsive uncertainty measure.

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 Expected Calibration Error (ECE), considering top-1-to-kk calibration.
result Shows asymptotic normality and different convergence rates for calibrated and miscalibrated models, developing methods to construct valid confidence intervals.

There are two major paradigms of white-box adversarial attacks that attempt to impose input perturbations. The first paradigm, called the fix-perturbation attack, crafts adversarial samples within a given perturbation level. The second paradigm, called the zero-confidence attack, finds the smallest perturbation needed …

2019-10-01abs ↗pdf ↗

Adversarial training yields robust models against a specific threat model, e.g., LL_\infty adversarial examples. Typically robustness does not generalize to previously unseen threat models, e.g., other LpL_p norms, or larger perturbations. Our confidence-calibrated adversarial training (CCAT) tackles this problem by b…

2019-10-14abs ↗pdf ↗

A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.

problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.

Pathology reports contain useful information such as the main involved organ, diagnosis, etc. These information can be identified from the free text reports and used for large-scale statistical analysis or serve as annotation for other modalities such as pathology slides images. However, manual classification for a hug…

2019-10-31abs ↗pdf ↗

Estimating the value function for a fixed policy is a fundamental problem in reinforcement learning. Policy evaluation algorithms---to estimate value functions---continue to be developed, to improve convergence rates, improve stability and handle variability, particularly for off-policy learning. To understand the prop…

2018-08-28abs ↗pdf ↗

The paper introduces multicalibration to improve confidence scores in LLMs.

problem Improving the reliability and interpretability of confidence scores for LLMs.
method Forming groupings of prompt/completion pairs correlated with correctness, using clustering and self-annotation. Developing multicalibration algorithms to reduce overfitting.
result Our techniques yield confidence scores that significantly improve calibration and accuracy compared to existing methods.

Develops statistical confidence sets for multidimensional scaling.

problem Statistical uncertainty in multidimensional scaling of noisy data.
method Formal statistical framework, distributional convergence results, uniform confidence sets, bootstrap procedures.
result Construction of reliable confidence sets for latent configurations in multidimensional scaling.

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.

Paper proposes a method to predict deep neural network confidences with guarantees.

problem Quantifying uncertainty in deep neural networks for safety-critical applications.
method Uses Clopper-Pearson confidence intervals and histogram binning for calibrated prediction.
result Demonstrates the effectiveness of predicted confidences in improving DNN performance and safety.

Deep neural networks bring in impressive accuracy in various applications, but the success often relies on the heavy network architecture. Taking well-trained heavy networks as teachers, classical teacher-student learning paradigm aims to learn a student network that is lightweight yet accurate. In this way, a portable…

2018-07-30abs ↗pdf ↗

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.

This paper proposes a DGP approach with UCBs for point target tracking over WSNs.

problem Uncertainty quantification in distributed machine learning-based tracking over WSNs.
method Distributed Gaussian process (DGP) approach with upper confidence bounds (UCBs).
result UCBs provide 88% and 42% higher probability of encompassing true target states in X and Y coordinates, respectively.

Confidence intervals improve evaluation of binary prediction rules in data mining.

problem Uncertainty in performance measures estimation from finite datasets.
method Asymptotic normal approximations for confidence intervals, with a blurring correction.
result Improved finite sample coverage probabilities and general performance measures inference.

It has been suggested that adversarial examples cause deep learning models to make incorrect predictions with high confidence. In this work, we take the opposite stance: an overly confident model is more likely to be vulnerable to adversarial examples. This work is one of the most proactive approaches taken to date, as…

2018-02-13abs ↗pdf ↗

Assessing the predictive accuracy of black box classifiers is challenging in the absence of labeled test datasets. In these scenarios we may need to rely on a human oracle to evaluate individual predictions; presenting the challenge to create query algorithms to guide the search for points that provide the most informa…

2018-10-12abs ↗pdf ↗

Study improves fraud detection in e-commerce with a stacked model combining CNNs, GNNs, and confidence gating.

problem Detecting credit card fraud in online transactions.
method Stacking approach with attention and confidence-driven layers, using DOWA and IOWA operators.
result The method achieves high accuracy and robust generalization in CCF detection.

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.

Structural equation models and Bayesian networks have been widely used to study causal relationships between continuous variables. Recently, a non-Gaussian method called LiNGAM was proposed to discover such causal models and has been extended in various directions. An important problem with LiNGAM is that the results a…

2009-09-16abs ↗pdf ↗

PaRCE estimates model confidence for CNNs across various uncertainties.

problem Limited holistic approach to estimating perception model confidence in CNNs.
method Probabilistic and reconstruction-based competency estimation.
result PaRCE best distinguishes between various types of samples and regions.