Learning with Kan Extensions
Dan Shiebler (Abnormal Security)
Abstract: A common problem in machine learning 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 applications of the Kan extension to machine learning problems. 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.
machine learningcommutative algebraalgebraic geometryalgebraic topologycombinatoricscategory theoryoperator algebrasrings and algebrasrepresentation theory
Audience: researchers in the topic
Algebraic and Combinatorial Perspectives in the Mathematical Sciences
Series comments: To receive announcements: Register into our mailing list by going to our main website www.math.ntnu.no/acpms/
| Organizers: | Joscha Diehl, Kurusch Ebrahimi-Fard*, Dominique Manchon, Nikolas Tapia* |
| *contact for this listing |
