Robust Risk Minimization for Statistical Learning

10/03/2019
by   Muhammad Osama, et al.
0

We consider a general statistical learning problem where an unknown fraction of the training data is corrupted. We develop a robust learning method that only requires specifying an upper bound on the corrupted data fraction. The method is formulated as a risk minimization problem that can be solved using a blockwise coordinate descent algorithm. We demonstrate the wide range applicability of the method, including regression, classification, unsupervised learning and classic parameter estimation, with state-of-the-art performance.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset