We introduce a new version of Stein's method that reduces a large class of
normal approximation problems to variance bounding exercises, thus making a
connection between central limit theorems and concentration of measure. Unlike
Skorokhod embeddings, the object whose variance must be bounded has an explicit
formula that makes it possible to carry out the program more easily. As an
application, we derive a general CLT for functions that are obtained as
combinations of many local contributions, where the definition of "local"
itself depends on the data. Several examples are given, including the solution
to a nearest-neighbor CLT problem posed by P. Bickel.Comment: Published in at http://dx.doi.org/10.1214/07-AOP370 the Annals of
Probability (http://www.imstat.org/aop/) by the Institute of Mathematical
Statistics (http://www.imstat.org