Sparse Robust Classification via the Kernel Mean

Abstract

Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to the uninitiated is a difficult task. Letting all the weights be equal leads to a conceptually simpler classification rule, one that requires little effort to motivate or explain, the mean. Here we explore the consistency, robustness and sparsification of this simple classification rule.

Cited by in corpus (5)

• Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates
• On Symmetric Losses for Learning from Corrupted Labels
• Learning from Multiple Corrupted Sources, with Application to Learning from Label Proportions
• Learning Only from Relevant Keywords and Unlabeled Documents
• A Symmetric Loss Perspective of Reliable Machine Learning