DeepAI AI Chat
Log In Sign Up

Information inequalities for the estimation of principal components

05/14/2020
by   Martin Wahl, et al.
Humboldt-Universität zu Berlin
0

We provide lower bounds for the estimation of the eigenspaces of a covariance operator. These information inequalities are non-asymptotic and can be applied to any sequence of eigenvalues. In the important case of the eigenspace of the d leading eigenvalues, the lower bounds match non-asymptotic upper bounds based on the empirical covariance operator. Our approach relies on a van Trees inequality for equivariant models, with the reference measure being the Haar measure on the orthogonal group, combined with large deviations techniques to design optimal prior densities.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/17/2021

Non asymptotic estimation lower bounds for LTI state space models with Cramér-Rao and van Trees

We study the estimation problem for linear time-invariant (LTI) state-sp...
07/19/2021

Van Trees inequality, group equivariance, and estimation of principal subspaces

We establish non-asymptotic lower bounds for the estimation of principal...
10/06/2021

Computational lower bounds of the Maxwell eigenvalues

A method to compute guaranteed lower bounds to the eigenvalues of the Ma...
06/19/2019

First order covariance inequalities via Stein's method

We propose probabilistic representations for inverse Stein operators (i....
03/07/2023

Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincaré Inequality

Langevin diffusions are rapidly convergent under appropriate functional ...
09/07/2018

Asymptotic efficiency for covariance estimation under noise and asynchronicity

The estimation of the covariance structure from a discretely observed mu...
07/04/2022

The Best Bounds for Range Type Statistics

In this paper, we obtain the upper and lower bounds for two inequalities...