October 2018, Vol. 30, No. 10, Pages 2593-2615
© 2018 Massachusetts Institute of Technology
Learning Data Manifolds with a Cutting Plane Method
Article PDF (944.95 KB)
We consider the problem of classifying data manifolds where each manifold represents invariances that are parameterized by continuous degrees of freedom. Conventional data augmentation methods rely on sampling large numbers of training examples from these manifolds. Instead, we propose an iterative algorithm,
, based on a cutting plane approach that efficiently solves a quadratic semi-infinite programming problem to find the maximum margin solution. We provide a proof of convergence as well as a polynomial bound on the number of iterations required for a desired tolerance in the objective function. The efficiency and performance of are demonstrated in high-dimensional simulations and on image manifolds generated from the ImageNet data set. Our results indicate that is able to rapidly learn good classifiers and shows superior generalization performance compared with conventional maximum margin methods using data augmentation methods.