When AI Meets Topology—Why Collaborative Filtering and Contextual Word Embeddings Fail

preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher

Abstract

Collaborative Filtering algorithm requires computation of similarities. By exploring the similarity structure using vector field-based topology, we prove that the algorithm is invalid. Similarly, we can apply an analogous approach to the Contextual Word Embedding algorithms. By reducing the similarity structures into transverse fields which can be decomposed into tangential vectors and normal vectors of the underlying topological structures, we utilize the Poincare-Hopf Index Theorem to prove that the shape of contextual word embedding vectors is not a manifold.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0