Parallelized Tensor Train Learning of Polynomial Classifiers
In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines, because polynomials quickly become impractical for high-dimensional problems. In this paper, we effectively overcome the curse of dimensionality by employing the tensor train format to represent a polynomial classifier. Based on the structure of tensor trains, two learning algorithms are proposed which involve solving different optimization problems of low computational complexity. Furthermore, we show how both regularization to prevent overfitting and parallelization, which enables the use of large training sets, are incorporated into these methods. Both the efficiency and efficacy of our tensor-based polynomial classifier are then demonstrated on the two popular datasets USPS and MNIST.
Code (1)
Tasks
General ClassificationSimilar Papers 제목 키워드 기반
PRoTECT: Parallelized Construction of Safety Barrier Certificates for Nonlinear Polynomial Systems
We develop an open-source software tool, called PRoTECT, for the parallelized construction of safety barrier certificates (BCs) for nonlinear polynomial systems. This tool employs sum-of-squares (SOS) optimization progra…
Machine learning with tree tensor networks, CP rank constraints, and tensor dropout
Tensor networks developed in the context of condensed matter physics try to approximate order-$N$ tensors with a reduced number of degrees of freedom that is only polynomial in $N$ and arranged as a network of partially …
image-classificationImage ClassificationTensor Networks(MPO)$^2$: Multivariate Polynomial Optimization based on Matrix Product Operators
Central to machine learning and signal processing is the ability to perform universal function approximation and learn complex input-output relationships from limited numbers of observations. Multivariate polynomial mode…
On Tensor-based Polynomial Hamiltonian Systems
It is known that a linear system with a system matrix A constitutes a Hamiltonian system with a quadratic Hamiltonian if and only if A is a Hamiltonian matrix. This provides a straightforward method to verify whether a l…
tensor algebraReconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the…
Tensor Decomposition