CORTEXA
← Browse
arxivstat.MEmath.STstat.ML2026-07-19

The Resolution of Causal Heterogeneity

Yuki Ohnishi, Fan Li

Causal subgroup analyses often report a small number of groups summarizing treatment effect heterogeneity, as if that number were a well-defined estimand. Outside genuinely latent class populations, however, a ``true'' subgroup count is model dependent rather than a population functional. We replace it with a new population estimand, the resolution profile, a functional of the causal feature law giving the fewest groups explaining a prescribed fraction of causal heterogeneity, defined for every population without latent structure. Inference is organized around one cross-fitted Bayesian-bootstrap posterior for a single structured moment process, its scores corrected with influence functions, so that paths, profiles, fixed-resolution summaries, and subgroup effects follow by composition. A uniform conditional Bernstein--von Mises theorem over a loss class containing the nonsmooth quantization losses shows this posterior merges with the efficient Gaussian limit under stated nuisance-rate and margin conditions. Subgroup-number uncertainty is not model selection but threshold nonregularity, the profile being an integer-valued threshold of a continuous path, discontinuous in the law at each knot. At these knots no single-valued selector is locally uniformly consistent over root-$n$ neighborhoods, and the set-valued report obtained by inverting a simultaneous band retains locally uniform validity over exactly the same perturbations. Simulations support the approximations, and an analysis of the MineThatData e-mail experiment illustrates the resolution-indexed report, in which two to three groups summarize the visit response while finer structure falls below a noise-floor diagnostic.

View free PDFSource page

Related papers

arxivstat.MEmath.STstat.COstat.ML2026-07-24

The V-fold jackknife for semiparametric inference: variance estimation, confidence intervals, and simultaneous confidence bands

Yi Li, Ashkan Ertefaie, Mark van der Laan

For decades, the bootstrap has been a default tool for statistical inference because of its broad applicability and minimal analytic requirements. Although its validity is well understood for smooth parametric estimators, its theoretical properties for many modern semiparametric…

View free PDFSource page
arxivcs.LGmath.STstat.ML2026-07-24

Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent

Peng Zhao

In overparameterized linear regression, many weak spectral directions act like a ridge penalty on the signal-bearing spectrum; negative ridge is the natural correction, pushing filters above one. The stable negative-ridge endpoint, however, is structurally limited: its pole must…

View free PDFSource page
arxivstat.MLcs.LG2026-07-24

Graph-Based Correlation Matrix Generation: A Convex Optimization Approach

Ali Fakhar, K{é}vin Polisano, Ir{è}ne Gannaz, Sophie Achard

This work addresses the generation of theoretical correlation matrices with prescribed sparsity patterns associated to graph structures. We propose a novel convex optimization framework in which an initial matrix is projected onto an elliptope under a positive semidefiniteness co…

View free PDFSource page
arxivstat.MLcs.AIcs.LGecon.EM2026-07-24

CausalForge: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference

Jiyuan Tan, Vasilis Syrgkanis

Automating theoretical research is constrained not only by the generation of candidate results, but also by their reliable evaluation. A common approach is to close the research loop with a large language model (LLM) reviewer. However, such reviewers remain empirically unreliable…

View free PDFSource page
arxivcs.LGcs.SIstat.ML2026-07-24

Local-Global Geometric Insights for Graph Neural Networks via Entropic Curvature

Rachid Caich, Yassine Abbahaddou

Curvature notions on graphs, particularly Ollivier-Ricci and Forman, have emerged as powerful tools for addressing fundamental issues in Graph Neural Networks (GNNs) such as oversmoothing and oversquashing, but rely almost exclusively on local edge-level comparisons and therefore…

View free PDFSource page