Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.17369

Inference Optimal Long Run Variance Estimation with Lugsail Kernels

Rebecca P. Kurtz-Garcia·James M. Flegal
View original source ↗Read source document ↗Export metadata ↓

Abstract

For datasets with unknown but stationary serial dependence, a robust long run variance estimator is essential to handle diverse scenarios. Spectral variance estimators are commonly used but tend to exhibit significant negative bias in the presence of positive correlation. To overcome this, zero lugsail estimators have been introduced, offering zero asymptotic bias regardless of the correlation structure. However, there are currently no guidelines for selecting the optimal bandwidth for lugsail estimators, a critical component in the estimation process. We propose an inference optimal bandwidth rule for lugsail estimators, based on nonstandard fixed-smoothing limiting distributions developed in our study. This approach significantly improves bias correction, accounts for variability, and provides an estimator optimized for robust inference. Our theoretical findings are supported by a simulation study.

Explore related subjects

math.STstat.MEstat.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rebecca P. Kurtz-Garcia, James M. Flegal. 2026-06-15. Inference Optimal Long Run Variance Estimation with Lugsail Kernels. https://arxiv.org/abs/2606.17369

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

KEEP EXPLORING

Related papers

arXiv2026

Optimal Clustering of Multi-layer Networks under Mixture Block Models

We study clustering for multi-layer networks, where each observation is an undirected network measured on the same set of vertices. Under the mixture multi-layer stochastic block model (MMSBM), each network is generated from one of two stochastic block models, and the goal is to recover the latent network labels. We establish the minimax optimal network clustering error rate, which takes an exponential form and is characterized by the Chernoff information between the edge probability distributions of the component networks. We propose a novel two-stage estimator that combines tensor-based initialization, node and sample splitting, and a likelihood-based refinement. The refinement step exploits estimated node communities and achieves the minimax rate with high probability under extreme network sparsity. We further extend the likelihood-refinement framework to count-weighted networks through a mixture multi-layer Poisson block model. Numerical studies and two real-data analyses illustrate the finite-sample behavior of the proposed method and its use for both external-label benchmarking and unlabeled exploratory network clustering.

math.ST↗
arXiv2026

Multiply Robust Conformal Risk Control with Coarsened Data

Conformal Prediction (CP) provides prediction sets with formal coverage guarantees, but most existing methods assume fully observed training and calibration data. In many applications, however, outcomes, covariates, or both may be missing or coarsened. We develop a general framework for predictive inference with coarsened data by combining semiparametric theory with conformal methods. We introduce two complementary procedures. $(i)$ Robust Split Prediction (RSP) generalizes the doubly robust estimating-equation approach of Yang et al. [2024] beyond the classical missing outcome problem by constructing an efficient influence function based estimating equation and solving its empirical analogue. This yields multiply robust prediction sets under general coarsening patterns. $(ii)$ Robust Split Conformal Prediction (RSCP) instead combines semiparametric theory with conformal risk control. Because efficient influence functions are generally non-monotone in the threshold, we first estimate the target threshold on an independent sample and freeze the threshold-dependent nuisance functions at this preliminary estimate. This restores monotonicity and allows standard conformal risk control arguments to be applied. The resulting coverage guarantees inherit the higher-order mixed-bias structure of the influence function. We develop the theory for classical, multi-stage monotone, and non-monotone missingness and illustrate the performance of the methods through simulations and a longitudinal rheumatoid-arthritis application.

math.ST↗
arXiv2026

Exact Sign Recovery for PCA Connectivity Analysis in Mixture Models

We study exact sign recovery for PCA connectivity analysis in mixture models, using the projection onto the first $(K-1)$ principal components. For any fixed number of components with affinely independent means, we derive the oracle signal projection explicitly. Under anisotropic sub-Gaussian noise, with a random number of observations in each component, a rowwise eigenspace bound yields a sufficient condition, governed by the weakest signal direction, for recovering all connectivity signs without requiring a bounded condition number of the nonzero signal spectrum. Under isotropic Gaussian noise, when the configuration of the component means is fixed up to scaling and orthogonal transformations, we identify an asymptotically sharp threshold for the signal strength: exact sign recovery succeeds above the threshold and fails below the threshold, with probability tending to one when the signal strength stays a fixed relative distance from the threshold. The threshold has an explicit formula when the mixing proportions are equal and the means form a regular simplex.

math.ST↗