mlsanityData to 7 Oct 2026

Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering

arXiv 2109.05773 ↗First posted 13 Sep 2021cs.LG cs.IRcited by 8

Not on the map. Why?

Abstract (arXiv)

Variational AutoEncoder (VAE) has been extended as a representative nonlinear method for collaborative filtering. However, the bottleneck of VAE lies in the softmax computation over all items, such that it takes linear costs in the number of items to compute the loss and gradient for optimization. This hinders the practical use due to millions of items in real-world scenarios. Importance sampling is an effective approximation method, based on which the sampled softmax has been derived. However, existing methods usually exploit the uniform or popularity sampler as proposal distributions, leading to a large bias of gradient estimation. To this end, we propose to decompose the inner-product-based softmax probability based on the inverted multi-index, leading to sublinear-time and highly accurate sampling. Based on the proposed proposals, we develop a fast Variational AutoEncoder (FastVAE) for collaborative filtering. FastVAE can outperform the state-of-the-art baselines in terms of both sampling quality and efficiency according to the experiments on three real-world datasets.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 25 of its 52 references that are in the map. First posted on arXiv 13 Sep 2021.

Builds on

25 of 52 references.

References · 25

  1. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  2. 2013Auto-Encoding Variational Bayescited by 3,980
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  4. 2017Billion-scale similarity search with GPUscited by 2,477
  5. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  6. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  7. 2017Deep Learning based Recommender System: A Survey and New Perspectivescited by 136
  8. 2019Sequential Recommender Systems: Challenges, Progress and Prospectscited by 115
  9. 2014Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)cited by 109
  10. 2014On Using Very Large Target Vocabulary for Neural Machine Translationcited by 80
  11. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  12. 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
13 more
  1. 2017Adaptive Sampled Softmax with Kernel Based Samplingcited by 38
  2. 2019Security and Privacy on Blockchaincited by 32
  3. 2018Sequential Variational Autoencoders for Collaborative Filteringcited by 31
  4. 2015Quantization based Fast Inner Product Searchcited by 29
  5. 2015An Exploration of Softmax Alternatives Belonging to the Spherical Loss Familycited by 27
  6. 2014On Symmetric and Asymmetric LSHs for Inner Product Searchcited by 23
  7. 2014On distinguishability criteria for estimating generative modelscited by 20
  8. 2020Sampling-Decomposable Generative Adversarial Recommendercited by 16
  9. 2014Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)cited by 15
  10. 2017A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Modelscited by 15
  11. 2014Efficient Exact Gradient Update for training Deep Networks with Very Large Sparse Targetscited by 10
  12. 2016LightRNN: Memory and Computation-Efficient Recurrent Neural Networkscited by 4
  13. 2019Correlated Variational Auto-Encoderscited by 4

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 2; 2024: 3.

8 papers.