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,695 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.6% · May 202519922001200920172026
48 results for Overconfidence

The thesis tackles overconfident approximations in simulation-based inference.

problem Overconfident conclusions from machine learning approximations in statistical analyses.
method Introduces balancing and Bayesian neural networks to reduce overconfidence.
result Balancing and Bayesian neural networks lead to less overconfident approximations.

Bayesian ReLU nets fix asymptotic overconfidence with infinite features.

problem Bayesian ReLU nets can be asymptotically overconfident far from training data.
method Extend finite ReLU BNNs with infinite ReLU features via a Gaussian process.
result The resulting model is asymptotically maximally uncertain far from the data.

Regularized mixtures improve inflation and interest rate forecasts, especially correcting overconfidence.

problem Improving density forecasts of Eurozone inflation and real interest rates.
method Construct regularized mixtures of density forecasts with various objectives and penalties.
result Regularized mixtures outperform individual forecasters, especially correcting overconfidence.

DRO-NPE improves neural posterior estimation by reducing overconfidence and overfitting.

problem Overconfident and unreliable posteriors in simulation-based inference with limited simulation budgets.
method Distributionally robust approach using Wasserstein ambiguity set and KL-based metrics.
result Consistently improves coverage and calibration across benchmark tasks.

We describe a limitation in the expressiveness of the predictive uncertainty estimate given by mean-field variational inference (MFVI), a popular approximate inference method for Bayesian neural networks. In particular, MFVI fails to give calibrated uncertainty estimates in between separated regions of observations. Th…

2019-06-27abs ↗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 ↗

This work improves neural network trustworthiness through uncertainty estimation.

problem Overconfident neural networks lead to poor performance under distribution shifts.
method Develops a general uncertainty framework for neural networks, including classification with rejection.
result Improves model trustworthiness and robustness in decision-making tasks.

The paper addresses poor calibration in fine-tuned LLMs after preference alignment.

problem Poor calibration in fine-tuned Large Language Models (LLMs) after preference alignment.
method Proposes a calibration-aware fine-tuning approach to restore calibration without compromising model performance.
result Demonstrates the effectiveness of the proposed methods through extensive experiments.

New method improves OOD detection by integrating diffusion models into discriminator models.

problem Overconfidence in discriminator models leads to poor OOD detection.
method Integrates diffusion models into discriminator and generation models to mitigate overconfidence.
result Demonstrates significant improvement in AUROC scores for challenging 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.

Combines Laplace approximations of deep networks for better uncertainty quantification.

problem Overconfident predictions on outliers in deep learning models.
method Gaussian mixture model posterior using weighted sum of Laplace approximations of pre-trained deep networks.
result Mitigates overconfidence 'far away' from training data.

Bayesian models for networks are often misspecified, leading to overconfident inference.

problem Real-world networks violate assumptions of geometry and link function in latent space models.
method Proposes a generalized posterior framework for random geometric graphs, using Link-Sequential R-SafeBayes to adaptively tune posterior regularization.
result Improved calibration and better link prediction performance demonstrated on synthetic and real-world networks.

Time series foundation models are well-calibrated, improving over baseline models.

problem Calibration of time series foundation models for practical applications.
method Systematic evaluations of five time series foundation models and two baselines, assessing calibration, prediction heads, and long-term forecasting.
result Time series foundation models are consistently better calibrated than baseline models and do not show over- or under-confidence.

New research challenges the independence assumption in neurosymbolic learning, leading to overconfident predictions and unrepresentable uncertainty.

problem The independence assumption in neurosymbolic learning systems can lead to overconfident predictions and hinder uncertainty quantification.
method The study proves the limitations of the independence assumption and introduces new loss functions that are non-convex and difficult to optimise.
result Neurosymbolic learning systems using the independence assumption are prone to overconfidence and cannot represent uncertainty over multiple valid options.

Modern deep artificial neural networks have achieved great success in the domain of computer vision and beyond. However, their application to many real-world tasks is undermined by certain limitations, such as overconfident uncertainty estimates on out-of-distribution data or performance deterioration under data distri…

2019-10-07abs ↗pdf ↗

A novel post-hoc calibration method reduces neural network calibration errors.

problem Neural networks produce poorly calibrated probabilities, leading to underconfidence and overconfidence.
method Probability bounding (PB) via box-constrained softmax (BCSoftmax) function.
result Consistently reduces calibration errors on four real-world datasets.

QLA improves Bayesian uncertainty estimation for DNNs without increasing computational cost.

problem Overconfident out-of-distribution predictions from DNNs.
method Proposes Quadratic Laplace Approximation (QLA) to improve Bayesian uncertainty quantification.
result QLA yields modest yet consistent uncertainty estimation improvements over Linearized Laplace Approximation (LLA) on five regression datasets.

Flexible evidential deep learning improves uncertainty quantification in machine learning.

problem Overconfident predictions in machine learning models can lead to serious consequences.
method Proposes flexible evidential deep learning (F-EDL) to model uncertainty over class probabilities using a flexible Dirichlet distribution.
result Empirically demonstrates state-of-the-art uncertainty quantification performance across diverse scenarios.

New method calibrates neural SBI to avoid overconfident posteriors.

problem Overconfident posteriors in SBI due to inaccurate uncertainty quantification.
method Introduces a calibration term into neural model training objective, enabling end-to-end backpropagation.
result Achieves competitive or better coverage and posterior density than existing methods.

A post-hoc framework improves model performance by calibrating different feature spaces.

problem Improving AUC performance on binary classification tasks for overconfident models.
method Identifies heterogeneous partitions of the feature space and applies post-hoc calibration techniques to each partition.
result Theoretical optimality of the framework for any model, demonstrated on deep neural networks.

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.

Improved Bayesian FL method calibrates predictions for federated learning.

problem Overconfident predictions in Bayesian FL methods for federated learning.
method β-Predictive Bayes algorithm interpolates between mixture and product of local predictive posteriors, tuning parameter β for better calibration.
result Demonstrated superior calibration compared to other baselines, even with increased data heterogeneity.

CoT-UQ improves LLM uncertainty quantification by integrating reasoning steps.

problem LLMs' overconfidence and lack of response-wise uncertainty quantification.
method Integrates LLMs' reasoning steps into uncertainty estimation.
result Significantly improves uncertainty quantification accuracy (5.9% AUROC improvement).

High-risk domains require reliable confidence estimates from predictive models. Deep latent variable models provide these, but suffer from the rigid variational distributions used for tractable inference, which err on the side of overconfidence. We propose Stochastic Quantized Activation Distributions (SQUAD), which im…

2018-10-12abs ↗pdf ↗

We focus on variational inference in dynamical systems where the discrete time transition function (or evolution rule) is modelled by a Gaussian process. The dominant approach so far has been to use a factorised posterior distribution, decoupling the transition function from the system states. This is not exact in gene…

2018-12-14abs ↗pdf ↗

Unified framework for hierarchical image classification with epistemic uncertainty.

problem Overconfident predictions and lack of logical consistency in deep learning models.
method Neurosymbolic approach with epistemic deep learning, using focal set reasoning and differentiable fuzzy logic.
result Maintains accuracy on par with transformer baselines while providing more calibrated and interpretable predictions.

This paper presents a general framework for studying diverse beliefs in dynamic economies. Within this general framework, the characterization of a central-planner general equilbrium turns out to be very easy to derive, and leads to a range of interesting applications. We show how for an economy with log investors hold…

2010-01-11abs ↗pdf ↗

ALIEN improves uncertainty estimation of language models by refining entropy-based methods.

problem Overconfidence in uncertainty estimation for language models, especially for difficult inputs.
method ALIEN refines entropy-based uncertainty by aligning it with prediction reliability, using a lightweight uncertainty head.
result ALIEN consistently outperforms strong baselines in detecting incorrect predictions and achieving the lowest calibration error.

ePF improves PF for ITS by balancing exploration and exploitation, outperforming baselines.

problem Premature exploitation in PF leads to suboptimal solutions under constrained budgets.
method Integrates Entropic Annealing and Look-ahead Modulation to preserve diversity and evaluate potential.
result Significant improvement in task reward (up to 50% relative) on math benchmarks.

Deep neural networks(NNs) have achieved impressive performance, often exceed human performance on many computer vision tasks. However, one of the most challenging issues that still remains is that NNs are overconfident in their predictions, which can be very harmful when this arises in safety critical applications. In …

2018-12-08abs ↗pdf ↗

Modern neural networks tend to be overconfident on unseen, noisy or incorrectly labelled data and do not produce meaningful uncertainty measures. Bayesian deep learning aims to address this shortcoming with variational approximations (such as Bayes by Backprop or Multiplicative Normalising Flows). However, current appr…

2017-11-03abs ↗pdf ↗

FDN improves probabilistic regressors' adaptability to distribution shifts.

problem Overconfidence in modern probabilistic regressors under distribution shift.
method FDN uses input-conditioned distributions over network weights, trained with a Monte Carlo beta-ELBO objective.
result FDN produces predictive mixtures whose dispersion adapts to the input, providing shift-aware uncertainty.

The paper analyzes uncertainty quantification in sparse Gaussian process regression with a Brownian motion prior.

problem Analyzing uncertainty in sparse Gaussian process regression with a Brownian motion prior.
method Theoretical guarantees and limitations for pointwise credible sets are derived for a rescaled Brownian motion prior with a sparse variational Gaussian process method.
result Theoretical characterization of asymptotic frequentist coverage for credible sets, distinguishing conservative and overconfident cases.