Quantitatively, we show a variety of bounds relating the number of mistakes to well-known combinatorial dimensions.

However, achieving such an assumption is non-trivial, leading to the following two aspects of challenges. On the one hand, it is challenging to design a model with enough capacity with limited computational resources, andexisting models areusually tailored forspecific problems which require heavytrailand-error [25,57,59].