mlsanityData to 14 Oct 2026

Factoring out prior knowledge from low-dimensional embeddings

arXiv 2103.01828 ↗First posted 2 Mar 2021cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Low-dimensional embedding techniques such as tSNE and UMAP allow visualizing high-dimensional data and therewith facilitate the discovery of interesting structure. Although they are widely used, they visualize data as is, rather than in light of the background knowledge we have about the data. What we already know, however, strongly determines what is novel and hence interesting. In this paper we propose two methods for factoring out prior knowledge in the form of distance matrices from low-dimensional embeddings. To factor out prior knowledge from tSNE embeddings, we propose JEDI that adapts the tSNE objective in a principled way using Jensen-Shannon divergence. To factor out prior knowledge from any downstream embedding approach, we propose CONFETTI, in which we directly operate on the input distance matrices. Extensive experiments on both synthetic and real world data show that both methods work well, providing embeddings that exhibit meaningful structure that would otherwise remain hidden.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 39 references that are in the map. First posted on arXiv 2 Mar 2021.

Builds on

6 of 39 references.

References · 6

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2019Visualizing and Measuring the Geometry of BERTcited by 216
  3. 2017Efficient Algorithms for t-distributed Stochastic Neighborhood Embeddingcited by 75
  4. 2017Interactive Visual Data Exploration with Subjective Feedback: An Information-Theoretic Approachcited by 3
  5. 2019Conditional t-SNE: Complementary t-SNE embeddings through factoring out prior informationcited by 1
  6. 2020Tell Me Something I Don't Know: Randomization Strategies for Iterative Data Miningcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.