Ordinal Gaussian Processes for Gleason grading: Enhancing performance and calibration across foundation model rankability scores
Related Experiment Videos
Francisco Javier Sáez-Maldonado1, Miguel López-Pérez1, Elena Maroto2
1Department of Computer Science and Artificial Intelligence, University of Granada, Granada, Spain; Centre for Information and Communication Technologies, University of Granada, Granada, Spain.
Background And Objective:
Gleason grading of prostate cancer is a critical clinical task inherently defined by an ordinal progression of tissue deterioration. However, most automated computational approaches simplify this problem into a standard multi-class classification problem, which ignores its ordinal structure. Furthermore, the suitability of foundation models-which currently provide state-of-the-art latent representations of histological images- for ordinal decision making remains underexplored. Specifically, it is unclear how model design should adapt when these embeddings fail to naturally capture disease progression.
Methods:
In this context, we investigate the concept of rankability, defined as the degree to which the embedding space of a foundation model inherently preserves the natural ordering of Gleason grades. We systematically analyze how this property impacts downstream ordinal predictions. Consequently, we propose a novel framework that integrates pre-trained foundation model embeddings with Ordinal Gaussian Processes (OGPs). By explicitly incorporating an ordinal likelihood, our approach mathematically enforces the strictly ordered nature of disease severity within the probabilistic model.
Results:
Evaluated across two publicly available prostate cancer datasets exhibiting different levels of rankability, our experiments show the benefits of OGPs for ordinal problems. While both ordinal and standard multi-class approaches achieve similar performance in naturally highly rankable embedding spaces, the proposed OGP framework significantly outperforms its non-ordinal counterparts in low-rankability scenarios. In these challenging settings, explicitly integrating an ordinal likelihood yields substantial improvements in both predictive agreement metrics and calibration.
Conclusion:
Our findings highlight that explicitly modeling ordinality acts as a crucial safeguard in automated grading systems. When state-of-the-art foundation models fail to capture the sequential nature of disease progression, integrating an ordinal likelihood improves the predictive robustness and clinical reliability necessary for deploying computational pathology tools in practice.
Related Concept Videos
Calibration Curves: Linear Least Squares
For data that follow a straight line, the standard method for fitting is the linear...
Calibration Curves: Correlation Coefficient
Sieve Analysis and Grading Curves
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Expected Frequencies in Goodness-of-Fit Tests