Let G be an r-uniform hypergraph on n vertices such that all but at most ε(n ℓ) ℓ-subsets of vertices have degree at least p(n-ℓ r-ℓ). We show that G contains a large subgraph with high minimum ℓ-degree.