ACFS optimizes spectral risk under decision-dependent uncertainty using adaptive forest sampling.
problem Minimizing spectral risk with decision-dependent uncertainty.
method ACFS integrates Generalised Random Forests, CEM-guided exploration, rank-weighted augmentation, and multi-start refinement.
result ACFS achieves lowest median oracle spectral risk on both benchmarks.
Adaptive learning method for stochastic programs with latent uncertainty.
problem Stochastic programming problems with implicitly decision-dependent uncertainty.
method Adaptive learning-based surrogate method integrating simulation and statistical estimates.
result Established non-asymptotic convergence rate analysis for enhanced stability and efficiency.
Stochastic algo learns from evolving data, achieving optimal performance.
problem Performative prediction and multiplayer extensions.
method Stochastic approximation with decision-dependent distributions.
result Asymptotic normality and optimality of the algorithm's performance.
A new Thompson Sampling framework handles uncertainty by imputing missing data.
problem Handling uncertainty in contextual bandit problems.
method Generative model to impute missing outcomes, fit policy, and select actions.
result Established a state-of-the-art regret bound that depends on generative model quality.
Analyzes how learning algorithms affect and are affected by data manipulation.
problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.
New approach uses deep generative models for inventory and pricing decisions.
problem Data-driven inventory and pricing decisions in feature-based newsvendor problems.
method Conditional deep generative models (cDGMs) to learn demand distribution and generate probabilistic forecasts.
result Effective in optimizing inventory and pricing decisions, with theoretical guarantees and real-world applications.
This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.
problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.
Simple policy outperforms complex ones in cloud auto-scaling.
problem Predicting resource scaling for large-scale cloud applications with limited deployment throughput.
method Probabilistic workload forecast for auto-scaling decisions based on risk aversion.
result The proposed policy outperforms sophisticated and simple benchmark policies in real-world and synthetic data.
POLA adapts learning rates for online time series prediction.
problem Adapting to changing data distributions in dynamic environments.
method Adaptive learning rate regulation for recurrent neural networks.
result POLA outperforms other online prediction methods in real-world datasets.
A new algorithm uses concavity in Gaussian processes to optimize decisions in bandit problems.
problem Optimizing decisions in sequential problems with context-dependent rewards.
method Proposes a UCB algorithm using a shape-constrained reward function estimator based on a Gaussian Process model with concavity constraints.
result Derives regret bounds for the proposed UCB algorithm.
A new deep learning model for tabular data improves accuracy over GBDT.
problem Improving accuracy in tabular data classification.
method Differentiable forest with sparse attention mechanism.
result The differentiable forest achieves higher accuracy than GBDT on tabular datasets.
Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.
problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.
New model optimizes assortment and pricing with dynamic customer arrivals.
problem Suboptimal decisions in classical models due to fixed arrival rates.
method Poisson-MNL model with UCB algorithm for dynamic decisions.
result Efficient algorithm achieves near optimal cumulative revenue.
The paper uses causal machine learning to optimize rework decisions in manufacturing.
problem Optimizing rework policies in manufacturing systems to balance yield improvement and rework costs.
method Proposes a causal model using double/debiased machine learning (DML) techniques to estimate conditional treatment effects and derive rework policies.
result Achieved a yield improvement of 2-3% during the color-conversion process of white LEDs.
New framework identifies worst-case shifts for predictive resource allocation models.
problem Identifying harmful shifts in predictive models for resource allocation.
method Hierarchical model structure and submodular optimization for worst-case loss.
result Empirical evidence shows divergent worst-case shifts identified by different metrics.
Recently, product images have gained increasing attention in clothing recommendation since the visual appearance of clothing products has a significant impact on consumers' decision. Most existing methods rely on conventional features to represent an image, such as the visual features extracted by convolutional neural …
New method estimates policy performance under unobserved confounding.
problem Estimating policy performance when decisions depend on unobserved variables.
method Developed worst-case bounds for robust OPE under unobserved confounding.
result Efficient procedure for computing worst-case bounds, proving statistical consistency.
Package {mlr3spatiotempcv} simplifies spatiotemporal resampling methods in R.
problem Assessing and tuning spatial and spatiotemporal machine learning models.
method Integrates various spatiotemporal resampling methods into the {mlr3} framework.
result Provides a consistent interface for spatiotemporal resampling methods.
AR design reduces multi-armed bandit experiment cost.
problem Comparing multi-armed bandit algorithms requires many restarts.
method Artificial Replay (AR) design for bandit experiments.
result AR reduces experimental cost by requiring only T + o ( T ) T + o(T) T + o ( T ) user interactions. New findings show ETO outperforms IEO in well-specified models with sufficient data.
problem Comparing estimate-then-optimize (ETO) and integrated-estimation-optimization (IEO) methods in stochastic optimization.
method Analyzes the performance of ETO and IEO in well-specified and misspecified models using stochastic dominance.
result Simple ETO outperforms IEO asymptotically in well-specified models with sufficient data.
The study analyzes how covariance estimation errors affect the global minimum-variance portfolio under heavy-tailed distributions.
problem The impact of covariance estimation errors on the global minimum-variance portfolio under heavy-tailed distributions.
method Characterization of covariance-estimation error's effect on GMVP suboptimality, derivation of regret identity and bound, application to heavy-tailed returns.
result The decision geometry of GMVP regret is invariant to a (p-1)-dimensional projection of the error matrix, with invariance to the covariance-scale direction as an exact special case.
Improves Gower's similarity for mixed-type variables with automatic weighting.
problem Handling missing values and unbalanced variable contributions in Gower's similarity for mixed-type data.
method Automatic weighting scheme minimizing differences in correlation between contributing dissimilarities and weighted Gower's dissimilarity.
result Improved performance in classification and imputation of missing values.
Unified method for input, data, and model uncertainty in neural networks.
problem Uncertainty in neural network inputs and outputs.
method Propagating uncertainty through inputs using a unified formulation.
result More stable decision boundaries with input noise, and propagation of input uncertainty to model outputs.
Problem definition. In retailing, discrete choice models (DCMs) are commonly used to capture the choice behavior of customers when offered an assortment of products. When estimating DCMs using transaction data, flexible models (such as machine learning models or nonparametric models) are typically not interpretable and…
This paper benchmarks uncertainty disentanglement across various tasks.
problem Disentangling multiple sources of uncertainty for specialized tasks.
method Reimplemented and evaluated a wide range of uncertainty estimators.
result No existing approach provides disentangled uncertainty estimators in practice.
Unified Bayesian framework for quantifying GNN uncertainty.
problem Quantifying uncertainty in GNN predictions due to modeling errors and measurement uncertainty.
method Unified Bayesian framework with aleatoric uncertainty from probabilistic links and feature noise, and epistemic uncertainty from model parameter distribution. Uses Assumed Density Filtering for aleatoric uncertainty and Monte Carlo dropout for model parameter uncertainty.
result Bayesian model performs similarly to frequentist model and provides additional uncertainty information.
Paper recovers uncertainty from dynamic valuation rules.
problem Recovering latent uncertainty from observable valuation rules.
method Developed procedures to identify and characterize uncertainty structures from valuation rules.
result Valuation rules contain sufficient information to identify and recover uncertainty structures.
Proposes a new criterion for reliable uncertainty estimation in deep neural networks.
problem Inability of existing approaches to provide reliable uncertainty estimates for deep neural networks.
method Develops a density uncertainty layer architecture that satisfies the proposed criterion.
result Density uncertainty layers provide more reliable uncertainty estimates and robust out-of-distribution detection.
Proposes a method to quantify uncertainty in graph neural networks for node classification.
problem Uncertainty in graph neural networks for node classification.
method Bayesian uncertainty propagation (BUP) method embedding GNNs in a Bayesian framework.
result Demonstrates superior performance of the proposed method on benchmark datasets.
Proposes PEMI for online selective conformal prediction with asymmetric rules.
problem Challenges of handling asymmetric selection mechanisms in online selective conformal prediction.
method PEMI: permutation-based framework for selective conformal prediction with arbitrary asymmetric selection rules.
result Achieves exact selection-conditional coverage for any asymmetric selection mechanism and any prediction model.
Survey on uncertainty in ML and DL, covering sources, quantification, and decision-making.
problem Understanding and quantifying uncertainty in ML and DL for risk-sensitive applications.
method Structured review of literature, categorizing uncertainty, assessing uncertainty quantification techniques.
result Broadened scope of uncertainty discussion and updated DL uncertainty quantification methods.
Unified Uncertainty Calibration improves AI predictions by combining different types of uncertainty.
problem AI classifiers struggle with uncertainty, leading to miscalibrated predictions and poor performance.
method Unified Uncertainty Calibration (U2C) combines aleatoric and epistemic uncertainties to improve prediction quality.
result U2C outperforms traditional reject-or-classify methods across various ImageNet benchmarks.
New method combines ODE filters and numerical quadrature to propagate model uncertainty.
problem Propagation of model uncertainty in ODE solutions with uncertain parameters.
method Combining ODE filters with numerical quadrature.
result Effective propagation of both numerical and parametric uncertainty.
Paper decomposes risk into aleatoric and epistemic uncertainties and generates predictive uncertainty measures.
problem Unclear relationships between various predictive uncertainty measures in literature.
method Bayesian estimation to decompose risk into aleatoric and epistemic uncertainties, generating different predictive uncertainty measures.
result Experimental validation confirms usefulness of derived predictive uncertainty measures for detecting out-of-distribution and misclassified instances.
Estimating how uncertain an AI system is in its predictions is important to improve the safety of such systems. Uncertainty in predictive can result from uncertainty in model parameters, irreducible data uncertainty and uncertainty due to distributional mismatch between the test and training data distributions. Differe…
New method estimates model uncertainty in regression.
problem Challenges in distinguishing aleatoric and epistemic uncertainty.
method Conditional predictions with model's initial output.
result Rigorous frequentist approach to epistemic uncertainty.
Introduces hierarchical uncertainty using U-sequences.
problem Tackles Ellsberg's paradox in multi-layer uncertainty.
method Uses category theory to construct U-sequences and endofunctors.
result Constructs a universal uncertainty space for multi-layer uncertainty.
Connects robust optimization to conformal prediction for uncertainty sets.
problem Decision-making under uncertainty in sensitive data.
method Defines Mahalanobis distance as a conformity score and generates conformal uncertainty sets.
result Conformal uncertainty sets provide valid and conservative ellipsoidal regions.
We propose orthogonality as a necessary condition for disentangling aleatoric and epistemic uncertainty.
problem Jointly estimating aleatoric and epistemic uncertainty is problematic and non-trivial.
method We propose orthogonality as a necessary condition for disentanglement and construct UDE to measure orthogonality and consistency.
result Orthogonality and consistency are necessary and sufficient criteria for disentanglement.
New framework captures long-term decision dependence in online learning.
problem Long-term dependence on past decisions in online learning.
method Introduces Online Convex Optimization with Unbounded Memory (OCO-UMB) and p p p -effective memory capacity. result Proves O ( H p T ) O(\sqrt{H_p T}) O ( H p T ) upper bound on policy regret and matching lower bound. This work introduces a method to decompose uncertainty in in-context learning for large language models.
problem Understanding the sources of uncertainty in in-context learning for large language models.
method Variational uncertainty decomposition framework without sampling from latent parameter posterior.
result Quantitative and qualitative validation of decomposed epistemic and aleatoric uncertainties.
Cooperative model disentangles data uncertainties.
problem Disentangling aleatoric and epistemic uncertainties in real-world data.
method Cooperatively trains a variance estimation network with a Bayesian neural network.
result Improves mean estimation and disentangles uncertainties.
Framework disentangles deep feature uncertainty for efficient inference.
problem Inference-time uncertainty estimation for reliable decision-making.
method Uncertainty-Guided Inference-Time Selection framework.
result Significantly tighter prediction intervals and 60% compute reduction.
This study introduces axioms to assess regression uncertainty measures.
problem Limited formal justification and evaluations of uncertainty measures in regression settings.
method Introduces axioms and analyzes entropy- and variance-based measures in a predictive exponential family context.
result Provides a principled foundation for reliable uncertainty assessment in regression.
Study improves AI's handling of uncertainty.
problem Uncertainty in AI models, especially with limited data.
method Integrates theories, latest developments, and practical applications.
result Novel definition of total uncertainty in AI.
Develops a framework to quantify uncertainties in multiple ML models.
problem Uncertainty in ML model predictions and model inputs.
method Develops a theoretical framework to decouple and transform uncertainties.
result Generates joint distribution of ML predictions considering uncertainties.
Second-order methods fail to fully quantify epistemic uncertainty, leading to biased predictions.
problem Incomplete quantification of epistemic uncertainty in machine learning models.
method Analysis of existing second-order uncertainty estimation methods.
result Current methods overestimate aleatoric uncertainty and underestimate epistemic uncertainty, leading to biased predictions.
Bayesian inference improves neural network predictions by separating aleatoric and epistemic uncertainties.
problem Improving prediction accuracy of neural networks by quantifying and separating uncertainties.
method Approximated posterior distributions using deep ensembles for various neural network architectures.
result Prediction accuracy depends on both aleatoric and epistemic uncertainties, not just marginalized uncertainty.