2018/09/18 by Mario Teixeira Parente, Parente, Mario Teixeira · 1 citation
Decision Sciences · Mathematics · #65C60 #FOS: Computer and information sciences #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Methodology (stat.ME) #Numerical Analysis (math.NA) #Probabilistic and Robust Engineering Design #Probability (math.PR) #Statistical Methods and Inference #Statistics Theory (math.ST)
paper · pdf · doi:10.48550/arxiv.1809.06581
openalex publication_date 2018/09/18 · openalex created_date 2018/09/27 · openalex updated_date 2026/08/01
This paper develops a comprehensive probabilistic setup to compute approximating functions in active subspaces. Constantine et al. proposed the active subspace method in (Constantine et al., 2014) to reduce the dimension of computational problems. It can be seen as an attempt to approximate a high-dimensional function of interest f by a low-dimensional one. To do this, a common approach is to integrate f over the inactive, i.e. non-dominant, directions with a suitable conditional density function. In practice, this can be done with a finite Monte Carlo sum, making not only the resulting approximation random in the inactive variable for each fixed input from the active subspace, but also its expectation, i.e. the integral of the low-dimensional function weighted with a probability measure on the active variable. In this regard we develop a fully probabilistic framework extending results from (Constantine et al., 2014, 2016). The results are supported by a simple numerical example.