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

Trend · papers per month

94187281374 · Jun 202019922001200920172026
48 results for domain uncertainty

Unsupervised domain adaptation (UDA) aims at inferring class labels for unlabeled target domain given a related labeled source dataset. Intuitively, a model trained on source domain normally produces higher uncertainties for unseen data. In this work, we build on this assumption and propose to adapt from source to targ…

2019-07-25abs ↗pdf ↗

New method improves uncertainty estimation in Bayesian deep learning models.

problem Underestimation of predictive uncertainty in Neural Linear Models (NLMs).
method Proposes a novel training method to capture useful predictive uncertainties and incorporate domain knowledge.
result Traditional training procedures for NLMs can drastically underestimate uncertainty in data-scarce regions.

Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…

2019-06-24abs ↗pdf ↗

Paper develops a new method to improve model calibration under distribution shifts.

problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.

Incorporating domain knowledge into the modeling process is an effective way to improve learning accuracy. However, as it is provided by humans, domain knowledge can only be specified with some degree of uncertainty. We propose to explicitly model such uncertainty through probabilistic constraints over the parameter sp…

2012-05-09abs ↗pdf ↗

Study evaluates uncertainty in BP estimation from PPG signals under domain shift.

problem Uncertainty quantification in healthcare, especially for cuffless BP estimation.
method Compared deep ensembles, Monte Carlo dropout, and various recalibration techniques.
result Deep ensembles provide stronger robustness under domain shift.

Paper proposes a probabilistic alignment method for domain adaptation.

problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.

Simple method improves uncertainty estimation for distribution shifts.

problem Improving uncertainty estimation in deep image classification under distribution shifts.
method Exposing original model to corrupted images and performing simple statistical calibration.
result Superior performance on various distribution shifts and unsupervised domain adaptation tasks.

Generative model learns shape drift for quantifying domain uncertainty in hemodynamics.

problem Quantifying domain uncertainty in medical image segmentation for biomarker estimation.
method Conditional stochastic interpolant framework based on LDDMM registration.
result Generative model can create random perturbations of shapes for biomarker estimation.

This work introduces a bias-variance decomposition for proper scores, improving uncertainty estimation in predictive models.

problem Reliable uncertainty estimation for predictions in safety-critical applications, especially under domain drift.
method Developed a general bias-variance decomposition for proper scores, introducing the Bregman Information as the variance term.
result The decomposition provides novel formulations for different predictive tasks, including classification and model ensembles.

Proposes methods to aggregate prediction intervals for domain shift uncertainty.

problem Uncertainty quantification in distribution shifts.
method Aggregates prediction intervals for minimal width and adequate coverage.
result Effective methodologies for unsupervised domain shift under labeled source and unlabeled target.

Study pitfalls of deep learning ensembles in uncertainty estimation.

problem Pitfalls in in-domain uncertainty estimation and ensembling in deep learning.
method Exploration of standards for uncertainty quantification and broad study of ensembling techniques.
result Many sophisticated ensembling techniques are equivalent to a simple ensemble of few networks.

DS-CP improves reliability of uncertainty quantification for large language models under domain shift.

problem Overconfident and factually incorrect outputs (hallucinations) from large language models.
method Adapts conformal prediction to large language models under domain shift by reweighting calibration samples.
result DS-CP delivers more reliable coverage than standard conformal prediction, especially under substantial distribution shifts.

Deep learning models need accurate uncertainty quantification for safe use.

problem Uncertainty in deep learning models, especially for black box models.
method Model multivariate uncertainty for regression problems using neural networks, incorporating aleatoric and epistemic sources of heteroscedastic uncertainty. Train using direct multivariate Gaussian density loss function and end-to-end Kalman filter training.
result Accurate multivariate uncertainty quantification improves Kalman filter performance for in-domain and out-of-domain evaluation data.

CUQ-GNN adapts uncertainty quantification for graph data, improving on GPN.

problem Defining meaningful uncertainty on graph data with domain-specific characteristics.
method Combines Graph Neural Networks with Posterior Networks using Normalizing Flows.
result CUQ-GNN produces more flexible and effective uncertainty estimates.

VCoTTA uses variational Bayesian methods to adapt models under continuous domain shifts.

