Adaptive efficient robust sequential analysis for autoregressive big data models
Résumé
In this paper we consider high dimension models based on dependent observations defined through autoregressive processes. For such models we develop an adaptive efficient estimation method via the robust sequential model selection procedures. To this end, we first obtain a van Trees inequality for such models, and then, using this inequality, we probably for the first time obtain a sharp lower bound for the weighted robust risk in an explicit form given by the famous Pinsker constant. Moreover, in getting this lower bound we have found the nonparametric version of the Fisher information for this model. Then, using the weighted least square method and sharp non asymptotic oracle inequalities from (Arkoun O., Brua J.-Y., and Pergamenchtchikov S. 2019. Sequential Analysis 38(4): 437-460), we develop analytic tools to provide the efficiency property in the minimax sense for the proposed estimation procedure, i.e. we show that the upper bound for its risk coincides with the obtained lower bound. It should be emphasized that this property is obtained without using sparse conditions and in the adaptive setting when the parameter dimension and model regularity are unknown. We then study the constructed procedures numerically using Monte Carlo simulations.
Origine | Fichiers produits par l'(les) auteur(s) |
---|