mlsanityData to 14 Oct 2026

Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems

arXiv 2206.13764 ↗First posted 28 Jun 2022cs.IR cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Detecting beneficial feature interactions is essential in recommender systems, and existing approaches achieve this by examining all the possible feature interactions. However, the cost of examining all the possible higher-order feature interactions is prohibitive (exponentially growing with the order increasing). Hence existing approaches only detect limited order (e.g., combinations of up to four features) beneficial feature interactions, which may miss beneficial feature interactions with orders higher than the limitation. In this paper, we propose a hypergraph neural network based model named HIRS. HIRS is the first work that directly generates beneficial feature interactions of arbitrary orders and makes recommendation predictions accordingly. The number of generated feature interactions can be specified to be much smaller than the number of all the possible interactions and hence, our model admits a much lower running time. To achieve an effective algorithm, we exploit three properties of beneficial feature interactions, and propose deep-infomax-based methods to guide the interaction generation. Our experimental results show that HIRS outperforms state-of-the-art algorithms by up to 5% in terms of recommendation accuracy.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 30 of its 45 references that are in the map. First posted on arXiv 28 Jun 2022.

Builds on

30 of 45 references.

References · 30

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018How Powerful are Graph Neural Networks?cited by 4,393
  4. 2020Supervised Contrastive Learningcited by 2,829
  5. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  6. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
  7. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  8. 2018Deep Graph Infomaxcited by 1,106
  9. 2020What Makes for Good Views for Contrastive Learning?cited by 846
  10. 2016Wide & Deep Learning for Recommender Systemscited by 747
  11. 2018MINE: Mutual Information Neural Estimationcited by 683
  12. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
18 more
  1. 2019Neural Graph Collaborative Filteringcited by 661
  2. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  3. 2018Hypergraph Neural Networkscited by 488
  4. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
  5. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
  6. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 278
  7. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  8. 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
  9. 2016A Compositional Object-Based Approach to Learning Physical Dynamicscited by 119
  10. 2019Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Predictioncited by 54
  11. 2020AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Predictioncited by 52
  12. 2019Adaptive Factorization Network: Learning Adaptive-Order Feature Interactionscited by 48
  13. 2020Graph Cross Networks with Vertex Infomax Poolingcited by 31
  14. 2020Detecting Beneficial Feature Interactions for Recommender Systemscited by 22
  15. 2021WGCN: Graph Convolutional Networks with Weighted Structural Featurescited by 12
  16. 2016Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithmscited by 11
  17. 2021Neural Graph Matching based Collaborative Filteringcited by 9
  18. 2019MMF: Attribute Interpretable Collaborative Filteringcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 1; 2025: 2.

6 papers.