Kan Extensions in Data Science and Machine Learning
Not on the map. Why?
Abstract (arXiv)
A common problem in data science is "use this function defined over this small set to generate predictions over that larger set." Extrapolation, interpolation, statistical inference and forecasting all reduce to this problem. The Kan extension is a powerful tool in category theory that generalizes this notion. In this work we explore several applications of Kan extensions to data science. We begin by deriving a simple classification algorithm as a Kan extension and experimenting with this algorithm on real data. Next, we use the Kan extension to derive a procedure for learning clustering algorithms from labels and explore the performance of this procedure on real data. We then investigate how Kan extensions can be used to learn a general mapping from datasets of labeled examples to functions and to approximate a complex function with a simpler one.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 7 of its 30 references that are in the map. First posted on arXiv 17 Mar 2022.
Builds on
7 of 30 references.
References · 7
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2021Convex optimizationcited by 2,479
- 2021Category Theory in Machine Learningcited by 36
- 2016Algebraic Stability of Zigzag Persistence Modulescited by 7
- 2015Algebraic Data Integrationcited by 1
- 2020Edit Distance and Persistence Diagrams Over Latticescited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2026Learning Transfers: Kan Extensions for Neural Invariants30 May 2026
- 2025Learning Is a Kan Extension19 Feb 2025
- 2023Using Enriched Category Theory to Construct the Nearest Neighbour Classification Algorithm27 Dec 2023