pith. sign in

arxiv: 1805.07507 · v1 · pith:QK3355IKnew · submitted 2018-05-19 · 💻 cs.LG · cs.NE· stat.ML

Reconciled Polynomial Machine: A Unified Representation of Shallow and Deep Learning Models

classification 💻 cs.LG cs.NEstat.ML
keywords machinemodelslearningpolynomialreconcileddeepfunctionanalysis
0
0 comments X
read the original abstract

In this paper, we aim at introducing a new machine learning model, namely reconciled polynomial machine, which can provide a unified representation of existing shallow and deep machine learning models. Reconciled polynomial machine predicts the output by computing the inner product of the feature kernel function and variable reconciling function. Analysis of several concrete models, including Linear Models, FM, MVM, Perceptron, MLP and Deep Neural Networks, will be provided in this paper, which can all be reduced to the reconciled polynomial machine representations. Detailed analysis of the learning error by these models will also be illustrated in this paper based on their reduced representations from the function approximation perspective.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.