Wasserstein dropout

4Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Despite of its importance for safe machine learning, uncertainty quantification for neural networks is far from being solved. State-of-the-art approaches to estimate neural uncertainties are often hybrid, combining parametric models with explicit or implicit (dropout-based) ensembling. We take another pathway and propose a novel approach to uncertainty quantification for regression tasks, Wasserstein dropout, that is purely non-parametric. Technically, it captures aleatoric uncertainty by means of dropout-based sub-network distributions. This is accomplished by a new objective which minimizes the Wasserstein distance between the label distribution and the model distribution. An extensive empirical analysis shows that Wasserstein dropout outperforms state-of-the-art methods, on vanilla test data as well as under distributional shift in terms of producing more accurate and stable uncertainty estimates.

Cite

CITATION STYLE

APA

Sicking, J., Akila, M., Pintz, M., Wirtz, T., Wrobel, S., & Fischer, A. (2024). Wasserstein dropout. Machine Learning, 113(5), 3161–3204. https://doi.org/10.1007/s10994-022-06230-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free