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

1122 · Mar 200519922001200920172026
30 results for over-confidence

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.

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 ↗

GUST framework improves self-training by estimating node uncertainty and generating pseudo-labels.

problem Over-confidence in pseudo-labels during self-training.
method Graph-based uncertainty-aware self-training with stochastic node labeling.
result GUST achieves state-of-the-art performance, especially in sparse labeled data settings.

Existing methods for structure discovery in time series data construct interpretable, compositional kernels for Gaussian process regression models. While the learned Gaussian process model provides posterior mean and variance estimates, typically the structure is learned via a greedy optimization procedure. This restri…

2016-11-21abs ↗pdf ↗

Paper introduces a method to learn physics between digital twins using imperfect models.

problem Learning physics from imperfect data and low-fidelity models.
method Bayesian Hierarchical modeling with physics-informed Gaussian processes.
result Models learning between digital twins are less uncertain than independent models but not over-confident.

We study a dynamical Ising model of agents' opinions (buy or sell) with coupling coefficients reassessed continuously in time according to how past external news (magnetic field) have explained realized market returns. By combining herding, the impact of external news and private information, we test within the same mo…

2005-03-31abs ↗pdf ↗

The paper proposes a method to produce well-calibrated predictions in regression tasks using maximum mean discrepancy.

problem The need for accurate uncertainty quantification in machine learning predictions.
method The method uses maximum mean discrepancy to minimize the kernel embedding measure and calibrate predictions.
result The method produces well-calibrated and sharp prediction intervals, outperforming state-of-the-art methods.

It has recently been shown that ReLU networks produce arbitrarily over-confident predictions far away from the training data. Thus, ReLU networks do not know when they don't know. However, this is a highly important property in safety critical applications. In the context of out-of-distribution detection (OOD) there ha…

2019-09-26abs ↗pdf ↗

Blade uses diffusion priors to accurately and calibratedly infer complex systems.

problem Derivative-free Bayesian inversion for high-dimensional, nonlinear problems with costly forward models.
method Blade employs an ensemble of interacting particles and diffusion models as priors, querying forward models only through evaluations.
result Blade produces well-calibrated posterior samples that existing methods cannot, improving with more iterations and particles.

Density-Softmax improves uncertainty estimation and robustness without sampling, reducing model size and latency.

problem Sampling-based uncertainty estimation methods suffer from large model size and high latency.
method Combines a Lipschitz-constrained feature extractor with the softmax layer to create a sampling-free deterministic framework.
result Density-Softmax reduces over-confidence under distribution shifts and achieves competitive results in uncertainty and robustness.

Bayesian bandits misspecification affects UX optimization, revealing new models.

problem Misspecification of value models in Bayesian bandits impacts UX optimization.
method Formulated UXO as a restless, sleeping bandit with unobserved confounders and optional stopping. Provided model extensions to address misspecifications.
result Common misspecifications lead to sub-optimal rewards, demonstrating overdispersion's effects on bandit performance.

The generalization and learning speed of a multi-class neural network can often be significantly improved by using soft targets that are a weighted average of the hard targets and the uniform distribution over labels. Smoothing the labels in this way prevents the network from becoming over-confident and label smoothing…

2019-06-06abs ↗pdf ↗

Characterizes uncertainty in high-dimensional linear classification models.

problem Assessing uncertainty in high-dimensional linear classification models.
method Approximate message passing algorithm for posterior marginals, closed-form formula for joint statistics.
result Closed-form formula for joint statistics between logistic classifier, Bayesian uncertainty, and ground-truth probit uncertainty.

Bayesian neural networks improve uncertainty quantification with unlabelled data.

problem Over-confidence in predictions on covariate-shifted data.
method Approximate Bayesian inference using posterior regularisation with pseudo-labels from unlabelled data.
result Significant improvement in uncertainty quantification accuracy on covariate-shifted data.

We propose a novel sparse spectrum approximation of Gaussian process (GP) tailored for Bayesian optimization. Whilst the current sparse spectrum methods provide desired approximations for regression problems, it is observed that this particular form of sparse approximations generates an overconfident GP, i.e. it produc…

2019-06-21abs ↗pdf ↗

Enhances out-of-domain calibration of neural networks.

problem Improving calibration performance of deep neural networks in out-of-domain settings.
method Consistency-guided temperature scaling (CTS) that considers style and content consistency.
result Significantly enhances out-of-domain calibration performance.

The study examines label smoothing to improve confidence calibration in fine-tuned LLMs.

problem Improving confidence calibration in fine-tuned large language models (LLMs) after instruction tuning.
method Examine various open-sourced LLMs, label smoothing, and custom kernel design.
result Label smoothing is effective in maintaining confidence calibration but faces challenges in large vocabulary LLMs.

CAT improves domain adaptation for fault diagnosis by calibrating teacher network predictions.

problem Performance drops in deep learning models when applied to different data distributions.
method CAT uses post-hoc calibration techniques to calibrate predictions of the teacher network during self-training.
result CAT achieves state-of-the-art performance on most transfer tasks in domain-adaptive IFD.

Study improves CNN medical image segmentation accuracy and reliability.

problem Over-confident predictions and silent failures in out-of-distribution data.
method Multi-task learning and spectral analysis of CNN feature maps.
result Joint multi-task learning models outperform dedicated models and detect OOD data more accurately.

Proposes deep quantile regression for uncertainty estimation in lesion detection.

problem Uncertainty quantification in lesion detection for critical applications.
method Quantile regression for aleatoric uncertainty, Variational AutoEncoder (VAE) with QR-VAE, binary quantile regression (BQR).
result Effective quantification of uncertainty in lesion detection and segmentation.