mlsanityData to 7 Oct 2026

Linear, or Non-Linear, That is the Question!

arXiv 2111.07265 ↗First posted 14 Nov 2021cs.IR cs.AI cs.LGcited by 19

Not on the map. Why?

Abstract (arXiv)

There were fierce debates on whether the non-linear embedding propagation of GCNs is appropriate to GCN-based recommender systems. It was recently found that the linear embedding propagation shows better accuracy than the non-linear embedding propagation. Since this phenomenon was discovered especially in recommender systems, it is required that we carefully analyze the linearity and non-linearity issue. In this work, therefore, we revisit the issues of i) which of the linear or non-linear propagation is better and ii) which factors of users/items decide the linearity/non-linearity of the embedding propagation. We propose a novel Hybrid Method of Linear and non-linEar collaborative filTering method (HMLET, pronounced as Hamlet). In our design, there exist both linear and non-linear propagation steps, when processing each user or item node, and our gating module chooses one of them, which results in a hybrid model of the linear and non-linear GCN-based collaborative filtering (CF). The proposed model yields the best accuracy in three public benchmark datasets. Moreover, we classify users/items into the following three classes depending on our gating modules' selections: Full-Non-Linearity (FNL), Partial-Non-Linearity (PNL), and Full-Linearity (FL). We found that there exist strong correlations between nodes' centrality and their class membership, i.e., important user/item nodes exhibit more preferences towards the non-linearity during the propagation steps. To our knowledge, we are the first who design a hybrid method and report the correlation between the graph centrality and the linearity/non-linearity of nodes. All HMLET codes and datasets are available at: https://github.com/qbxlvnf11/HMLET.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 22 of its 39 references that are in the map. First posted on arXiv 14 Nov 2021.

Builds on

22 of 39 references.

References · 22

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  4. 2019Simplifying Graph Convolutional Networkscited by 1,470
  5. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2017Neural Collaborative Filteringcited by 1,108
  8. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
  9. 2019Neural Graph Collaborative Filteringcited by 660
  10. 2015LINE: Large-scale Information Network Embeddingcited by 582
  11. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
  12. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
10 more
  1. 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
  2. 2014A* Samplingcited by 150
  3. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
  4. 2014Collaborative Deep Learning for Recommender Systemscited by 95
  5. 2015Modeling User Exposure in Recommendationcited by 69
  6. 2020DSNAS: Direct Neural Architecture Search without Parameter Retrainingcited by 69
  7. 2020MiLeNAS: Efficient Neural Architecture Search via Mixed-Level Reformulationcited by 56
  8. 2018Collaborative Memory Network for Recommendation Systemscited by 30
  9. 2021LT-OCF: Learnable-Time ODE-based Collaborative Filteringcited by 21
  10. 2018MEGAN: Mixture of Experts of Generative Adversarial Networks for Multimodal Image Generationcited by 15

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 4; 2024: 8; 2025: 4; 2026: 1.

19 papers.

Sort:

  1. 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
  2. 2023An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attentioncited by 28
  3. 2022Infinite Recommendation Networks: A Data-Centric Approachcited by 20
  4. 2026A Novel Approach to Temporal QoS Estimation via Extended Kalman Filter-Incorporated Latent Feature Analysiscited by 9
  5. 2023It's Enough: Relaxing Diagonal Constraints in Linear Autoencoders for Recommendationcited by 7
  6. 2025Graph Spectral Filtering with Chebyshev Interpolation for Recommendationcited by 7
  7. 2024Towards Fair Graph Anomaly Detection: Problem, Benchmark Datasets, and Evaluationcited by 6
  8. 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendationcited by 4
  9. 2024SVD-AE: Simple Autoencoders for Collaborative Filteringcited by 4
  10. 2023MONET: Modality-Embracing Graph Convolutional Network and Target-Aware Attention for Multimedia Recommendationcited by 3
  11. 2023RDGCL: Reaction-Diffusion Graph Contrastive Learning for Recommendationcited by 3
  12. 2024QoS-Aware Graph Contrastive Learning for Web Service Recommendationcited by 2
7 more
  1. 2024Hgformer: Hyperbolic Graph Transformer for Recommendationcited by 2
  2. 2024Modeling Reference-dependent Choices with Graph Neural Networkscited by 1
  3. 2024Fair Augmentation for Graph Collaborative Filteringcited by 1
  4. 2024CAPER: Enhancing Career Trajectory Prediction using Temporal Knowledge Graph and Ternary Relationshipcited by 1
  5. 2025Variational Autoencoder-Based Approach to Latent Feature Analysis on Efficient Representation of Power Load Monitoring Datacited by 0
  6. 2025TV-Rec: Time-Variant Convolutional Filter for Sequential Recommendationcited by 0
  7. 2025Denoised Recommendation Model with Collaborative Signal Decouplingcited by 0