Distribution-Free Data Uncertainty for Neural Network Regression

Quantifying uncertainty is an essential part of predictive modeling, especially in the context of high-stakes decision-making. While classification output includes data uncertainty by design in the form of class probabilities, the regression task generally aims only to predict the expected value of the target variable. Probabilistic extensions often assume parametric distributions around the expected value, optimizing the likelihood over the resulting explicit densities. However, using parametric distributions can limit practical applicability, making it difficult for models to capture skewed, multi-modal, or otherwise complex distributions. In this paper, we propose optimizing a novel nondeterministic neural network regression architecture for loss functions derived from a sample-based approximation of the continuous ranked probability score (CRPS), enabling a truly distributionfree approach by learning to sample from the target's aleatoric distribution, rather than predicting explicit densities. Our approach allows the model to learn wellcalibrated, arbitrary uni-and multivariate output distributions. We evaluate the method on a variety of synthetic and real-world tasks, including uni-and multivariate problems, function inverse approximation, and standard regression uncertainty benchmarks. Finally, we make all experiment code publicly available 1 .