We next show that if \(\mathcal {H}\)  has an infinite mutliclass Littlestone tree, then there exists a significant drop
in the rate: any learning algorithm \(\mathcal {H}\)  cannot be faster than linear. Our proof follows the approach in [1]}.
