New BNN architectures reduce computational cost for uncertainty quantification.
problem High computational cost in Bayesian neural networks.
method Partial trace-class Bayesian neural networks (PaTraC BNNs).
result Comparable uncertainty quantification with fewer parameters.
A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.
problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.
New method quantifies uncertainty at class level for better decision-making.
problem Improving cost-sensitive decision-making in classification tasks.
method Label-wise decomposition of uncertainty measures based on non-categorical metrics.
result Proposed measures adhere to desirable properties and improve uncertainty quantification.
Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.
problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.
A new method reduces Volterra kernel complexity and uncertainty quantification.
problem Challenges in modeling nonlinear systems with Volterra series due to high model order.
method Bayesian Tensor Network Volterra kernel machines (BTN-V) using canonical polyadic decomposition.
result Competitive accuracy, enhanced uncertainty quantification, and reduced computational cost.
New method improves GP uncertainty quantification for misspecified priors.
problem Uncertainty quantification for GPs under incorrect priors.
method Constructs a confidence sequence using martingale techniques.
result Empirically outperforms standard GP methods in robustness and utility for Bayesian Optimization.
Bayesian neural networks struggle with accuracy and uncertainty quantification in complex models.
problem Challenges in achieving high predictive performance and reliable uncertainty estimates in Bayesian neural networks.
method Investigates computational costs, accuracy, and uncertainty quantification in Bayesian neural networks with different inference techniques.
result Variational inference provides better uncertainty quantification than Markov chain Monte Carlo, and stacking/ensembling variational approximations can achieve similar accuracy at reduced cost.
Neural Bootstrapper reduces bootstrapping cost for deep neural networks.
problem Computational burden in bootstrapping deep neural networks.
method Neural Bootstrapper learns to generate bootstrapped neural networks through single model training.
result Neural Bootstrapper outperforms bagging methods with lower computational cost.
Proposes a new cost function for neural networks to improve prediction interval quality.
problem Uncertainty-guided neural network training convergence issues and suboptimal prediction intervals.
method Proposes a customizable smooth cost function for NNs to optimize prediction intervals.
result Significant improvement in prediction interval quality, convergence, and reliability.
Bayesian deep learning tackles uncertainty in high-dimensional systems.
problem Uncertainty quantification in high-dimensional stochastic partial differential equations.
method Bayesian neural network (BNN) and Hamiltonian Monte Carlo (HMC) for efficient sampling of posterior distributions.
result The method efficiently handles high-dimensional problems with almost independent computational cost.
PE-GQNN improves spatial data prediction and uncertainty quantification.
problem Poor calibration of predictive distributions in spatial data models.
method Combines PE-GNNs with Quantile Neural Networks and recalibration techniques.
result PE-GQNN outperforms existing methods in predictive accuracy and uncertainty quantification.
Machine learning combines high- and low-fidelity models for efficient uncertainty quantification and optimization.
problem Efficiently combining high- and low-fidelity models for uncertainty quantification and optimization.
method Machine learning-based multi-fidelity methods for uncertainty quantification and optimization.
result Unified perspective on multi-fidelity priors for optimization.
New method for neural network uncertainty quantification using empirical Neural Tangent Kernel.
problem Accurately quantify uncertainty in neural network predictions.
method Post-hoc, sampling-based approach using gradient-descent on linearized networks.
result Method effectively approximates Gaussian process posterior and outperforms existing methods in efficiency and accuracy.
Modern weather forecast models perform uncertainty quantification using ensemble prediction systems, which collect nonparametric statistics based on multiple perturbed simulations. To provide accurate estimation, dozens of such computationally intensive simulations must be run. We show that deep neural networks can be …
Regularization helps resolve ambiguity in mean-variance models, improving predictive uncertainty quantification.
problem Signal-to-noise ambiguity in overparameterized mean-variance models.
method Statistical field theory framework to explain phase transition.
result Regularization reduces variability and improves predictive uncertainty quantification.
The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.
problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.
Study questions the reliability of uncertainty quantification in evidential deep learning.
problem Reliability of uncertainty quantification in evidential deep learning.
method Analysis of evidential deep learning methods, revealing their limitations and interpreting them as out-of-distribution detection algorithms.
result EDL methods are unreliable in quantifying uncertainty, even when effective on downstream tasks.
SVB method provides scalable Bayesian proportional hazards model for high-dimensional gene expression data.
problem Bayesian methods for high-dimensional sparse survival data often sacrifice uncertainty quantification or computational scalability.
method Mean-field variational approximation for scalable Bayesian proportional hazards model.
result SVB method offers posterior distribution for parameters and variable selection via posterior inclusion probabilities.
This paper tackles reliability analysis for stochastic systems using surrogate models.
problem Traditional reliability analysis relies on deterministic models, which are not suitable for stochastic systems with non-repeatable outcomes.
method The paper introduces reliability analysis for stochastic models by using generalized lambda models and stochastic polynomial chaos expansions as surrogate models to lower computational cost.
result The surrogate models enable efficient uncertainty quantification at a lower cost than traditional Monte Carlo simulation.
In point-based sensing systems such as coordinate measuring machines (CMM) and laser ultrasonics where complete sensing is impractical due to the high sensing time and cost, adaptive sensing through a systematic exploration is vital for online inspection and anomaly quantification. Most of the existing sequential sampl…
Bayesian optimization reduces materials design costs by 10x.
problem Expensive materials design search space with mixed variables.
method Uncertainty-aware machine learning models for mixed numerical and categorical variables.
result Frequentist and Bayesian models perform differently in mixed-variable BO.
A new method quantifies uncertainty in brain injury simulations.
problem High computational cost and high-dimensional inputs/outputs limit traditional UQ methods for biofidelic head models.
method Two-stage, data-driven manifold learning framework using Gaussian kernel-density estimation, diffusion maps, and Grassmannian diffusion maps.
result Surrogate models reduce computational cost while providing highly accurate approximations of the computational model.
Optimal transport and neural networks improve trade modeling accuracy.
problem Capturing subtler drivers of trade beyond supply and demand.
method Employing optimal transport and deep neural networks to learn a time-dependent cost function from data.
result Consistently outperforms traditional gravity models in accuracy.
New method improves uncertainty estimation in complex statistical models.
problem Challenges in estimating high-dimensional mixed models due to computational complexity.
method Partially factorized variational inference to relax mean-field assumption.
result Relaxed variational inference provides accurate uncertainty quantification without high computational cost.
Paper uses PCE to quantify ML model and input uncertainties.
problem Accurately quantify and propagate combined uncertainties in ML predictions.
method Polynomial Chaos Expansion (PCE) for joint input and model uncertainty.
result Efficient and accurate calculation of output variability and sensitivity.
Develops a deterministic method to approximate NSDEs for better uncertainty quantification.
problem Computational infeasibility of obtaining well-calibrated uncertainty from NSDEs.
method Bidimensional moment matching algorithm for approximating NSDE transition kernel.
result Deterministic approximation improves uncertainty calibration and prediction accuracy.
New methods quantify uncertainties in AI weather forecasts.
problem Uncertainty in AI weather predictions.
method Comparing ensemble and post-hoc uncertainty quantification methods.
result Probabilistic forecasts improve over ensemble physics-based models.
Study wSAA for contextual decisions, improving uncertainty quantification under computational constraints.
problem Uncertainty quantification limitations in wSAA for contextual stochastic optimization.
method Establish central limit theorems and asymptotic-normality-based confidence intervals for optimal costs.
result Over-optimizing can mitigate misspecification and preserve asymptotic normality, albeit at a slower convergence rate.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.
Neural networks simplify uncertainty quantification of locally nonlinear systems.
problem Estimating statistics of responses in large-scale locally nonlinear dynamical systems.
method Decomposes response into nominal linear system and a neural network-estimated pseudoforce.
result Neural networks can efficiently estimate pseudoforce containing nonlinear and uncertain information.
Last-layer approximation improves UQ performance without sacrificing computational efficiency.
problem Epistemic uncertainty quantification for deep neural networks.
method Comparison of full-network and last-layer linearization using theoretical and empirical approaches.
result Last-layer approximation yields comparable UQ performance with improved computational efficiency.
Study evaluates machine learning methods for uncertainty quantification in complex systems.
problem Accurately quantify epistemic and aleatoric uncertainties in complex dynamical systems.
method Examined Gaussian processes, UQ-augmented neural networks (ENN, BNN, D-NN, G-NN) on two model data sets.
result Concluded on model architecture and hyperparameter tuning for improved UQ accuracy.
A Gaussian Process Ordinary Differential Equation framework for large continuous dynamical systems
problem Forecasting complex dynamical systems
method Kernel autonomous ODE approach based on Gaussian Processes and Quadratic Order Model Reduction
result Full model outperforms ROM methods in terms of accuracy or computational costs
Paper develops new conformal prediction methods for sum or average of unknown labels.
problem Uncertainty quantification in joint distributions of random variables.
method Introduces novel conformal prediction methods for sum or average of unknown labels.
result Validates the proposed method for sum or average of unknown labels under permutation invariant assumptions.
Fast algorithm solves BVPs in linear time with probabilistic uncertainty.
problem Solving boundary value problems efficiently and accurately.
method Gauss--Markov prior tailored to BVPs, linear-time computation.
result Probabilistic solution with linear time complexity and comparable quality.
This work frames active inference through control as inference, offering robust control algorithms.
problem Active inference framework lacks practical sensorimotor control algorithms.
method Frame active inference through control as inference, presenting trajectory optimization as inference.
result AI may be framed as partially-observed CaI when the cost function is defined in observation states.
Paper tackles infinite-dimensional optimization and Bayesian learning for stochastic differential equations.
problem Learning the drift function of stochastic differential equations with uncertainty quantification.
method Combines infinite-dimensional optimization results with Bayesian hierarchical framework, incorporating shrinkage priors for sparse learning.
result Systematic approach for accurate learning of stochastic differential equations with uncertainty quantification.
A new method for streaming PCA provides confidence intervals for eigenvector entries.
problem Uncertainty quantification for individual entries in streaming PCA.
method Oja's algorithm, Bernstein-type concentration bound, Central Limit Theorem, subsampling algorithm.
result Sharp concentration bound and Central Limit Theorem for streaming PCA entries.
Bayesian framework for identifying localized regions of interest in dynamical systems.
problem Identifying regions of high-resolution uncertainty quantification in complex dynamical systems.
method Bayesian inference with Gaussian process surrogate and polynomial chaos expansion.
result Unified computational scheme reduces overall cost for uncertainty quantification.
Statistical test evaluates if personalizing interventions is cost-effective.
problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.
Several multiscale methods account for sub-grid scale features using coarse scale basis functions. For example, in the Multiscale Finite Volume method the coarse scale basis functions are obtained by solving a set of local problems over dual-grid cells. We introduce a data-driven approach for the estimation of these co…
This paper studies uncertainty quantification in deep spatiotemporal forecasting.
problem Uncertainty quantification in deep spatiotemporal forecasting models.
method Analysis of UQ methods from Bayesian and frequentist perspectives, including statistical decision theory.
result Different UQ methods have different strengths and weaknesses, with Bayesian methods being more robust in mean prediction and frequentist methods providing more extensive coverage.
A new method to predict uncertainties in trained neural networks.
problem Reliability of trained neural networks outside their training domain.
method Prediction rigidities as a constrained optimization problem.
result Cheap uncertainties without modifying neural networks.
Surrogate models help predict complex systems with less computational cost.
problem Uncertainty in complex systems due to variability and external loads.
method Surrogate models trained on limited simulations to approximate full time-dependent response.
result Efficient surrogate models reduce computational expense for UQ in nonlinear dynamics.
FA-LD algorithm improves uncertainty quantification and mean predictions in federated learning.
problem Uncertainty quantification and mean predictions in federated learning with distributed clients.
method FA-LD algorithm for strongly log-concave distributions with non-i.i.d data, considering general models.
result The FA-LD algorithm provides theoretical guarantees for convergence and optimal noise injection.
Efficient BNNs learn latent distributions for robust uncertainty quantification.
problem Improving robustness and uncertainty of deep neural networks.
method LP-BNN uses VAEs to learn latent distributions of BNN parameters, enabling efficient ensembles.
result LP-BNN achieves competitive results in image classification, semantic segmentation, and out-of-distribution detection.
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).
A scalable framework uses Langevin sampling to approximate neural network models of evolving processes.
problem Uncertainty quantification in neural network models of dynamic systems.
method Flexible data model based on NODE, joint learning of data model and posterior parameters, Langevin sampling.
result Demonstrated performance on chemical reaction and material physics data, compared favorably to variational inference.