Estimation and Sensitivity Analysis for Causal Decomposition in Heath Disparity Research

Soojin Park; Chioun Lee; Xu Qin

Home/Archive/arXiv

arXiv · 2008.12812

Estimation and Sensitivity Analysis for Causal Decomposition in Heath Disparity Research

Soojin Park·Chioun Lee·Xu Qin

View original source ↗Read source document ↗Export metadata ↓

Abstract

In the field of disparities research, there has been growing interest in developing a counterfactual-based decomposition analysis to identify underlying mediating mechanisms that help reduce disparities in populations. Despite rapid development in the area, most prior studies have been limited to regression-based methods, undermining the possibility of addressing complex models with multiple mediators and/or heterogeneous effects. We propose an estimation method that effectively addresses complex models. Moreover, we develop a novel sensitivity analysis for possible violations of identification assumptions. The proposed method and sensitivity analysis are demonstrated with data from the Midlife Development in the US study to investigate the degree to which disparities in cardiovascular health at the intersection of race and gender would be reduced if the distributions of education and perceived discrimination were the same across intersectional groups.

Explore related subjects

stat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Soojin Park, Chioun Lee, Xu Qin. 2022-05-26. Estimation and Sensitivity Analysis for Causal Decomposition in Heath Disparity Research. https://arxiv.org/abs/2008.12812

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

KEEP EXPLORING

Related papers

arXiv2026

Switchback Experiments under Geometric Mixing

The switchback is an experimental design that measures treatment effects by repeatedly turning an intervention on and off for a whole system. Switchback experiments are a robust way to overcome cross-unit spillover effects; however, they are vulnerable to bias from temporal carryovers. In this paper, we consider properties of switchback experiments in Markovian systems that mix at a geometric rate. We find that, in this setting, standard switchback designs suffer considerably from carryover bias: Their estimation error decays as $T^{-1/3}$ in terms of the experiment horizon $T$, whereas in the absence of carryovers a faster rate of $T^{-1/2}$ would have been possible. We also show, however, that judicious use of burn-in periods can considerably improve the situation, and enables errors that decay as $\log(T)^{1/2}T^{-1/2}$. Our formal results are mirrored in an empirical evaluation.

stat.ME↗

arXiv2026

Spectral divide-and-conquer MCMC for long stationary time series

The temporal dependence inherent in time series models poses a fundamental challenge for distributed Bayesian inference, as it precludes embarrassingly parallel algorithms based on naive independence assumptions in the time domain. We propose a frequency-domain framework for scalable Bayesian inference in stationary time series that exploits the asymptotic independence underlying the Whittle likelihood. To exploit parallel computing resources, we develop a distributed fast Fourier transform and integrate it with embarrassingly parallel Markov chain Monte Carlo (MCMC) algorithms within a modern cluster-computing framework. This enables the analysis of time series that exceed the memory capacity of a single computational node or for which computation time is a bottleneck. The proposed methodology is compatible with a broad class of existing divide-and-conquer algorithms for independent data by applying them to frequency-domain rather than time-domain partitions. We establish that the error of the spectral divide-and-conquer MCMC posterior approximation relative to the exact time-domain posterior converges to zero in probability in a shrinking neighbourhood of the full-data Whittle posterior mode. The corresponding convergence rate is also derived. Across several experiments, we demonstrate that our approach provides accurate approximations to the full-data Whittle posterior. The proposed method is shown to outperform the current state-of-the-art time-domain divide-and-conquer methodology, particularly for highly persistent processes. The methodology is further illustrated by fitting a semi-long range model to a long meteorological time series.

stat.ME↗

arXiv2026

Robust filtering and smoothing via perturbation methods

Using a perturbation technique, we derive a new approximate filtering and smoothing methodology generalizing along different directions several existing approaches to robust filtering based on the score and the Hessian matrix of the observation density. The main advantages of the methodology can be summarized as follows: (i) it relaxes the critical assumption of a Gaussian conditional distribution for the latent states underlying such approaches; (ii) can be applied to a general class of state-space models including location, scale and count data models; (iii) rationalizes the approximation to the likelihood function within the same perturbation approach, thus allowing for straightforward inference of the model parameters; (iv) enables the computation of confidence bands around the state estimates reflecting the combination of parameter and filtering uncertainty. We show through an extensive Monte Carlo study that the mean square loss with respect to exact simulation-based methods is small in a wide range of scenarios. We finally illustrate empirically the application of the methodology to the estimation of stochastic volatility and correlations in financial time-series.

stat.ME↗