Bregman-Hausdorff divergence: strengthening the connections between computational geometry and machine learning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912319461654528 |
|---|---|
| author | Pham, Tuyen Kouřimská, Hana Dal Poz Wagner, Hubert |
| author_facet | Pham, Tuyen Kouřimská, Hana Dal Poz Wagner, Hubert |
| contents | The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures. Specifically, we focus on the family of Bregman divergences, which includes the popular Kullback--Leibler divergence (also known as relative entropy).
As a proof of concept, we use the resulting Bregman--Hausdorff divergence to compare two collections of probabilistic predictions produced by different machine learning models trained using the relative entropy loss. The algorithms we propose are surprisingly efficient even for large inputs with hundreds of dimensions.
In addition to the introduction of this technical concept, we provide a survey. It outlines the basics of Bregman geometry, as well as computational geometry algorithms. We focus on algorithms that are compatible with this geometry and are relevant for machine learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_07322 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bregman-Hausdorff divergence: strengthening the connections between computational geometry and machine learning Pham, Tuyen Kouřimská, Hana Dal Poz Wagner, Hubert Machine Learning Computational Geometry Information Theory The purpose of this paper is twofold. On a technical side, we propose an extension of the Hausdorff distance from metric spaces to spaces equipped with asymmetric distance measures. Specifically, we focus on the family of Bregman divergences, which includes the popular Kullback--Leibler divergence (also known as relative entropy). As a proof of concept, we use the resulting Bregman--Hausdorff divergence to compare two collections of probabilistic predictions produced by different machine learning models trained using the relative entropy loss. The algorithms we propose are surprisingly efficient even for large inputs with hundreds of dimensions. In addition to the introduction of this technical concept, we provide a survey. It outlines the basics of Bregman geometry, as well as computational geometry algorithms. We focus on algorithms that are compatible with this geometry and are relevant for machine learning. |
| title | Bregman-Hausdorff divergence: strengthening the connections between computational geometry and machine learning |
| topic | Machine Learning Computational Geometry Information Theory |
| url | https://arxiv.org/abs/2504.07322 |