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

35810 · Jun 202519922001200920172026
48 results for Uncertainty-Aware

SPACR trains uncertainty-aware regressors directly within a single pass, improving efficiency and validity.

problem Training uncertainty-aware regressors while maintaining efficiency and validity.
method Joint optimization of efficiency and validity during training.
result SPACR consistently provides tighter intervals and better coverage-efficiency trade-offs compared to standard CP and DOICR.

Proposes a novel graph self-training method with EM regularization for semi-supervised node classification.

problem Handles noisy graph structures and feature spaces in semi-supervised node classification.
method Introduces an Expectation-Maximization (EM) regularization scheme for uncertainty-aware pseudo-label generation and model retraining.
result Significantly outperforms strong baselines by up to 2.5% in accuracy.

IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.

problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.

Proposes a new framework for uncertainty-aware LLM post-training.

problem Heterogeneous, conflicting data in large language models.
method α-Rényi variational framework for learning distributions over post-training parameters.
result Enables training examples to be softly routed across ensemble members, promoting model specialisation and providing uncertainty estimates.

Model-based reinforcement learning has the potential to be more sample efficient than model-free approaches. However, existing model-based methods are vulnerable to model bias, which leads to poor generalization and asymptotic performance compared to model-free counterparts. In addition, they are typically based on the…

2019-06-25abs ↗pdf ↗

A framework for uncertainty-aware multimodal learning using conformal Shapley intervals.

problem Uncertainty and modality level importance in multimodal learning.
method Introduces conformal Shapley intervals to quantify modality level importance and uncertainty.
result Demonstrates meaningful uncertainty quantification and strong predictive performance.

Study improves LLMs for PPI analysis by addressing uncertainty.

problem Uncertainty in LLM predictions for PPIs.
method Fine-tuned LLaMA-3 and BioMedGPT models, LoRA ensembles, Bayesian LoRA for UQ.
result Competitive PPI identification performance across diverse disease contexts.

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.

UBMF tackles fault diagnosis in imbalanced industrial data with enhanced accuracy and adaptability.

problem Fault diagnosis challenges in imbalanced industrial data.
method Integrates four key modules: data perturbation, cross-task feature extraction, uncertainty-based filtering, and Bayesian meta-knowledge integration.
result Achieves an average improvement of 42.22% across ten diagnostic tasks.

Develops geometric framework for uncertainty-aware multi-class classification.

problem Silent failure of AI models when uncertain, especially in multi-class settings.
method Geometric framework treating probability vectors as points on the (c1)(c-1)-dimensional probability simplex, using Fisher--Rao metric for calibration and uncertainty quantification.
result Empirical validation shows 72.5% of errors captured while deferring 34.5% of ambiguous predictions, reducing automated decision error rates from 16.8% to 6.9%.

A scalable framework selects top factors from CAE latent factors for better portfolio optimization.

problem Limited latent factor dimension in CAE models degrades performance.
method Couple high-dimensional CAE with uncertainty-aware factor selection.
result Pruning strategy delivers substantial gains in risk-adjusted performance.

New method tackles label noise on imbalanced datasets by considering class-specific uncertainty.

problem Label noise and class imbalance in imbalanced datasets.
method Epistemic and aleatoric uncertainty-aware class-specific noise modeling.
result Proposed ULC framework improves performance on imbalanced datasets.

A simple approach to obtaining uncertainty-aware neural networks for regression is to do Bayesian linear regression (BLR) on the representation from the last hidden layer. Recent work [Riquelme et al., 2018, Azizzadenesheli et al., 2018] indicates that the method is promising, though it has been limited to homoscedasti…

2019-12-14abs ↗pdf ↗

NADS improves OoD detection accuracy by 57%.

problem Uncertainty in machine learning models when encountering out-of-distribution data.
method NADS searches for a distribution of architectures that perform well on a given task, optimizing a stochastic OoD detection objective.
result NADS achieves up to 57% improvement in accuracy over state-of-the-art methods.

The paper extends explainability methods to uncertainty-aware models, revealing feature impacts on predictive entropy and likelihood.

problem Understanding the factors contributing to uncertainty in probabilistic models.
method Adapting permutation feature importance, partial dependence plots, and individual conditional expectation plots to measure feature impacts on predictive entropy and likelihood.
result Novel insights into model behaviour and feature impacts on uncertainty are obtained.

GOIMDA selects inputs to maximize expected influence on a goal functional, reducing data acquisition needs.

