aiqbench analysis
This research introduces a novel Gaussian process framework for multiclass classification by leveraging Aitchison geometry to map probability simplices into unconstrained Euclidean spaces. The approach enables conjugate inference with scalable sparse regression, offering well-calibrated predictions that avoid heavy distributional approximations common in standard models. By reducing latent dimensions while maintaining accuracy, this method advances the theoretical and practical efficiency of Bayesian machine learning for complex classification tasks.
Simplex-to-Euclidean Bijection for Conjugate and Calibrated Multiclass Gaussian Process Classification
arXiv:2603.16621v2 Announce Type: replace Abstract: We propose a conjugate and calibrated Gaussian process (GP) model for multi-class classification by exploiting the geometry of the probability simplex. Our approach uses Aitchison geometry to map simplex-valued class probabilities to an unconstrained Euclidean representation, turning classification into a GP regression problem with fewer latent dimensions than standard multi-class GP classifiers. This yields conjugate inference and reliable predictive probabilities without relying on distributional approximations in the model construction. The method is compatible with standard sparse GP regression techniques, enabling scalable inference on larger datasets. Empirical results show well-calibrated and competitive performance across synthetic and real-world datasets.
Abstract:We propose a conjugate and calibrated Gaussian process (GP) model for multi-class classification by exploiting the geometry of the probability simplex. Our approach uses Aitchison geometry to map simplex-valued class probabilities to an unconstrained Euclidean representation, turning classification into a GP regression problem with fewer latent dimensions than standard multi-class GP classifiers. This yields conjugate inference and reliable predictive probabilities without relying on distributional approximations in the model construction. The method is compatible with standard sparse GP regression techniques, enabling scalable inference on larger datasets. Empirical results show well-calibrated and competitive performance across synthetic and real-world datasets.
Machine Learning (cs.LG)
arXiv:2603.16621 [cs.LG]
(or arXiv:2603.16621v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2603.16621 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 189 words
Related coverage
Learning Kernels by Alignment for Multiclass Bayes Classification
arXiv · Sep 9, 2026
Variational Filtering for Bayesian Last Layers with an Independent Binary Probit Surrogate
arXiv · Oct 14, 2026
Change Detection in Probability Flow ODE: Online Testing in Diffusion Latent Spaces
arXiv · Aug 25, 2026
Calibrated Uncertainty for Informative Path Planning in Aquatic Environmental Monitoring
arXiv · Sep 29, 2026