Robust Learning of Trimmed Estimators via Manifold Sampling
Optimization and Control
2018-07-10 v1
Abstract
We adapt a manifold sampling algorithm for the nonsmooth, nonconvex formulations of learning that arise when imposing robustness to outliers present in the training data. We demonstrate the approach on objectives based on trimmed loss. Empirical results show that the method has favorable scaling properties. Although savings in time come at the expense of not certifying optimality, the algorithm consistently returns high-quality solutions on the trimmed linear regression and multiclass classification problems tested.
Cite
@article{arxiv.1807.02736,
title = {Robust Learning of Trimmed Estimators via Manifold Sampling},
author = {Matt Menickelly and Stefan M. Wild},
journal= {arXiv preprint arXiv:1807.02736},
year = {2018}
}
Comments
In ICML 2018 Workshop on Modern Trends in Nonconvex Optimization for Machine Learning