problem Challenges in active data acquisition for learning and optimization tasks in deep neural networks.
method GOIMDA uses inverse curvature and goal gradient to select inputs maximizing expected influence on a specified goal functional.
result GOIMDA achieves target performance with fewer labeled samples or function evaluations compared to baselines.

Estimating statistical uncertainties allows autonomous agents to communicate their confidence during task execution and is important for applications in safety-critical domains such as autonomous driving. In this work, we present the uncertainty-aware imitation learning (UAIL) algorithm for improving end-to-end control…

2019-05-07abs ↗pdf ↗

UAPCA projects uncertain data to low dimensions using GMMs.

problem Uncertain multidimensional data not well described by normal distributions.
method Model data with Gaussian mixture models, derive UAPCA projection from general formulation.
result Low-dimensional projections better represent multidimensional distributions.

UTE improves reinforcement learning by measuring action uncertainty, enhancing policy learning efficiency.

problem Degrading performance of action repetition in reinforcement learning, especially with sub-optimal actions.
method UTE uses ensemble methods to measure uncertainty during action extension, allowing strategic exploration or certainty.
result UTE outperforms existing action repetition algorithms, significantly enhancing policy learning efficiency.

DINOSAUR improves retrieval by accounting for embedding uncertainty in recommender systems.

problem Retrieval bias towards popular items due to noisy embeddings.
method Samples multiple embeddings per item and queries with sampled embeddings to account for uncertainty.
result Improves coverage of long-tail niche content without sacrificing recall.

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.

Attention mechanism is effective in both focusing the deep learning models on relevant features and interpreting them. However, attentions may be unreliable since the networks that generate them are often trained in a weakly-supervised manner. To overcome this limitation, we introduce the notion of input-dependent unce…

2018-05-24abs ↗pdf ↗

Enhances reinforcement learning uncertainty estimation with a generalized Gaussian error model.

problem Inaccurate error representations and compromised uncertainty estimation in conventional uncertainty-aware TD learning.
method Introduces a novel framework for generalized Gaussian error modeling in deep reinforcement learning, incorporating higher-order moments, particularly kurtosis, to improve uncertainty estimation and mitigation.
result Significant performance gains in policy gradient algorithms with the proposed framework.

UA-SABI uses surrogates to speed up Bayesian inference for expensive models.

problem Inference for computationally expensive models is slow and uncertain.
method Combines surrogate modeling with Amortized Bayesian Inference (ABI) to propagate uncertainties.
result Reliable, fast, and repeated Bayesian inference for expensive models is achieved.

We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantag…

2019-05-03abs ↗pdf ↗

USeMOC framework reduces expensive simulations for MO optimization with constraints.

problem Efficiently optimizing multi-objective problems with constraints using expensive function evaluations.
method USeMOC framework uses surrogate models to identify promising candidates and selects the best based on uncertainty.
result USeMOC achieves more than 90% reduction in function evaluations for circuit optimization.

A new probabilistic polygonal curve representation using Gaussian Mixture Models.

problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.

New framework identifies and reduces errors in machine learning under distribution shift.

problem Errors in machine learning models when distributions change.
method Developed a principled framework to characterize and eliminate epistemic errors in imperfect multitask learning.
result Provided a decompositional epistemic error bound for general settings of distribution shift.

Proposes a new model for time-to-event prediction with uncertainty quantification.

problem Lack of uncertainty in time-to-event predictions using recurrent neural networks.
method Deep Kernel Accelerated Failure Time models combining RNN and sparse Gaussian Process.
result Model delivers better uncertainty estimates compared to related methods.

Improved stock selection through predictive fundamentals and uncertainty estimates.

problem Selecting stocks based on future financial data to outperform traditional factor models.
method Train deep nets to forecast future fundamentals, incorporate uncertainty estimates, and adjust portfolios to manage risk.
result Simulated annualized return of 17.7% and Sharpe ratio of 0.84 for uncertainty-aware model, significantly higher than 14.0% and 0.52 for standard factor models.

UAG defends GNNs against adversarial attacks by quantifying and explaining uncertainties.

problem Lack of uncertainty quantification in GNNs makes them vulnerable to adversarial attacks.
method UAG uses Bayesian Uncertainty Technique (BUT) and Uncertainty-aware Attention Technique (UAT).
result UAG outperforms state-of-the-art solutions in defending adversarial attacks on GNNs.

Semi-supervised GANs with log-signatures improve credit card fraud detection.

problem Detecting fraud in large, complex financial transaction data streams.
method Conditional GANs with Bayesian inference and log-signatures for robust feature encoding.
result Consistent improvements over benchmarks in global and domain-specific metrics.

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.

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.