Searcharxiv⌕ Search

arXiv · 2610.32843

Out-of-sample prediction in SEM: A simulation-based comparison of maximum likelihood and (consistent) partial least squares

Abstract

Structural equation modeling (SEM) is widely used to study relationships among unobserved constructs. Over recent years, the interest in computing predictions with SEM has grown. Different prediction procedures have been proposed for this purpose, including MLpredict, which is based on maximum likelihood (ML) estimation, and PLS(c)predict, which is based on partial least squares (PLS). The out-of-sample predictive performances of these procedures have not yet been compared. In our work, we conduct a comprehensive Monte Carlo study to compare out-of-sample predictions of MLpredict and PLS(c)predict for indicators associated with endogenous constructs, so-called operative predictions. Here, we vary key design factors regarding, for instance, the strengths of structural relations, the training sample size, and the construct types in the data generating processes, which determine the presence or absence of construct misspecification. Across the investigated conditions, MLpredict and PLS(c)predict exhibit similar predictive performance according to two assessment criteria, indicating that neither procedure is uniformly superior for operative prediction. Out-of-sample predictive performance is driven mainly by the strength of the relations between the variables, whereas training sample size and construct misspecification have comparatively little influence on it. An exception is the occasionally inflated prediction error of PLScpredict, which is in line with previous findings for ordinal indicators. Overall, our results suggest that, in the studied setting, fine-grained methodological differences between traditional SEM and PLS-based procedures matter less for out-of-sample predictive performance than properties of the data generating process, such as the coefficient of determination of endogenous constructs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonas Bauer, Florian Schuberth, Christiane Fuchs, Tamara Schamberger. 2026-10-23. Out-of-sample prediction in SEM: A simulation-based comparison of maximum likelihood and (consistent) partial least squares. https://arxiv.org/abs/2610.32843

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Selection from Hierarchical Data with Conformal e-values

Distribution-free predictive inference beyond the construction of prediction sets has gained a lot of interest in recent applications. One such application is the selection task, where the objective is to design a reliable selection rule to pick out individuals with desired unobserved outcomes while controlling the error rate. In this work, we address the selection problem in the context of hierarchical data, where groups of observations may exhibit distinct within-group distributions. This generalizes existing techniques beyond the standard i.i.d./exchangeable data settings. As a correction, For hierarchical data, we introduce methods to construct valid conformal e-values, enabling control of the false discovery rate (FDR) through the e-BH procedure. In particular, we introduce and compare two approaches -- subsampling conformal e-values and hierarchical conformal e-values. Empirical results demonstrate that both approaches achieve valid FDR control while highlighting a tradeoff between stability and power. The subsampling-based method, though random, typically offers higher power, whereas the hierarchical approach, being deterministic, tends to be slightly less powerful. The effectiveness of the proposed methods is illustrated in two real-world applications.

stat.ME↗

Conformalized Polynomial Chaos Expansion for Uncertainty-aware Surrogate Modeling

This work introduces a method to equip data-driven polynomial chaos expansion surrogate models with intervals that quantify the predictive uncertainty of the surrogate. To that end, jackknife-based conformal prediction is integrated into regression-based polynomial chaos expansions. The jackknife algorithm uses leave-one-out residuals to generate predictive intervals around the predictions of the polynomial chaos surrogate. The jackknife+ extension additionally requires leave-one-out model predictions. Both methods allow to use the entire dataset for model training and do not require a hold-out dataset for prediction interval calibration. The key to efficient implementation is to leverage the linearity of the polynomial chaos regression model, so that leave-one-out residuals and, if necessary, leave-one-out model predictions can be computed with analytical, closed-form expressions. This eliminates the need for repeated model re-training. The conformalized polynomial chaos expansion method is first validated on four benchmark models and then applied to two electrical engineering design use-cases. The method produces predictive intervals that provide the target coverages, even for low-accuracy models trained with small datasets. At the same time, training data availability plays a crucial role in improving the empirical coverage and narrowing the predictive interval, as well as in reducing their variability over different training datasets.

stat.ME↗

High-dimensional reliability-oriented Shapley effects estimation

This article presents a new estimation scheme for the reliability-oriented Shapley effects when there is a large number of correlated input variables, using a unique sample of failure points. First, we propose a new reformulation of the reliability-oriented closed Sobol indices. This reformulation circumvents the estimation issues associated with existing methods in the literature, but requires estimating densities in potentially high dimensions. Once the reliability-oriented closed Sobol indices have been estimated through these densities, the reliability-oriented Shapley effects are estimated through permutation aggregation to circumvent the issue related to the dimension. In addition, we provide an error estimation procedure relying on the same sample of failing points resulting in a probabilistic error bound, and avoiding any additional call to the model. We illustrate our methodology on numerical use-cases where we compare several density estimators and we propose an application to the monitoring of adaptive importance sampling.

stat.ME↗