Generalized bounds for active subspaces

10/03/2019
by   Mario Teixeira Parente, et al.
0

The active subspace method, as a dimension reduction technique, can substantially reduce computational costs and is thus attractive for high-dimensional computer simulations. The theory provides upper bounds for the mean square error of a given function of interest and a low-dimensional approximation of it. Derivations are based on probabilistic Poincaré inequalities which strongly depend on an underlying probability distribution that weights sensitivities of the investigated function. It is not this original distribution that is crucial for final error bounds, but a conditional distribution, conditioned on a so-called active variable, that naturally arises in the context. Existing literature does not take this aspect into account, is thus missing important details when it comes to distributions with, for example, exponential tails, and, as a consequence, does not cover such distributions theoretically. Here, we consider scenarios in which traditional estimates are not valid anymore due to an arbitrary large Poincaré constant. Additionally, we propose a framework that allows to get weaker, or generalized, estimates and that enables the practitioner to control the trade-off between the size of the Poincaré type constant and a weaker order of the final error bound. In particular, we investigate independently exponentially distributed random variables in 2 and n dimensions and give explicit expressions for involved constants, also showing the dependence on the dimension of the problem. Finally, we formulate an open problem to the community that aims for extending the class of distributions applicable to the active subspace method as we regard this as an opportunity to enlarge its usability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2018

A probabilistic framework for approximating functions in active subspaces

This paper develops a comprehensive probabilistic setup to compute appro...
research
01/22/2020

Learning functions varying along an active subspace

Many functions of interest are in a high-dimensional space but exhibit l...
research
05/05/2016

High-dimensional Bayesian inference via the Unadjusted Langevin Algorithm

We consider in this paper the problem of sampling a high-dimensional pro...
research
05/08/2018

Optimal Subspace Estimation Using Overidentifying Vectors via Generalized Method of Moments

Many statistical models seek relationship between variables via subspace...
research
10/24/2017

Impossibility of dimension reduction in the nuclear norm

Let S_1 (the Schatten--von Neumann trace class) denote the Banach space ...
research
07/20/2023

Discovering Active Subspaces for High-Dimensional Computer Models

Dimension reduction techniques have long been an important topic in stat...

Please sign up or login with your details

Forgot password? Click here to reset