Towards a Kernel based Uncertainty Decomposition Framework for Data and Models
This paper introduces a new framework for quantifying predictive uncertainty for both data and models that relies on projecting the data into a Gaussian reproducing kernel Hilbert space (RKHS) and transforming the data probability density function (PDF) in a way that quantifies the flow of its gradient as a topological potential field quantified at all points in the sample space. This enables the decomposition of the PDF gradient flow by formulating it as a moment decomposition problem using operators from quantum physics, specifically the Schrodinger's formulation. We experimentally show that the higher order modes systematically cluster the different tail regions of the PDF, thereby providing unprecedented discriminative resolution of data regions having high epistemic uncertainty. In essence, this approach decomposes local realizations of the data PDF in terms of uncertainty moments. We apply this framework as a surrogate tool for predictive uncertainty quantification of point-prediction neural network models, overcoming various limitations of conventional Bayesian based uncertainty quantification methods. Experimental comparisons with some established methods illustrate performance advantages exhibited by our framework.
Code (0)
등록된 구현이 없습니다.
Tasks
Time Series AnalysisUncertainty QuantificationSimilar Papers 제목 키워드 기반
A Bias-Variance-Covariance Decomposition of Kernel Scores for Generative Models
Generative models, like large language models, are becoming increasingly relevant in our daily lives, yet a theoretical framework to assess their generalization behavior and uncertainty does not exist. Particularly, the …
Image GenerationQuestion AnsweringText GenerationTriviaQAA Novel Framework for Uncertainty Quantification via Proper Scores for Classification and Beyond
In this PhD thesis, we propose a novel framework for uncertainty quantification in machine learning, which is based on proper scores. Uncertainty quantification is an important cornerstone for trustworthy and reliable ma…
Long-term decomposition of robust pricing kernels under G-expectation
This study develops a BSDE method for the long-term decomposition of pricing kernels under the G-expectation framework. We establish the existence, uniqueness, and regularity of solutions to three types of quadratic G-BS…
Scalable Gaussian Processes with Low-Rank Deep Kernel Decomposition
Kernels are key to encoding prior beliefs and data structures in Gaussian process (GP) models. The design of expressive and scalable kernels has garnered significant research attention. Deep kernel learning enhances kern…
Computational EfficiencyGaussian ProcessesUncertainty QuantificationVariational InferenceA Fully Probabilistic Tensor Network for Regularized Volterra System Identification
Modeling nonlinear systems with Volterra series is challenging because the number of kernel coefficients grows exponentially with the model order. This work introduces Bayesian Tensor Network Volterra kernel machines (BT…