Search arXivSearch

arXiv · 2609.06397

Sharp Causal Bounds for Dynamic Treatment Regimes

Abstract

We study dynamic treatment regimes under contemporaneous confounding: at each stage, an unmeasured factor may affect both treatment and the next observed state, but has no further direct effect on later stages. From the observational distribution, the causal graph, and specified structural restrictions on possible next states, we construct at each state--treatment pair the set of transition probabilities compatible with this information. These local sets require no sensitivity parameter and can be combined by backward induction to obtain lower and upper bounds on the expected outcome under any given treatment regime. Our main result shows that these bounds are sharp: their endpoints are exactly the smallest and largest expected outcomes generated by causal models compatible with the same observational distribution, causal graph, and structural restrictions. The same backward-induction method gives a maximin rule for choosing treatments by maximizing the worst-case expected outcome. Thus, for this class of models with contemporaneous confounding, the framework generalizes the classical g-formula of \citet{Robins1986} for evaluating treatment regimes and the Q-learning framework of \citet{Murphy2003} for selecting them. When the local transition probabilities are identified, the two recursions reduce to these classical methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Alvarez, Sebastian E. Ferrando. 2026-09-06. Sharp Causal Bounds for Dynamic Treatment Regimes. https://arxiv.org/abs/2609.06397

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

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST