Conv4Rec: A 1-by-1 Convolutional AutoEncoder for User Profiling through Joint Analysis of Implicit and Explicit Feedbacks
Not on the map. Why?
Abstract (arXiv)
We introduce a new convolutional AutoEncoder architecture for user modelling and recommendation tasks with several improvements over the state of the art. Firstly, our model has the flexibility to learn a set of associations and combinations between different interaction types in a way that carries over to each user and item. Secondly, our model is able to learn jointly from both the explicit ratings and the implicit information in the sampling pattern (which we refer to as `implicit feedback'). It can also make separate predictions for the probability of consuming content and the likelihood of granting it a high rating if observed. This not only allows the model to make predictions for both the implicit and explicit feedback, but also increases the informativeness of the predictions: in particular, our model can identify items which users would not have been likely to consume naturally, but would be likely to enjoy if exposed to them. Finally, we provide several generalization bounds for our model, which to the best of our knowledge, are among the first generalization bounds for auto-encoders in a Recommender Systems setting; we also show that optimizing our loss function guarantees the recovery of the exact sampling distribution over interactions up to a small error in total variation. In experiments on several real-life datasets, we achieve state-of-the-art performance on both the implicit and explicit feedback prediction tasks despite relying on a single model for both, and benefiting from additional interpretability in the form of individual predictions for the probabilities of each possible rating.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 48 of its 111 references that are in the map. First posted on arXiv 9 Sep 2025.
Builds on
48 of 111 references.
References · 48
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2017Neural Collaborative Filteringcited by 1,111
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2019Neural Graph Collaborative Filteringcited by 661
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2018Variational Autoencoders for Collaborative Filteringcited by 310
- 2018Explainable Recommendation: A Survey and New Perspectivescited by 210
- 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
- 2014Collaborative Deep Learning for Recommender Systemscited by 95
36 more
- 2019Inductive Matrix Completion Based on Graph Neural Networkscited by 86
- 2020A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networkscited by 85
- 2019Stability and Generalization of Graph Convolutional Neural Networkscited by 81
- 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
- 2021Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networkscited by 51
- 2022Implicit Bias of Large Depth Networks: a Notion of Rank for Nonlinear Functionscited by 38
- 2023Implicit bias of SGD in L2-regularized linear DNNs: One-way jumps from high to low rankcited by 29
- 2015Neural Network Matrix Factorizationcited by 26
- 2023Dynamically Expandable Graph Convolution for Streaming Recommendationcited by 26
- 2022A Survey on Federated Recommendation Systemscited by 25
- 2024Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partitioncited by 23
- 2024Exploring User Retrieval Integration towards Large Language Models for Cross-Domain Sequential Recommendationcited by 19
- 2021A Survey on Reinforcement Learning for Recommender Systemscited by 18
- 2021Generalization bounds for graph convolutional neural networks via Rademacher complexitycited by 17
- 2015Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithmscited by 14
- 2019Generalization Bounds For Unsupervised and Semi-Supervised Learning With Autoencoderscited by 11
- 2022TrustGNN: Graph Neural Network based Trust Evaluation via Learnable Propagative and Composable Naturecited by 10
- 2025FuXi-α: Scaling Recommendation Model with Feature Interaction Enhanced Transformercited by 10
- 2020Explainable Recommendation via Interpretable Feature Mapping and Evaluation of Explainabilitycited by 9
- 2021SiReN: Sign-Aware Recommendation Using Graph Neural Networkscited by 9
- 2022On Measuring Excess Capacity in Neural Networkscited by 9
- 2023Multi-Behavior Graph Neural Networks for Recommender Systemcited by 9
- 2024Multi-granularity Interest Retrieval and Refinement Network for Long-Term User Behavior Modeling in CTR Predictioncited by 8
- 2022Time Interval-enhanced Graph Neural Network for Shared-account Cross-domain Sequential Recommendationcited by 6
- 2022Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendationcited by 6
- 2023Knowledge Graphs and Pre-trained Language Models enhanced Representation Learning for Conversational Recommender Systemscited by 6
- 2020Orthogonal Inductive Matrix Completioncited by 5
- 2020Providing reliability in Recommender Systems through Bernoulli Matrix Factorizationcited by 5
- 2021Fine-grained Generalization Analysis of Vector-valued Learningcited by 5
- 2022An Introduction to Matrix factorization and Factorization Machines in Recommendation System, and Beyondcited by 5
- 2018Rademacher Complexity and Generalization Performance of Multi-category Margin Classifierscited by 4
- 2021Fine-grained Generalization Analysis of Structured Output Predictioncited by 4
- 2021TEA: A Sequential Recommendation Framework via Temporally Evolving Aggregationscited by 4
- 2018Explicit Feedbacks Meet with Implicit Feedbacks : A Combined Approach for Recommendation Systemcited by 3
- 2022Plug-and-Play Model-Agnostic Counterfactual Policy Synthesis for Deep Reinforcement Learning based Recommendationcited by 3
- 2024Foundations and Frontiers of Graph Learning Theorycited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.