mlsanityData to 7 Oct 2026

Tempered Calculus for ML: Application to Hyperbolic Model Embedding

arXiv 2402.04163 ↗First posted 6 Feb 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Most mathematical distortions used in ML are fundamentally integral in nature: f-divergences, Bregman divergences, (regularized) optimal transport distances, integral probability metrics, geodesic distances, etc. In this paper, we unveil a grounded theory and tools which can help improve these distortions to better cope with ML requirements. We start with a generalization of Riemann integration that also encapsulates functions that are not strictly additive but are, more generally, t-additive, as in nonextensive statistical mechanics. Notably, this recovers Volterra's product integral as a special case. We then generalize the Fundamental Theorem of calculus using an extension of the (Euclidean) derivative. This, along with a series of more specific Theorems, serves as a basis for results showing how one can specifically design, alter, or change fundamental properties of distortion measures in a simple way, with a special emphasis on geometric- and ML-related properties that are the metricity, hyperbolicity, and encoding. We show how to apply it to a problem that has recently gained traction in ML: hyperbolic embeddings with a "cheap" and accurate encoding along the hyperbolic vs Euclidean scale. We unveil a new application for which the Poincar'e disk model has very appealing features, and our theory comes in handy: textitmodel embeddings for boosted combinations of decision trees, trained using the log-loss (trees) and logistic loss (combinations).

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 59 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

18 of 59 references.

References · 18

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
  3. 2018Hyperbolic Neural Networkscited by 393
  4. 2018Representation Tradeoffs for Hyperbolic Embeddingscited by 204
  5. 2018Hyperbolic Entailment Cones for Learning Hierarchical Embeddingscited by 160
  6. 2020From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clusteringcited by 65
  7. 2021HoroPCA: Hyperbolic Dimensionality Reduction via Horospherical Projectionscited by 47
  8. 2022The Numerical Stability of Hyperbolic Representation Learningcited by 46
  9. 2020Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embeddingcited by 36
  10. 2023Hyperbolic Representation Learning: Revisiting and Advancingcited by 21
  11. 2023Hyperbolic Random Forestscited by 9
  12. 2023Boosting with Tempered Exponential Measurescited by 8
6 more
  1. 2018Boosted Density Estimation Remasteredcited by 7
  2. 2020Supervised Learning: No Loss No Crycited by 7
  3. 2023Fast hyperboloid decision tree algorithmscited by 7
  4. 2022Clustering above Exponential Families with Tempered Exponential Measurescited by 6
  5. 2023Optimal Transport with Tempered Exponential Measurescited by 3
  6. 2023The Tempered Hilbert Simplex Distance and Its Application To Non-linear Embeddings of TEMscited by 1

Built on by

Not cited yet.