SearcharxivSearch

arXiv subjects

Navonil Deb

Publications and source records attributed to Navonil Deb.

4 recordsLinked to original sources

Inference for High-Dimensional Sparse Spectral Precision Matrices

Statistical inference for the spectral precision matrix at a given frequency allows us to assess frequency-specific conditional relationships among the components of a stationary multivariate time series. Compared with classical analogues, inference in the spectral domain is more challenging due to the absence of closed-form asymptotic variance expressions for complex-valued estimators, the limited asymptotic theory in high-dimensional settings, and the presence of truncation and smoothing biases in finite samples. We construct a debiased complex graphical lasso estimator at any fixed frequency by leveraging the full likelihood structure of neighboring discrete Fourier transforms. Using asymptotic distributions for bilinear forms of stationary multivariate time series, we establish the joint asymptotic normality of the real and imaginary parts of the debiased estimator. Our main theoretical contributions include deriving a closed-form asymptotic covariance matrix for the real and imaginary parts, establishing a central limit theorem for bilinear forms of the underlying time series, and controlling smoothing and truncation biases in covariance estimation to ensure valid inference. Simulation studies demonstrate reliable coverage and improved statistical power relative to the benchmark, while maintaining false discovery rates near the nominal level. An application to real fMRI data further reveals distinct patterns of functional connectivity across selected frequencies.

stat.ME

Counterfactual Forecasting for Panel Data

We address the challenge of forecasting counterfactual outcomes in a panel data with missing entries and temporally dependent latent factors -- a common scenario in causal inference, where estimating unobserved potential outcomes ahead of time is essential. We propose Forecasting Counterfactuals under Stochastic Dynamics (FOCUS), a method that extends traditional matrix completion methods by leveraging time series dynamics of the factors, thereby enhancing the prediction accuracy of future counterfactuals. Building upon a consistent estimator of the factors, our method accommodates both stochastic and deterministic components within the factors, and provides a flexible framework for various applications. In case of stationary autoregressive factors and under standard conditions, we derive error bounds and establish asymptotic normality of our estimator. Empirical evaluations demonstrate that our method outperforms existing benchmarks when the latent factors have an autoregressive component. We illustrate FOCUS results on HeartSteps, a mobile health study, illustrating its effectiveness in forecasting step counts for users receiving activity prompts, thereby leveraging temporal patterns in user behavior.

stat.ME

Regularized Estimation of Sparse Spectral Precision Matrices

Estimation of a sparse spectral precision matrix, the inverse of a spectral density matrix, is a canonical problem in frequency-domain analysis of high-dimensional time series (HDTS), with applications in neurosciences and environmental sciences. Existing estimators use off-the-shelf optimizers for complex variables that limit scalability, uniform (non-adaptive) penalization that is not tailored to handle heterogeneity across time series components, and lack a formal non-asymptotic theory that systematically analyzes approximation and estimation errors in high-dimension. In this work, develop fast pathwise coordinate descent (CD) algorithms and non-asymptotic theory for a complex graphical lasso (CGLASSO) and an adaptive version CAGLASSO, that adapts penalization to the underlying scale of variability. For fast algorithms, we devise a realification procedure based on ring isomorphism, a notion from abstract algebra, that can be used for other high-dimensional optimization problems over complex variables. Our non-asymptotic analysis shows that consistency is possible in high-dimension under suitable sparsity assumptions. A key step is to separately bound the approximation and estimation error arising from treating the finite-sample discrete Fourier Transforms (DFTs) as i.i.d. complex-valued data, an issue well-addressed in classical time series but relatively less explored in HDTS literature. We demonstrate the performance of our proposed estimators in several simulated data sets and a real data application from neuroscience.

stat.ME

Finding Optimal Cancer Treatment using Markov Decision Process to Improve Overall Health and Quality of Life

Markov Decision Processes and Dynamic Treatment Regimes have grown increasingly popular in the treatment of diseases, including cancer. However, cancer treatment often impacts quality of life drastically, and people often fail to take treatments that are sustainable, affordable and can be adhered to. In this paper, we emphasize the usage of ambient factors like profession, radioactive exposure, food habits on the treatment choice, keeping in mind that the aim is not just to relieve the patient of his disease, but rather to maximize his overall physical, social and mental well being. We delineate a general framework which can directly incorporate a net benefit function from a physician as well as patient's utility, and can incorporate the varying probabilities of exposure and survival of patients of varying medical profiles. We also show by simulations that the optimal choice of actions often is sensitive to extraneous factors, like the financial status of a person (as a proxy for the affordability of treatment), and that these actions should be welcome keeping in mind the overall quality of life.

stat.AP