English

Chiseling: Powerful and Valid Subgroup Selection via Interactive Machine Learning

Methodology 2025-10-31 v3 Machine Learning

Abstract

In regression and causal inference, controlled subgroup selection aims to identify, with inferential guarantees, a subgroup (defined as a subset of the covariate space) on which the average response or treatment effect is above a given threshold. E.g., in a clinical trial, it may be of interest to find a subgroup with a positive average treatment effect. However, existing methods either lack inferential guarantees, heavily restrict the search for the subgroup, or sacrifice efficiency by naive data splitting. We propose a novel framework called chiseling that allows the analyst to interactively refine and test a candidate subgroup by iteratively shrinking it. The sole restriction is that the shrinkage direction only depends on the points outside the current subgroup, but otherwise the analyst may leverage any prior information or machine learning algorithm. Despite this flexibility, chiseling controls the probability that the discovered subgroup is null (e.g., has a non-positive average treatment effect) under minimal assumptions: for example, in randomized experiments, this inferential validity guarantee holds under only bounded moment conditions. When applied to a variety of simulated datasets and a real survey experiment, chiseling identifies substantially better subgroups than existing methods with inferential guarantees.

Keywords

Cite

@article{arxiv.2509.19490,
  title  = {Chiseling: Powerful and Valid Subgroup Selection via Interactive Machine Learning},
  author = {Nathan Cheng and Asher Spector and Lucas Janson},
  journal= {arXiv preprint arXiv:2509.19490},
  year   = {2025}
}

Comments

26+7+97 pages (main text, references, appendix), 6+15 figures (main text, appendix); fixed some references; added link to reproducible code repository

R2 v1 2026-07-01T05:52:59.057Z