Search arXivSearch

arXiv · 1812.11605

Geometrical and statistical properties of M-estimates of scatter on Grassmann manifolds

Abstract

We consider data from the Grassmann manifold $G(m,r)$ of all vector subspaces of dimension $r$ of $\mathbb{R}^m$, and focus on the Grassmannian statistical model which is of common use in signal processing and statistics. Canonical Grassmannian distributions $\mathbb{G}_Σ$ on $G(m,r)$ are indexed by parameters $Σ$ from the manifold $\mathcal{M}= Pos_{sym}^{1}(m)$ of positive definite symmetric matrices of determinant $1$. Robust M-estimates of scatter (GE) for general probability measures $\mathcal{P}$ on $G(m,r)$ are studied. Such estimators are defined to be the maximizers of the Grassmannian log-likelihood $-\ell_{\mathcal{P}}(Σ)$ as function of $Σ$. One of the novel features of this work is a strong use of the fact that $\mathcal{M}$ is a CAT(0) space with known visual boundary at infinity $\partial \mathcal{M}$. We also recall that the sample space $G(m,r)$ is a part of $\partial \mathcal{M}$, show the distributions $\mathbb{G}_Σ$ are $SL(m,\mathbb{R})$--quasi-invariant, and that $\ell_{\mathcal{P}}(Σ)$ is a weighted Busemann function. Let $\mathcal{P}_n =(δ_{U_1}+\cdots+δ_{U_n})/n$ be the empirical probability measure for $n$-samples of random i.i.d. subspaces $U_i\in G(m,r)$ of common distribution $\mathcal{P}$, whose support spans $\mathbb{R}^m$. For $Σ_n$ and $Σ_{\mathcal{P}}$ the GEs of $\mathcal{P}_n$ and $\mathcal{P}$, we show the almost sure convergence of $Σ_n$ towards $Σ$ as $n\to\infty$ using methods from geometry, and provide a central limit theorem for the rescaled process $C_n = \frac{m}{tr(Σ_{\mathcal{P}}^{-1} Σ_n)}g^{-1} Σ_n g^{-1}$, where $Σ=gg$ with $g\in SL(m,\mathbb{R})$ the unique symmetric positive-definite square root of $Σ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Corina Ciobotaru, Christian Mazza. 2020-08-26. Geometrical and statistical properties of M-estimates of scatter on Grassmann manifolds. https://arxiv.org/abs/1812.11605

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST