Tag
This paper demonstrates that monotone adversarial corruptions can make certain multiclass and partial binary classification problems unlearnable, providing tight bounds on corruption budgets and extending previous results on binary classification.