Sharp oracle inequalities for low-complexity priors

Abstract

In this paper, we consider a high-dimensional statistical estimation problem in which the the number of parameters is comparable or larger than the sample size. We present a unified analysis of the performance guarantees of exponential weighted aggregation and penalized estimators with a general class of data losses and priors which encourage objects which conform to some notion of simplicity/complexity. More precisely, we show that these two estimators satisfy sharp oracle inequalities for prediction ensuring their good theoretical performances. We also highlight the differences between them. When the noise is random, we provide oracle inequalities in probability using concentration inequalities. These results are then applied to several instances including the Lasso, the group Lasso, their analysis-type counterparts, the ℓ ∞ and the nuclear norm penalties. All our estimators can be efficiently implemented using proximal splitting algorithms.

Matrix factorization for multivariate time series analysis

“…Minimax rates for matrix completion and more general matrix estimation problems were derived in [32,8,30,31,41]. Bayesian estimators and aggregation procedures were studied in [1,47,38,2,37,4,17,36,16,15].…”