arXiv 1002.45452010-02-24math.STmath.FAstat.TH

Approximating the inverse of banded matrices by banded matrices with applications to probability and statistics

Peter J. Bickel, Marko Lindner

英文摘要：

In the first part of this paper we give an elementary proof of the fact that if an infinite matrix $A$, which is invertible as a bounded operator on $\ell^2$, can be uniformly approximated by banded matrices then so can the inverse of $A$. We give explicit formulas for the banded approximations of $A^{-1}$ as well as bounds on their accuracy and speed of convergence in terms of their band-width. In the second part we apply these results to covariance matrices $Σ$ of Gaussian processes and study mixing and beta mixing of processes in terms of properties of $Σ$. Finally, we note some applications of our results to statistics.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Bayesian Bandwidth Test and Selection for High-dimensional Banded Precision Matrices

Assuming a banded structure is one of the common practice in the estimation of high-dimensional precision matrix. In this case, estimating the bandwidth of the precision matrix is a crucial initial step for subsequent analysis. Although there exist some consistent frequentist tests for the bandwidth parameter, bandwidth selection consistency for precision matrices has not been established in a Bayesian framework. In this paper, we propose a prior distribution tailored to the bandwidth estimation of high-dimensional precision matrices. The banded structure is imposed via the Cholesky factor fro…

2018-10-26math.STstat.MEstat.TH

Post-Processed Posteriors for Banded Covariances

We consider Bayesian inference of banded covariance matrices and propose a post-processed posterior. The post-processing of the posterior consists of two steps. In the first step, posterior samples are obtained from the conjugate inverse-Wishart posterior which does not satisfy any structural restrictions. In the second step, the posterior samples are transformed to satisfy the structural restriction through a post-processing function. The conceptually straightforward procedure of the post-processed posterior makes its computation efficient and can render interval estimators of functionals of …

2020-11-25math.STstat.TH

Banded Matrix Operators for Gaussian Markov Models in the Automatic Differentiation Era

Banded matrices can be used as precision matrices in several models including linear state-space models, some Gaussian processes, and Gaussian Markov random fields. The aim of the paper is to make modern inference methods (such as variational inference or gradient-based sampling) available for Gaussian models with banded precision. We show that this can efficiently be achieved by equipping an automatic differentiation framework, such as TensorFlow or PyTorch, with some linear algebra operators dedicated to banded matrices. This paper studies the algorithmic aspects of the required operators, d…

2019-02-26cs.LGstat.ML

Estimating Large Precision Matrices via Modified Cholesky Decomposition

We introduce the $k$-banded Cholesky prior for estimating a high-dimensional bandable precision matrix via the modified Cholesky decomposition. The bandable assumption is imposed on the Cholesky factor of the decomposition. We obtained the P-loss convergence rate under the spectral norm and the matrix $\ell_{\infty}$ norm and the minimax lower bounds. Since the P-loss convergence rate (Lee and Lee (2017)) is stronger than the posterior convergence rate, the rates obtained are also posterior convergence rates. Furthermore, when the true precision matrix is a $k_0$-banded matrix with some finite…

2017-07-04math.STstat.TH

Posterior convergence rates for estimating large precision matrices using graphical models

We consider Bayesian estimation of a $p\times p$ precision matrix, when $p$ can be much larger than the available sample size $n$. It is well known that consistent estimation in such ultra-high dimensional situations requires regularization such as banding, tapering or thresholding. We consider a banding structure in the model and induce a prior distribution on a banded precision matrix through a Gaussian graphical model, where an edge is present only when two vertices are within a given distance. For a proper choice of the order of graph, we obtain the convergence rate of the posterior distri…

2014-11-06math.STstat.TH

Test for bandedness of high-dimensional covariance matrices and bandwidth estimation

Motivated by the latest effort to employ banded matrices to estimate a high-dimensional covariance $Σ$, we propose a test for $Σ$ being banded with possible diverging bandwidth. The test is adaptive to the "large $p$, small $n$" situations without assuming a specific parametric distribution for the data. We also formulate a consistent estimator for the bandwidth of a banded high-dimensional covariance matrix. The properties of the test and the bandwidth estimator are investigated by theoretical evaluations and simulation studies, as well as an empirical analysis on a protein mass spectroscopy …

2012-08-16math.STstat.TH

更多相关论文收起更多论文

Weak convergence of the empirical spectral distribution of ultra-high-dimensional banded sample covariance matrices

In this article we investigate high-dimensional banded sample covariance matrices under the regime that the sample size $n$, the dimension $p$ and the bandwidth $d$ tend simultaneously to infinity such that $$n/p\to 0 \ \ \text{and} \ \ 2d/n\to y>0.$$ It is shown that the empirical spectral distribution of those matrices almost surely converges weakly to some deterministic probability measure which is characterized by its moments. Certain restricted compositions of natural numbers play a crucial role in the evaluation of the expected moments of the empirical spectral distribution.

2015-08-26math.PRmath.STstat.TH

Regularized estimation of large covariance matrices

This paper considers estimating a covariance matrix of $p$ variables from $n$ observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these estimates are consistent in the operator norm as long as $(\log p)/n\to0$, and obtain explicit rates. The results are uniform over some fairly natural well-conditioned families of covariance matrices. We also introduce an analogue of the Gaussian white noise model and show that if the population covariance is embeddable in that model and well-conditioned, then th…

2008-03-13math.STstat.TH

局部逆公式与因子分解

A Local Inverse Formula and a Factorization

研究局部逆公式及其在稀疏矩阵中的应用，通过矩阵因子分解解释其在机器学习和图模型中的广泛用途。

2016-10-04cs.NAmath.NAmath.ST