problem Error accumulation in continual test-time adaptation.
method VCoTTA employs variational Bayesian techniques to update a Bayesian Neural Network (BNN) during testing, combining priors from source and teacher models.
result VCoTTA effectively mitigates error accumulation in CTTA, as shown by experimental results on three datasets.

Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph setting can inform dictionary design for graph signals, lead to …

2016-03-10abs ↗pdf ↗

This paper analyzes the difficulty of unsupervised domain adaptation using information theory.

problem The challenge of unsupervised domain adaptation under covariate shift.
method Formulates the problem using a distribution π in the ground-truth triples (p, q, f), defines optimal learner performance, and introduces PTLU for quantifying difficulty.
result Characterizes the optimal learner and introduces PTLU as a measure of UDA difficulty.

CPATTA uses conformal prediction for efficient test-time adaptation.

problem Low data selection efficiency in existing ATTA methods.
method Conformal Prediction, online weight-update algorithm, domain-shift detector, staged update scheme.
result CPATTA consistently outperforms state-of-the-art methods by 5% in accuracy.

Gradient boosting can be seen as Gaussian process inference.

problem Improving uncertainty estimates in out-of-domain detection.
method Gradient boosting reformulated as a kernel method converging to Gaussian process inference.
result Gradient boosting can provide better uncertainty estimates through Monte-Carlo estimation of posterior variance.

A new method improves robustness in image translation by modeling uncertainty.

problem Performance degradation in image translation models due to lack of robustness to outliers and uncertainty.
method UGAC method based on Uncertainty-aware Generalized Adaptive Cycle Consistency, modeling per-pixel residual with generalized Gaussian distribution.
result Our method exhibits stronger robustness towards unseen perturbations in test data.

Algorithm calibrates predictions for covariate shift using domain adaptation.

problem Uncertainty estimates overestimate certainty when real-world data differs from training data.
method Uses importance weighting and learns a feature map to equalize distributions.
result Outperforms existing approaches in calibrated prediction when covariate shift occurs.

Discriminative active learning reduces data annotation costs for domain adaptation.

problem Conditional shift problem hinders domain adaptation between related but different domains.
method Three-stage active adversarial training: invariant feature space learning, uncertainty and diversity criteria, re-training with queried labels.
result Empirical comparisons show the proposed approach is more effective than existing methods.

Hybrid framework merges data and domain knowledge for better spatial interpolation.

problem Spatial interpolation overlooks domain knowledge and limits to spatial coordinates.
method Integrates data-driven features with rule-assisted spatial dependency function mapping.
result Superior performance in two application scenarios, capturing localized features.

Enhances uncertainty estimation in medical image segmentation.

problem Frequency-related noise in medical imaging leads to biased uncertainty estimates.
method Extends MC-Dropout to the frequency domain for better uncertainty estimation.
result MC-Frequency Dropout improves calibration and uncertainty in semantic segmentation.

Paper reduces uncertainty in predictive models using neural networks and Gaussian processes.

problem High epistemic uncertainty in predictive models.
method Adaptive sampling approach with prediction interval-generation neural networks and Gaussian processes.
result Method consistently converges faster to minimum epistemic uncertainty levels.

Bayesian neural networks incorporate domain knowledge through variational inference.

problem Specifying priors for Bayesian neural networks that capture domain knowledge is challenging.
method Proposes a framework for integrating domain knowledge into BNN priors through variational inference.
result BNNs with proposed domain knowledge priors outperform those with standard priors, achieving better predictive performance.

Bayesian framework for solar magnetogram super-resolution with uncertainty quantification.

problem Uncertainty in super-resolving solar magnetic field images.
method Bayesian decomposition of uncertainties into epistemic and aleatoric.
result Generation of maps measuring the range of possible high-resolution explanations.

This paper studies directed exploration for reinforcement learning agents by tracking uncertainty about the value of each available action. We identify two sources of uncertainty that are relevant for exploration. The first originates from limited data (parametric uncertainty), while the second originates from the dist…

2017-11-29abs ↗pdf ↗

PETAL adapts models to changing target domains over time.

problem Lifelong test-time adaptation in changing target domains.
method Probabilistic framework with student-teacher model and data-driven parameter restoration.
result PETAL achieves better results than state-of-the-art for online lifelong test-time adaptation.

CMCO provides robust uncertainty estimates for neural operators without retraining.

problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.