LGIRMLFeb 16, 2020

Generalized Embedding Machines for Recommender Systems

arXiv:2002.06561v11 citations
AI Analysis

This work addresses a key bottleneck in feature-based recommendation for improving accuracy, though it is incremental as it builds on existing FM-based models.

The paper tackles the limitation of Factorization Machines (FM) in capturing complex high-order feature interactions for recommender systems by proposing Generalized Embedding Machine (GEM), which uses graph convolution networks to generate high-order embeddings, resulting in significant improvements over baselines on two real-world datasets.

Factorization machine (FM) is an effective model for feature-based recommendation which utilizes inner product to capture second-order feature interactions. However, one of the major drawbacks of FM is that it couldn't capture complex high-order interaction signals. A common solution is to change the interaction function, such as stacking deep neural networks on the top of FM. In this work, we propose an alternative approach to model high-order interaction signals in the embedding level, namely Generalized Embedding Machine (GEM). The embedding used in GEM encodes not only the information from the feature itself but also the information from other correlated features. Under such situation, the embedding becomes high-order. Then we can incorporate GEM with FM and even its advanced variants to perform feature interactions. More specifically, in this paper we utilize graph convolution networks (GCN) to generate high-order embeddings. We integrate GEM with several FM-based models and conduct extensive experiments on two real-world datasets. The results demonstrate significant improvement of GEM over corresponding baselines.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes