A Trichotomy for List Transductive Online Learning

List learning is an important topic in both theoretical and empirical machine learning research, playing a key role in the recent breakthrough result of (Brukhim et al., 2022) on the characterization of multiclass PAC learnability, as well as the ambiguity of labels in computer vision classification tasks, among others. In this paper, we study the problem of list transductive online learning. In this framework, the learner outputs a list of multiple labels for each instance rather than just one, as in traditional multiclass classification. In the realizable setting, we demonstrate a trichotomy of possible rates of the minimax number of mistakes. In particular, if the learner plays for T ∈ N rounds, its minimax number of mistakes can only be of the orders Θ(T), Θ(log T), or Θ(1). This resolves an open question raised by (Hanneke et al., 2024b). On the other hand, in the agnostic setting, we characterize the learnability by constructively proving the O( √ T) upper bound on the minimax expected regret. Along this way, we also answer another open question asked by (Moran et al., 2023) . To establish these results, we introduce two new combinatorial complexity dimensions, called the Level-constrained (L + 1)-Littlestone dimension and Level-constrained (L + 1)-Branching dimension, if the list size is L ∈ N. Eventually, we conclude our work by raising an open question regarding eliminating the factor of list size, which seems to be a crucial step, as it has consistently appeared in previous works on this subject.