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.© The Author(s) 201
Abstract – A general result about the quality of approximation of the mean of a distribution by its ...
. We consider the problem of investigating the "structure" of a set of points in highdimen...
With the advent of massive datasets, statistical learning and information processing techniques are ...
Abstract — Random projection has been widely used in data classification. It maps high-dimensional d...
There has been considerable interest in random projections, an approximate algorithm for estimating ...
Random projection has been widely used in data classification. It maps high-dimensional data into a ...
Random projections is a technique used primarily in dimension reduction, in order to estimate distan...
Random projection is a simple geometric technique for reducing the dimensionality of a set of points...
Conference PaperRandom projections have recently found a surprising niche in signal processing. The ...
Random projection is a technique of mapping a number of points in a high-dimensional space into a lo...
We propose methods for improving both the accuracy and efficiency of random projections, the pop...
Abstract—There is increasing interest in dimensionality reduction through random projections due in ...
We present a k × d random projection matrix that is applicable to vectors x ∈ Rd in O(d) operations ...
To appear in Constructive ApproximationWe investigate a class of moment problems, namely recovering ...
© 2016 NIPS Foundation - All Rights Reserved. We address the problem of recovering a high-dimensiona...
Abstract – A general result about the quality of approximation of the mean of a distribution by its ...
. We consider the problem of investigating the "structure" of a set of points in highdimen...
With the advent of massive datasets, statistical learning and information processing techniques are ...
Abstract — Random projection has been widely used in data classification. It maps high-dimensional d...
There has been considerable interest in random projections, an approximate algorithm for estimating ...
Random projection has been widely used in data classification. It maps high-dimensional data into a ...
Random projections is a technique used primarily in dimension reduction, in order to estimate distan...
Random projection is a simple geometric technique for reducing the dimensionality of a set of points...
Conference PaperRandom projections have recently found a surprising niche in signal processing. The ...
Random projection is a technique of mapping a number of points in a high-dimensional space into a lo...
We propose methods for improving both the accuracy and efficiency of random projections, the pop...
Abstract—There is increasing interest in dimensionality reduction through random projections due in ...
We present a k × d random projection matrix that is applicable to vectors x ∈ Rd in O(d) operations ...
To appear in Constructive ApproximationWe investigate a class of moment problems, namely recovering ...
© 2016 NIPS Foundation - All Rights Reserved. We address the problem of recovering a high-dimensiona...
Abstract – A general result about the quality of approximation of the mean of a distribution by its ...
. We consider the problem of investigating the "structure" of a set of points in highdimen...
With the advent of massive datasets, statistical learning and information processing techniques are ...