Promises are a standard way to formalize partial algorithms; and advice quantifies nonuniformity. For decision problems, the latter is captured in common complexity classes such as P/ poly, that is, with advice growing in size with that of the input. We advertise constant-size advice and explore its theoretical impact on the complexity of classification problems – a natural generalization of pr...