End-to-End Deep Learning for Predicting Metric Space-Valued Outputs
Not on the map. Why?
Abstract (arXiv)
Many modern applications involve predicting structured, non-Euclidean outputs such as probability distributions, networks, and symmetric positive-definite matrices. These outputs are naturally modeled as elements of general metric spaces, where classical regression techniques that rely on vector space structure no longer apply. We introduce E2M (End-to-End Metric regression), a deep learning framework for predicting metric space-valued outputs. E2M performs prediction via weighted Fr'echet means over training outputs, where the weights are learned by a neural network conditioned on the input. This construction provides a principled mechanism for geometry-aware prediction that avoids surrogate embeddings and restrictive parametric assumptions, while fully preserving the intrinsic geometry of the output space. We establish theoretical guarantees, including a universal approximation theorem that characterizes the expressive capacity of the model and a convergence analysis of the entropy-regularized training objective. Through extensive simulations involving probability distributions, networks, and symmetric positive-definite matrices, we show that E2M consistently achieves state-of-the-art performance, with its advantages becoming more pronounced at larger sample sizes. Applications to human mortality distributions and New York City taxi networks further demonstrate the flexibility and practical utility of this framework.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 70 references that are in the map. First posted on arXiv 28 Sep 2025.
Builds on
24 of 70 references.
References · 24
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
- 2018Hyperbolic Neural Networkscited by 402
- 2017Wasserstein Auto-Encoderscited by 373
- 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 373
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 314
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2016A Riemannian Network for SPD Matrix Learningcited by 162
- 2016Fr'echet Regression for Random Objects with Euclidean Predictorscited by 57
12 more
- 2019Universal Bayes consistency in metric spacescited by 33
- 2021Network Regression with Graph Laplacianscited by 15
- 2019Fr'echet random forests for metric space valued regression with non euclidean predictorscited by 13
- 2022Random Forest Weighted Local Fr'echet Regression with Random Objectscited by 12
- 2023Wasserstein Regression with Empirical Measures and Density Estimation for Sparse Datacited by 9
- 2013Regression with Distance Matricescited by 8
- 2019Manifold valued data analysis of samples of networks, with applications in corpus linguisticscited by 8
- 2023Medoid splits for efficient random forests in metric spacescited by 7
- 2019Total Variation Regularized Fr'echet Regression for Metric-Space Valued Datacited by 6
- 2021Fr'echet single index models for object response regressioncited by 5
- 2023Errors-in-variables Fr'echet Regression with Low-rank Covariate Approximationcited by 5
- 2016Principal component analysis and the locus of the Frechet mean in the space of phylogenetic treescited by 4
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.