SearcharxivSearch

arXiv · 1604.02724

A plug-in bandwidth selection procedure for long run covariance estimation with stationary functional time series

Abstract

In arenas of application including environmental science, economics, and medicine, it is increasingly common to consider time series of curves or functions. Many inferential procedures employed in the analysis of such data involve the long run covariance function or operator, which is analogous to the long run covariance matrix familiar to finite dimensional time series analysis and econometrics. This function may be naturally estimated using a smoothed periodogram type estimator evaluated at frequency zero that relies crucially on the choice of a bandwidth parameter. Motivated by a number of prior contributions in the finite dimensional setting, we propose a bandwidth selection method that aims to minimize the estimator's asymptotic mean squared normed error (AMSNE) in $L^2[0,1]^2$. As the AMSNE depends on unknown population quantities including the long run covariance function itself, estimates for these are plugged in in an initial step after which the estimated AMSNE can be minimized to produce an empirical optimal bandwidth. We show that the bandwidth produced in this way is asymptotically consistent with the AMSNE optimal bandwidth, with quantifiable rates, under mild stationarity and moment conditions. These results and the efficacy of the proposed methodology are evaluated by means of a comprehensive simulation study, from which we can offer practical advice on how to select the bandwidth parameter in this setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Gregory Rice, Han Lin Shang. 2016-04-10. A plug-in bandwidth selection procedure for long run covariance estimation with stationary functional time series. https://arxiv.org/abs/1604.02724

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO