Search Results

Now showing 1 - 2 of 2
  • Item
    In search on non-Gaussian components of a high-dimensional distribution
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2006) Blanchard, Gilles; Kawanabe, Motoaki; Sugiyama, Masashi; Spokoiny, Vladimir; Müller, Klaus-Robert
    Finding non-Gaussian components of high-dimensional data is an important preprocessing step for efficient information processing. This article proposes a new em linear method to identify the "non-Gaussian subspace'' within a very general semi-parametric framework. Our proposed method, called NGCA (Non-Gaussian Component Analysis), is essentially based on the fact that we can construct a linear operator which, to any arbitrary nonlinear (smooth) function, associates a vector which belongs to the low dimensional non-Gaussian target subspace up to an estimation error. By applying this operator to a family of different nonlinear functions, one obtains a family of different vectors lying in a vicinity of the target space. As a final step, the target space itself is estimated by applying PCA to this family of vectors. We show that this procedure is consistent in the sense that the estimaton error tends to zero at a parametric rate, uniformly over the family, Numerical examples demonstrate the usefulness of our method
  • Item
    Algebraic geometric comparison of probability distributions
    (Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach, 2011) Király, Franz J.; von Bünau, Paul; Meinecke, Frank C.; Blythe, Duncan A.J.; Müller, Klaus-Robert
    We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective function involving the estimated cumulants, we show that by treating the cumulants as elements of the polynomial ring we can directly solve the problem, at a lower computational cost and with higher accuracy. Moreover, the algebraic viewpoint on probability distributions allows us to invoke the theory of Algebraic Geometry, which we demonstrate in a compact proof for an identifiability criterion.