From low to high-dimensional moments without magic

Abstract

We aim to compute the first few moments of a high-dimensional random vector from the first few moments of a number of its low-dimensional projections. To this end, we identify algebraic conditions on the set of low-dimensional projectors that yield explicit reconstruction formulas. We also provide a computational framework, with which suitable projectors can be derived by solving an optimization problem. Finally, we show that randomized projections permit approximate recovery.

Cited by in corpus (2)

• On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
• Cubatures on Grassmannians: moments, dimension reduction, and related topics