Prediction in Riemannian metrics derived from divergence functions
Henryk Gzyl

TL;DR
This paper explores how divergence functions can generate Riemannian metrics that alter the concept of best predictors, providing new insights into prediction theory beyond Euclidean assumptions.
Contribution
It introduces a method to derive Riemannian metrics from divergence functions and studies their implications for prediction theory.
Findings
Derived Riemannian metrics from divergence functions.
Showed differences in predictors under these metrics.
Analyzed the theoretical properties of these metrics.
Abstract
Divergence functions are interesting discrepancy measures. Even though they are not true distances, we can use them to measure how separated two points are. Curiously enough, when they are applied to random variables, they lead to a notion of best predictor that coincides with usual best predictor in Euclidean distance. Given a divergence function, we can derive from it a Riemannian metric, which leads to a distance in which means and best predictors do not coincide with their Euclidean counterparts. It is the purpose of this note to study the Riemannian metric derived from the divergence function as well as its use in prediction theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
