Computation of conditional expectations with guarantees
Not on the map. Why?
Abstract (arXiv)
Theoretically, the conditional expectation of a square-integrable random variable Y given a d-dimensional random vector X can be obtained by minimizing the mean squared distance between Y and f(X) over all Borel measurable functions f colon ℝd → ℝ. However, in many applications this minimization problem cannot be solved exactly, and instead, a numerical method which computes an approximate minimum over a suitable subfamily of Borel functions has to be used. The quality of the result depends on the adequacy of the subfamily and the performance of the numerical method. In this paper, we derive an expected value representation of the minimal mean squared distance which in many applications can efficiently be approximated with a standard Monte Carlo average. This enables us to provide guarantees for the accuracy of any numerical approximation of a given conditional expectation. We illustrate the method by assessing the quality of approximate conditional expectations obtained by linear, polynomial and neural network regression in different concrete examples.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 4 of its 38 references that are in the map. First posted on arXiv 3 Dec 2021.
Builds on
4 of 38 references.
References · 4
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2019Deep splitting method for parabolic PDEscited by 53
- 2020Deep learning based numerical approximation algorithms for stochastic partial differential equationscited by 11
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.