I work on algorithmic stability and post hoc selection in theoretical ML and statistical inference, with a focus on generalization guarantees for adaptive algorithms. My research studies how to obtain valid generalization guarantees after algorithms adaptively select models, hypotheses, parameters, or procedures using observed data.
When many candidates are evaluated and the best-looking one is selected, the selected candidate's empirical performance can be optimistically biased. This creates a post-selection problem: the data used to choose a candidate also affects the estimate used to evaluate it.
Standard sample splitting avoids post-selection bias by separating the data used for selection from the data used for evaluation, but it can waste data and reduce statistical power. I am studying algorithmic stability as a possible alternative: if the selection procedure is sufficiently insensitive to small dataset perturbations, its selected output may still admit finite-sample generalization guarantees.
This work overlaps with statistical learning theory, but I frame it more broadly as theoretical ML and statistical inference because the project also connects to adaptive data analysis and post-selection inference.