mlsanityData to 7 Oct 2026

Tensor Methods and Recommender Systems

arXiv 1603.06038 ↗First posted 19 Mar 2016cs.LG cs.IR stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

A substantial progress in development of new and efficient tensor factorization techniques has led to an extensive research of their applicability in recommender systems field. Tensor-based recommender models push the boundaries of traditional collaborative filtering techniques by taking into account a multifaceted nature of real environments, which allows to produce more accurate, situational (e.g. context-aware, criteria-driven) recommendations. Despite the promising results, tensor-based methods are poorly covered in existing recommender systems surveys. This survey aims to complement previous works and provide a comprehensive overview on the subject. To the best of our knowledge, this is the first attempt to consolidate studies from various application domains in an easily readable, digestible format, which helps to get a notion of the current state of the field. We also provide a high level discussion of the future perspectives and directions for further improvement of tensor-based recommendation systems.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Mar 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 4; 2024: 4; 2025: 6; 2026: 2.

24 papers.

Sort:

  1. 2021Long Random Matrices and Tensor Unfoldingcited by 10
  2. 2024Guaranteed Nonconvex Factorization Approach for Tensor Train Recoverycited by 8
  3. 2021Low-Precision Hardware Architectures Meet Recommendation Model Inference at Scalecited by 7
  4. 2021Influence-guided Data Augmentation for Neural Tensor Completioncited by 7
  5. 2022Tensor-based Sequential Learning via Hankel Matrix Representation for Next Item Recommendationscited by 5
  6. 2023On High-dimensional and Low-rank Tensor Banditscited by 5
  7. 2025A Scalable Factorization Approach for High-Order Structured Tensor Recoverycited by 4
  8. 2024A Random Matrix Approach to Low-Multilinear-Rank Tensor Approximationcited by 3
  9. 2024Sharp Analysis of Power Iteration for Tensor PCAcited by 2
  10. 2021Tensor completion using geodesics on Segre manifoldscited by 1
  11. 2022Error Analysis of Tensor-Train Cross Approximationcited by 1
  12. 2022Data Leakage via Access Patterns of Sparse Features in Deep Learning-based Recommendation Systemscited by 1
12 more
  1. 2023Image Reconstruction using Superpixel Clustering and Tensor Completioncited by 1
  2. 2025Efficient Low-Tubal-Rank Tensor Estimation via Alternating Preconditioned Gradient Descentcited by 1
  3. 2022Consistent Collaborative Filtering via Tensor Decompositioncited by 0
  4. 2023Robust Bayesian Tensor Factorization with Zero-Inflated Poisson Model and Consensus Aggregationcited by 0
  5. 2023Dynamic Collaborative Filtering for Matrix- and Tensor-based Recommender Systemscited by 0
  6. 2024Higher-Order Transformers With Kronecker-Structured Attentioncited by 0
  7. 2025sparseGeoHOPCA: A Geometric Solution to Sparse Higher-Order PCA Without Covariance Estimationcited by 0
  8. 2025Tensor-Tensor Products, Group Representations, and Semidefinite Programmingcited by 0
  9. 2025Personalized Product Search Ranking: A Multi-Task Learning Approach with Tabular and Non-Tabular Datacited by 0
  10. 2025Guaranteed Noisy CP Tensor Recovery via Riemannian Optimization on the Segre Manifoldcited by 0
  11. 2026Recommending Composite Items Using Multi-Level Preference Information: A Joint Interaction Modeling Approachcited by 0
  12. 2026Quaternion Nonlinear Transform-Induced Nuclear Norm for Low-Rank Tensor Completioncited by 0