Timezone: »

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

Mon Dec 05 09:00 AM -- 12:30 PM (PST) @ Area 5+6+7+8 #14

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.

Author Information

Mathieu Blondel (NTT)

Research scientist at NTT CS Labs.

Akinori Fujino (NTT)
Naonori Ueda (NTT Communication Science Laboratories / RIKEN AIP)
Masakazu Ishihata (Hokkaido University)

More from the Same Authors