Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.
problem Quantifying predictive uncertainty for multi-object detection in safety-critical applications.
method Developed a two-step conformal prediction approach to propagate uncertainty in predicted class labels into bounding box uncertainties, ensuring coverage for incorrectly classified objects.
result Desired coverage levels are satisfied with practically tight predictive uncertainty intervals on real-world datasets.
Novel MOBO method for risk measures under input uncertainty.
problem Efficiently identifying Pareto front for black-box functions with input uncertainty.
method Assumes Gaussian process model and constructs bounding boxes for risk measures.
result The method can return an arbitrary-accurate solution with high probability.
In many safety-critical applications such as autonomous driving and surgical robots, it is desirable to obtain prediction uncertainties from object detection modules to help support safe decision-making. Specifically, such modules need to estimate the probability of each predicted object in a given region and the confi…
Optimum-statistical collaboration improves black-box optimization efficiency.
problem Improving black-box optimization efficiency through better statistical collaboration.
method Introducing optimum-statistical collaboration framework for hierarchical bandits-based optimization.
result Demonstrated improved regret bounds and better performance in experiments.
A new method optimizes robustness measures under input uncertainty using randomized Gaussian process upper confidence bound.
problem Optimizing robustness measures under input uncertainty.
method Randomized robustness measure GP-UCB (RRGP-UCB) that samples β from a chi-squared-based distribution.
result RRGP-UCB provides tight bounds on expected regret.
Estimates uncertainty in bounding box regression for object detection.
problem Reliable deployment of deep object detectors in safety-critical tasks.
method Training variance networks with energy score as a proper scoring rule.
result Energy score leads to better calibrated and lower entropy predictive distributions.
New method optimizes black-box functions using generative models and Wasserstein distance.
problem Optimizing black-box functions with stochastic responses in high dimensions.
method Deep generative surrogate models and Wasserstein distance for uncertainty estimation.
result Method outperforms state-of-the-art methods in robustness to function shape and stochasticity.
This work investigates uncertainty quantification for black-box large language models in natural language generation.
problem Lack of trustworthiness in responses generated by black-box large language models.
method Differentiated uncertainty vs confidence, proposed and compared several confidence/uncertainty measures, applied to selective NLG.
result A simple measure for semantic dispersion can predict the quality of LLM responses.
Paper presents a method to disrupt deep uncertainty estimation without affecting accuracy.
problem Uncertainty estimation in deep neural networks for risk-sensitive applications.
method A novel attack that cripples uncertainty estimation without reducing accuracy.
result The attack causes the network to be more confident in incorrect predictions than correct ones.
Proposes a Bayesian approach to explain, justify, and quantify uncertainty in DNNs.
problem Lack of transparency and confidence in DNNs for critical applications.
method Bayesian approach to extract explanations, justifications, and uncertainty estimates from black box DNNs.
result Improves interpretability and reliability of DNNs, validated on CIFAR-10.
Optimizes latent space of VAEs using decoder uncertainty to generate valid objects.
problem Lack of robustness in optimizing VAE latent space for black-box properties.
method Importance sampling-based estimator of decoder epistemic uncertainty to guide optimization.
result Improves trade-off between black-box objective and validity of generated samples.
Adapts Bayesian optimization for mixed constraints in aircraft design.
problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.
Predicting not only the target but also an accurate measure of uncertainty is important for many machine learning applications and in particular safety-critical ones. In this work we study the calibration of uncertainty prediction for regression tasks which often arise in real-world systems. We show that the existing d…
Bayesian optimization tackles uncertainty in context variables.
problem Sequential decision-making under context distributional uncertainty.
method Wasserstein Distributionally Robust Bayesian Optimization.
result Sublinear regret bounds matching state-of-the-art results.
Pseudo-Bayesian Optimization improves black-box function optimization using simple local regression.
problem Optimizing expensive black-box functions with uncertainty quantification.
method Axiomatic framework for convergence guarantees, combined with simple local regression and randomized prior.
result Empirically superior algorithms outperform state-of-the-art benchmarks in various applications.
Bayesian optimization enhanced with conformal prediction for better outcome reliability.
problem Uncertainty and model misspecification in Bayesian optimization.
method Conformal prediction to provide coverage guarantees and Bayesian optimization to select queries.
result Significant improvement in query coverage without sacrificing sample-efficiency.
Proposes non-exchangeable conformal risk control for better uncertainty bounds.
problem Handling non-exchangeable data in black-box models for better risk control.
method Leverages and extends split conformal prediction and monotone loss function approaches.
result Allows controlling expected value of any monotone loss function for non-exchangeable data.
Optimizing expensive black-box systems with limited data is an extremely challenging problem. As a resolution, we present a new surrogate optimization approach by addressing two gaps in prior research -- unimportant input variables and inefficient treatment of uncertainty associated with the black-box output. We first …
Risk Advisor predicts and mitigates ML deployment failures.
problem Predicting and mitigating test-time failure risks of ML systems.
method Post-hoc meta-learner for estimating failure risks and uncertainties.
result Reliably predicts deployment-time failure risks across various ML models.
Adaptive uncertainty quantification improves black-box model predictions in generative AI.
problem Improving uncertainty quantification for black-box models in generative AI.
method Adaptive partitioning and local calibration of conformity scores.
result Local tightening of uncertainty sets with adaptive bands.
ENTMOOT integrates tree models for better decision-making and optimization.
problem Difficult optimization of tree models and lack of reliable uncertainty measures.
method Integrates already trained tree models into optimization problems with a reliable uncertainty measure.
result Proves globally optimal solutions for optimization problems.
DiBO uses diffusion models to optimize high-dimensional black-box functions efficiently.
problem Optimizing high-dimensional and complex black-box functions efficiently.
method DiBO iterates two stages: training a diffusion model and casting candidate selection as posterior inference.
result DiBO outperforms state-of-the-art baselines across synthetic and real-world tasks.
A new error bound improves safety in Bayesian optimization.
problem Ensuring safety in Bayesian optimization with probabilistic models.
method Introducing a novel error bound using Wiener kernel regression for Gaussian processes and noise.
result The new error bound provides larger safety regions than previous methods.
Conformal prediction improves signal detection accuracy in railway images.
problem Improving the reliability of machine learning models for railway signal detection.
method Applying conformal prediction to a novel dataset of train operator perspective images.
result The approach enhances the reliability of machine learning models for detecting railway signals.
Unified framework for scalable black-box optimization.
problem Expensive black-box evaluations in scientific and engineering domains.
method Integrates active learning, multi-armed bandits, and distributed computing.
result Consistently outperforms state-of-the-art black-box optimizers.
Conformal prediction provides distribution-free uncertainty quantification for black-box models.
problem Uncertainty quantification for high-risk machine learning applications.
method Conformal prediction creates valid uncertainty sets without distributional assumptions.
result Sets contain the ground truth with a specified probability, e.g., 90%.
In this letter, we consider the problem of recovering an unknown sparse signal from noisy linear measurements, using an enhanced version of the popular Elastic-Net (EN) method. We modify the EN by adding a box-constraint, and we call it the Box-Elastic Net (Box-EN). We assume independent identically distributed (iid) r…
New method for time series prediction with uncertainty quantification.
problem Uncertainty quantification for multi-dimensional time series predictions.
method Flow-based conformal prediction for time series.
result Significantly smaller prediction sets with target coverage.
Data-driven methods for improving turbulence modeling in Reynolds-Averaged Navier-Stokes (RANS) simulations have gained significant interest in the computational fluid dynamics community. Modern machine learning algorithms have opened up a new area of black-box turbulence models allowing for the tuning of RANS simulati…
Paper proposes an efficient method for bounding box annotation in object detection.
problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.
We derive a novel sensitivity analysis of input variables for predictive epistemic and aleatoric uncertainty. We use Bayesian neural networks with latent variables as a model class and illustrate the usefulness of our sensitivity analysis on real-world datasets. Our method increases the interpretability of complex blac…
LLMs generate answers under incomplete context, and their uncertainty should scale with missing information.
problem Evaluating the quality of LLM answers under incomplete context.
method A controlled framework with varying context availability, and two uncertainty measures (sampling-based confidence and response entropy) evaluated on SQuAD.
result Response entropy increases with context removal and explains more variance in accuracy than confidence, suggesting it is a more responsive uncertainty measure.
Optimizes sampling for faster convergence in Bayesian experimental design and uncertainty quantification.
problem Efficiently selecting samples for faster convergence in Bayesian experimental design and uncertainty quantification.
method Output-weighted acquisition functions leveraging likelihood ratio to guide sampling towards relevant regions.
result Superiority of the proposed method in uncertainty quantification and rare event identification.
Paper introduces active Bayesian method for assessing black-box classifiers efficiently.
problem Need to assess performance of black-box classifiers reliably with limited labels.
method Develops inference strategies and proposes active Bayesian framework for efficient instance selection.
result Significant gains in performance assessment with fewer labels compared to traditional methods.
Existing deep active learning algorithms achieve impressive sampling efficiency on natural language processing tasks. However, they exhibit several weaknesses in practice, including (a) inability to use uncertainty sampling with black-box models, (b) lack of robustness to labeling noise, and (c) lack of transparency. I…
Nowadays, the use of machine learning models is becoming a utility in many applications. Companies deliver pre-trained models encapsulated as application programming interfaces (APIs) that developers combine with third party components and their own models and data to create complex data products to solve specific prob…
When approximating a black-box function, sampling with active learning focussing on regions with non-linear responses tends to improve accuracy. We present the FLOLA-Voronoi method introduced previously for deterministic responses, and theoretically derive the impact of output uncertainty. The algorithm automatically p…
Divide-and-conquer framework speeds up black-box inference for large data.
problem Computational intractability of uncertainty quantification for expensive data simulation.
method Divide data into partitions, train on a subset, bootstrap on partitions, combine results.
result Feasibility of estimating max-stable process parameters with tens of thousands of locations.
BARK optimizes black-box functions using Bayesian Additive Regression Trees.
problem Bayesian optimization of complex, black-box functions with uncertainty quantification.
method BART Kernel using tree agreement for posterior over piecewise-constant functions, explored using MCMC.
result BARK obtains samples of Gaussian processes for function distributions, enabling acquisition functions for optimization.
New algorithms for optimizing functions with noisy feedback, even when the model is misspecified.
problem Optimizing a black-box function with noisy bandit feedback, especially when the model is misspecified.
method Developed two algorithms based on Gaussian process methods: EC-GP-UCB and Phased GP Uncertainty Sampling.
result Achieved optimal dependence on misspecification error without prior knowledge, and effective in stochastic contextual settings.
Deep Learning models are vulnerable to adversarial examples, i.e.\ images obtained via deliberate imperceptible perturbations, such that the model misclassifies them with high confidence. However, class confidence by itself is an incomplete picture of uncertainty. We therefore use principled Bayesian methods to capture…
Though black-box predictors are state-of-the-art for many complex tasks, they often fail to properly quantify predictive uncertainty and may provide inappropriate predictions for unfamiliar data. Instead, we can learn more reliable models by letting them either output a prediction set or abstain when the uncertainty is…
The paper introduces a method to assess the reliability of model explanations.
problem Assessing the quality and reliability of model explanations.
method An Ordinal Consensus Approach using diverse bootstrapped surrogate explainers.
result Uncertainty estimates offer actionable insights beyond standard surrogate explainers.
Proposes φ-table for statistical SHAP explanations in regression models.
problem Lack of clear directional summaries, uncertainty, and fidelity in SHAP feature importance.
method SHAP importance selection, fitting a standardized linear surrogate, reporting coefficients, uncertainty, fidelity, and stability.
result Extends SHAP into a statistical global explanation with direction, uncertainty, fidelity, and stability.
Bayesian Neural Networks help quantify uncertainty in deep learning predictions.
problem Uncertainty quantification in deep learning predictions.
method Bayesian statistics applied to neural networks.
result Design, implementation, training, and evaluation of Bayesian Neural Networks.
No-regret optimization for time-varying functions using uncertainty injection.
problem Optimizing time-varying functions with no-regret in bandit feedback.
method W-SparQ-GP-UCB, incorporating uncertainty injection and additional queries.
result Achieves no-regret with a vanishing number of additional queries per iteration.
TVR optimizes black-box simulators by targeting variance reduction over control and noise parameters.
problem Optimizing black-box simulators with uncertain parameters.
method Targeted Variance Reduction (TVR) method that optimizes (x,θ) jointly. result Improved robust optimization performance over state-of-the-art methods.
Bayesian optimisation improves with fully-Bayesian treatment of hyperparameters.
problem Overconfident model predictions in BO due to ignoring hyperparameter uncertainty.
method Investigate FBBO using three approximate inference schemes compared to maximum likelihood approach.
result FBBO using EI with an ARD kernel leads to best performance in noise-free setting.