Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms

07/29/2016
by   Mathieu Blondel, et al.
0

Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/22/2017

Multi-output Polynomial Networks and Factorization Machines

Factorization machines and polynomial networks are supervised polynomial...
research
08/17/2021

Memory-Efficient Factorization Machines via Binarizing both Data and Model Coefficients

Factorization Machines (FM), a general predictor that can efficiently mo...
research
12/25/2017

Strongly Hierarchical Factorization Machines and ANOVA Kernel Regression

High-order parametric models that include terms for feature interactions...
research
05/18/2019

RaFM: Rank-Aware Factorization Machines

Factorization machines (FM) are a popular model class to learn pairwise ...
research
04/17/2018

A Boosting Framework of Factorization Machine

Recently, Factorization Machines (FM) has become more and more popular f...
research
07/04/2015

Convex Factorization Machine for Regression

We propose the convex factorization machine (CFM), which is a convex var...
research
07/30/2023

TMPNN: High-Order Polynomial Regression Based on Taylor Map Factorization

Polynomial regression is widely used and can help to express nonlinear p...

Please sign up or login with your details

Forgot password? Click here to reset