The results presented here lack a couple of technical details to be completely convincing.
we would like to show that given a representation of size n, we can learn once we have seen a set of examples that is polynomially bounded by n. This will be challenging, as the size of the K we need to converge can be exponentially large in F .