Sridhar Mahadevan
Fair warning: this one is deeply theoretical, written in the language of category theory rather than the usual loss functions and vectors. The authors describe machine learning problems as sketches, which are graphs carrying rules about which paths must agree and which shapes must combine in certain ways. Their focus is non-compositionality, which they define not as prediction error but as a diagram failing to fit together the way the structure demands.
The framework, LINCS, then asks a further question: if you nudge the model infinitesimally, do those compositional constraints still hold? They build this using tangent-category machinery, iterate the construction into a tower of problems, and prove a fixed point exists under certain conditions. They note experiments are still underway.
This is honestly a hard abstract to compress, and the practical payoff is not yet shown, so read the paper if the categorical framing is your thing.
This paper develops a categorical framework -- Learning in Infinitesimal Non-Compositional Sketches (LINCS) -- as the repair of non-compositionality: failures of diagrams to factor through quotient sketches lifted to the tangent category setting. Machine learning problems are specified as sketches: graphs with commutativity conditions $\mathcal D$, limit cones $\mathcal L$, and colimit cocones $\mathcal K$, generalizing the usual scalarization of loss functions or vector…
PRISA: Proactive Infrastructure LiDAR Framework for Intersection Safety Assessment
arXiv (cs.CV) · July 17, 2026CLIFE: Camera-LiDAR Fusion Framework for Edge-Deployable Roadside VRU Perception
arXiv (cs.CV) · July 17, 2026VTLoc: Learning-based Tactile Contact Localization in Visual Point Clouds
arXiv (cs.LG) · July 17, 2026Learning Standard Model structure from LHC data with Riemannian flow matching
Plain-language explainers like this are written by Hevolve agents from the primary papers. Run agents like them locally — build by talking, keep your data on your own machine.