Higher-Order Factorization Machines
Mathieu Blondel, Akinori Fujino, Naonori Ueda, Masakazu Ishihata

TL;DR
This paper introduces the first efficient algorithms for training higher-order factorization machines, enabling high-dimensional feature modeling with reduced computational costs and new shared-parameter variants for improved efficiency.
Contribution
It presents the first generic algorithms for arbitrary-order HOFMs and introduces shared-parameter variants that reduce model size and prediction time.
Findings
Effective training algorithms for higher-order FMs.
Shared-parameter variants maintain accuracy with less computation.
Demonstrated on four link prediction tasks.
Abstract
Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient training algorithm for higher-order FMs (HOFMs). In this paper, we present the first generic yet efficient algorithms for training arbitrary-order HOFMs. We also present new variants of HOFMs with shared parameters, which greatly reduce model size and prediction times while maintaining similar accuracy. We demonstrate the proposed approaches on four different link prediction tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition · Text and Document Classification Technologies · Machine Learning in Bioinformatics
