no code implementations • 27 Mar 2023 • Shay Moran, Ohad Sharon, Iska Tsubari, Sivan Yosebashvili
This dimension is a variation of the classical Littlestone dimension with the difference that binary mistake trees are replaced with $(k+1)$-ary mistake trees, where $k$ is the number of labels in the list.