Exact Stiefel Optimization for Probabilistic PLS: Closed-Form Updates, Error Bounds, and Calibrated Uncertainty
Haoran Hu, Xingce Wang

TL;DR
This paper introduces an exact Stiefel manifold optimization approach for probabilistic PLS, improving parameter estimation, uncertainty calibration, and prediction accuracy in high-noise and multi-omics data settings.
Contribution
It replaces previous noise averaging with noise-subspace estimation and uses exact Stiefel optimization, enhancing robustness and theoretical guarantees in probabilistic PLS.
Findings
Achieves near-nominal coverage without recalibration.
Reaches Ridge-level accuracy on TCGA-BRCA at rank 3.
Improves stability of parameter recovery in benchmarks.
Abstract
Probabilistic partial least squares (PPLS) is a central likelihood-based model for two-view learning when one needs both interpretable latent factors and calibrated uncertainty. Building on the identifiable parameterization of Bouhaddani et al.\ (2018), existing fitting pipelines still face two practical bottlenecks: noise--signal coupling under joint EM/ECM updates and nontrivial handling of orthogonality constraints. Following the fixed-noise scalar-likelihood line of Hu et al.\ (2025), we develop an end-to-end framework that combines noise pre-estimation, constrained likelihood optimization, and prediction calibration in one pipeline. Relative to Hu et al.\ (2025), we replace full-spectrum noise averaging with noise-subspace estimation and replace interior-point penalty handling with exact Stiefel-manifold optimization. The noise-subspace estimator attains a…
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.
