Estimating the distance to a hereditary graph property

Given a family of graphs F, we prove that the distance to being induced F-free is estimable with a query complexity that depends only on the bounds of the Frieze-Kannan Regularity Lemma and a Removal Lemma for F.