EPS
← All batches·2605.11607

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

topic: othertop score: 100released: 2026-05-13first surfaced: 2026-05-13arXivPDFthreats2026-05-13

Authors: Haoran Hu, Xingce Wang

arXiv · PDF

Summary

The authors improve probabilistic partial least squares (PPLS)—a likelihood-based method for two-view learning (e.g., linking gene expression and clinical outcomes) that produces interpretable latent factors and calibrated uncertainty. Existing fitting methods couple noise and signal in awkward ways and struggle with orthogonality constraints; this paper separates noise estimation from signal estimation, replaces penalty-based constraint handling with exact optimization on the Stiefel manifold (the space of orthonormal matrices), and provides closed-form standard errors. The result is better-calibrated uncertainty and improved prediction, especially in high-noise settings.

Main takeaways:

  • PPLS is a probabilistic model for two-view learning (e.g., multi-omics data) that jointly estimates latent factors and their uncertainty.
  • Previous methods entangled noise and signal estimation and used awkward penalty methods for orthogonality constraints.
  • This paper pre-estimates noise in a separate subspace, then optimizes the likelihood exactly on the Stiefel manifold (the space of orthonormal matrices).
  • The noise-subspace estimator achieves a signal-strength-independent finite-sample rate and matches a minimax lower bound; the old full-spectrum estimator is provably inconsistent.
  • Experiments on TCGA-BRCA and PBMC CITE-seq show near-nominal coverage without recalibration, Ridge-level accuracy at rank 3, and better stability than competing methods.

Relevance

Not directly related to my persona/midtraining work—this is about probabilistic dimensionality reduction for multi-view data. Included because it's a methodological advance in probabilistic modeling, but no obvious connection to behavioral installation or LLM fine-tuning.

Threat model

Potential threat/caveat for clean result "Fine-tuning one persona on a two-marker chunk and another on the start marker plants the end marker at every donor answer's end, not chained to the start (LOW confidence)": this item discusses benchmark.

Abstract

arXiv:2605.11607v1 Announce Type: new 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 signal-strength-independent leading finite-sample rate and matches a minimax lower bound, while the full-spectrum estimator is shown to be inconsistent under the same model. We further extend the framework to sub-Gaussian settings via optional Gaussianization and provide closed-form standard errors through a block-structured Fisher analysis. Across synthetic high-noise settings and two multi-omics benchmarks (TCGA-BRCA and PBMC CITE-seq), the method achieves near-nominal coverage without post-hoc recalibration, reaches Ridge-level point accuracy on TCGA-BRCA at rank $r=3$, matches or exceeds PO2PLS on cross-view prediction while providing native calibrated uncertainty, and improves stability of parameter recovery.