Timezone: »

Learning Anchor Planes for Classification
Ziming Zhang · Lubor Ladicky · Philip Torr · Amir Saffari

Tue Dec 13 08:45 AM -- 02:59 PM (PST) @ None #None

Local Coordinate Coding (LCC) [18] is a method for modeling functions of data lying on non-linear manifolds. It provides a set of anchor points which form a local coordinate system, such that each data point on the manifold can be approximated by a linear combination of its anchor points, and the linear weights become the local coordinate coding. In this paper we propose encoding data using orthogonal anchor planes, rather than anchor points. Our method needs only a few orthogonal anchor planes for coding, and it can linearize any (\alpha,\beta,p)-Lipschitz smooth nonlinear function with a fixed expected value of the upper-bound approximation error on any high dimensional data. In practice, the orthogonal coordinate system can be easily learned by minimizing this upper bound using singular value decomposition (SVD). We apply our method to model the coordinates locally in linear SVMs for classification tasks, and our experiment on MNIST shows that using only 50 anchor planes our method achieves 1.72% error rate, while LCC achieves 1.90% error rate using 4096 anchor points.

Author Information

Ziming Zhang (Oxford Brookes University)
Lubor Ladicky (University of Oxford)
Philip Torr (Oxford University)
Amir Saffari (BenevolentAI)

More from the Same Authors