Optimal subgroup selection
Henry W. J. Reeve, Timothy I. Cannings, Richard J. Samworth

TL;DR
This paper addresses the challenge of identifying regions in feature space where a regression function exceeds a threshold, providing minimax optimal rates for the regret in subgroup selection with guarantees.
Contribution
It formulates subgroup selection as a constrained optimisation problem and derives the minimax optimal rate for regret, extending previous results to treatment effect settings.
Findings
Derived minimax optimal rate for regret in subgroup selection.
Established the interplay between smoothness and approximation parameters.
Extended results to treatment and control scenarios.
Abstract
In clinical trials and other applications, we often see regions of the feature space that appear to exhibit interesting behaviour, but it is unclear whether these observed phenomena are reflected at the population level. Focusing on a regression setting, we consider the subgroup selection challenge of identifying a region of the feature space on which the regression function exceeds a pre-determined threshold. We formulate the problem as one of constrained optimisation, where we seek a low-complexity, data-dependent selection set on which, with a guaranteed probability, the regression function is uniformly at least as large as the threshold; subject to this constraint, we would like the region to contain as much mass under the marginal feature distribution as possible. This leads to a natural notion of regret, and our main contribution is to determine the minimax optimal rate for this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Advanced Bandit Algorithms Research · Advanced Causal Inference Techniques
