mlsanityData to 7 Oct 2026

Learning Backward Compatible Embeddings

arXiv 2206.03040 ↗First posted 7 Jun 2022stat.ML cs.IR cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Embeddings, low-dimensional vector representation of objects, are fundamental in building modern machine learning systems. In industrial settings, there is usually an embedding team that trains an embedding model to solve intended tasks (e.g., product recommendation). The produced embeddings are then widely consumed by consumer teams to solve their unintended tasks (e.g., fraud detection). However, as the embedding model gets updated and retrained to improve performance on the intended task, the newly-generated embeddings are no longer compatible with the existing consumer models. This means that historical versions of the embeddings can never be retired or all consumer teams have to retrain their models to make them compatible with the latest version of the embeddings, both of which are extremely costly in practice. Here we study the problem of embedding version updates and their backward compatibility. We formalize the problem where the goal is for the embedding team to keep updating the embedding version, while the consumer teams do not have to retrain their models. We develop a solution based on learning backward compatible embeddings, which allows the embedding model version to be updated frequently, while also allowing the latest version of the embedding to be quickly transformed into any backward compatible historical version of it, so that consumer teams do not have to retrain their models. Under our framework, we explore six methods and systematically evaluate them on a real-world recommender system application. We show that the best method, which we call BC-Aligner, maintains backward compatibility with existing unintended tasks even after multiple model version updates. Simultaneously, BC-Aligner achieves the intended task performance similar to the embedding model that is solely optimized for the intended task.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 17 of its 24 references that are in the map. First posted on arXiv 7 Jun 2022.

Builds on

17 of 24 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  4. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  5. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2017Neural Collaborative Filteringcited by 1,108
  8. 2019Neural Graph Collaborative Filteringcited by 660
  9. 2013Exploiting Similarities among Languages for Machine Translationcited by 187
  10. 2019AliGraph: A Comprehensive Graph Neural Network Platformcited by 152
  11. 2017A Survey Of Cross-lingual Word Embedding Modelscited by 142
  12. 2018DynGEM: Deep Embedding Method for Dynamic Graphscited by 100
5 more
  1. 2020Towards Backward-Compatible Representation Learningcited by 74
  2. 2019How to (Properly) Evaluate Cross-Lingual Word Embeddings: On Strong Baselines, Comparative Analyses, and Some Misconceptionscited by 48
  3. 2017Dynamic Word Embeddings for Evolving Semantic Discoverycited by 38
  4. 2021Learning Compatible Embeddingscited by 37
  5. 2019Are Girls Neko or Sh=ojo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalizationcited by 15

Built on by

Cited by year (2026 to 7 Oct)

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

16 papers.

Sort:

By area: