Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Nov 2026

Bootstrapping LASSO estimators under variable selection consistency in high dimensions and some higher order refinements

We consider statistical inference based on the LASSO (cf. Tibshirani (J. Roy. Statist. Soc. Ser. B, Methodol. 58 (1996) 267–288)) in high dimensional regression problems. It is well known that the LASSO produces biased estimator of the regression parameter. The bias problem is further exacerbated when the LASSO has the variable selection consistency property (cf. Lahiri (Ann. Statist. 49 (2021) 820–844)). The centered and scaled point estimators are dominated by the bias term and fail to converge to any non-degenerate limit distribution. In contrast, we show that the LASSO interval estimators based on the Bootstrap are surprisingly accurate. Here, we consider two variants of the Bootstrap, namely, the Residual Bootstrap and the Perturbation Bootstrap, and show that under some regularity conditions, the Bootstrap approximations generated by both variants automatically adjust for the effects of the bias and are second order correct. This is an important finding as centered and scaled LASSO estimators under variable selection consistency fail to have a non-degenerate limit distribution and the Bootstrap approximations provide a viable way of constructing valid confidence intervals. Building on these second order results, we next consider construction of two-sided symmetric Bootstrap confidence intervals and show that with suitable choices of the studentized pivotal quantities, Bootstrap based two-sided symmetric confidence intervals attain a level of accuracy O(n−2) where n is the sample size. Thus, even with penalization and with diverging model parameter dimension, the performance of the Bootstrap here remains comparable to its finite dimensional counterpart in the traditional Smooth Function model (cf. Hall (The Bootstrap and Edgeworth Expansion (1992) Springer-Verlag)). We also establish similar results for the heteroscedastic case for the Perturbation Bootstrap and report results from a moderate simulation study in support of the theoretical findings.

Debraj Das, A. Chatterjee, S. Lahiri · 0 citations
Preprint Aug 2026

Large Sample Properties of Higher Order Markov Models

We study large-sample properties of higher-order Markov chains on a finite alphabet $\Sigma$ when the order $m_n$ is allowed to grow with the sequence length $n$. By embedding the process into a first-order chain on $\Sigma^{m_n}$ and exploiting return-time decompositions, we establish a central limit theorem for additive functionals $\sum_{t}\! g_n(Y_t^{(n)})$ under natural ergodicity and sparsity conditions. The normalization involves the stationary return time to a suitably chosen state and accommodates triangular arrays with $m_n\!\to\!\infty$ and $m_n/n\!\to\!0$. We further illustrate the assumptions in a binary variable length Markov chain (VLMC), deriving explicit lower bounds on stationary masses that yield a concrete growth regime (e.g., $m_n\log m_n/n \to 0$) ensuring the CLT. These results provide asymptotic foundations for inference in sparse/partitioned higher-order models; including VLMCs and sparse Markov models (SMMs) where the effective dimensionality grows with the sample size.

T. Majumder, D. Martin, S. Lahiri · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.