Applications on inference of biological networks have raised a strong
interest in the problem of graph estimation in high-dimensional Gaussian
graphical models. To handle this problem, we propose a two-stage procedure
which first builds a family of candidate graphs from the data, and then selects
one graph among this family according to a dedicated criterion. This estimation
procedure is shown to be consistent in a high-dimensional setting, and its risk
is controlled by a non-asymptotic oracle-like inequality.
We review recent results for high-dimensional sparse linear regression in the
practical case of unknown variance. Different sparsity settings are covered,
including coordinate-sparsity, group-sparsity and variation-sparsity. The
emphasize is put on non-asymptotic analyses and feasible procedures. In
addition, a small numerical study compares the practical performance of three
schemes for tuning the Lasso esti- mator and some references are collected for
some more general models, including multivariate regression and nonparametric
regression.
We study the problem of detection of a p-dimensional sparse vector of
parameters in the linear regression model with Gaussian noise. We establish the
detection boundary, i.e., the necessary and sufficient conditions for the
possibility of successful detection as both the sample size n and the dimension
p tend to the infinity. Testing procedures that achieve this boundary are also
exhibited. Our results encompass the high-dimensional setting (p>> n).
We study the nonparametric covariance estimation of a stationary Gaussian
field X observed on a lattice. To tackle this issue, a neighborhood selection
procedure has been recently introduced. This procedure amounts to selecting a
neighborhood m by a penalization method and estimating the covariance of X in
the space of Gaussian Markov random fields (GMRFs) with neighborhood m. Such a
strategy is shown to satisfy oracle inequalities as well as minimax adaptive
properties. However, it suffers several drawbacks which make the method
difficult to apply in practice.
We study the nonparametric covariance estimation of a stationary Gaussian
field X observed on a regular lattice. In the time series setting, some
procedures like AIC are proved to achieve optimal model selection among
autoregressive models. However, there exists no such equivalent results of
adaptivity in a spatial setting. By considering collections of Gaussian Markov
random fields (GMRF) as approximation sets for the distribution of X, we
introduce a novel model selection procedure for spatial fields.
This is a technical appendix to "Adaptive estimation of stationary Gaussian
fields". We present several proofs that have been skipped in the main paper.
This is a technical appendix to "Adaptive estimation of stationary Gaussian
fields". We present several proofs that have been skipped in the main paper.