arXiv:2607. 18209v1 Announce Type: cross Abstract: This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments.
By Yihong Gu, Katherine Liao, Tianxi Cai
This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments. The joint distribution of the covariates may vary across environments, whereas the latent structure is decomposed into invariant factors with shared loadings and heterogeneous factors with environment-specific loadings.
arXiv:2607. 27507v1 Announce Type: new Abstract: Matrix factorisation is a fundamental tool for exploiting low-dimensional structure in high-dimensional data, with applications such as data compression, denoising, structure discovery, interpretable representation learning, and dimensionality reduction.
By Tingting Mu
arXiv:2606.08560v2 Announce Type: replace-cross
Abstract: We adopt the canonical polyadic (CP) decomposition to model high-dimensional tensor time series. Our primary goal is to identify and estimate...
By Jinyuan Chang, Guanglin Huang, Qiwei Yao, Long Yu
The paper introduces Sparse Separable Factor Analysis (SSFA), a latent factor model designed for complex-valued arrays that preserves amplitude and phase information. SSFA models each mode’s covariance with a low‑rank Hermitian factor structure plus a diagonal residual, applying element‑wise lasso penalties to achieve interpretable, phase‑preserving loadings via complex soft‑thresholding. The method is validated through simulations showing improved covariance estimation over vectorization approaches and applied to local field potential data from mice to compare separability across brain region, frequency, and time, as well as to impute missing recordings due to electrode misplacement.
By Ian Hultman, Kirtikanth Kalapatapu, Yassine Filali, Rainbo Hultman, Sanvesh Srivastava
arXiv:2608. 11917v1 Announce Type: new Abstract: Multi-output Gaussian process regression scales cubically in the number of observations times outputs, and dense kernel-matrix methods need bespoke handling whenever different outputs are observed at different inputs.
By Wouter W. L. Nuijten, Esther G. van Pelt, Albert Podusenko, \.Ismail \c{S}en\"oz, Wouter M. Kouw
arXiv:2407. 21740v3 Announce Type: replace-cross Abstract: Factor analysis, often regarded as a Bayesian variant of matrix factorization, offers superior capabilities in capturing uncertainty, modeling complex dependencies, and ensuring robustness.
By Zhibin Duan, Tiansheng Wen, Yifei Wang, Chen Zhu, Bo Chen, Mingyuan Zhou
arXiv:2312. 07762v3 Announce Type: replace Abstract: Psychiatry research seeks to understand the manifestations of psychopathology in behavior, as measured in questionnaire data, by identifying a small number of latent factors that explain them.
By Ka Chun Lam, Bridget W Mahony, Armin Raznahan, Francisco Pereira
arXiv:2412. 07041v4 Announce Type: replace-cross Abstract: Recovering incomplete multidimensional tensor-structured data is a fundamental task in many real-world applications.
By Mengying Lei, Lijun Sun
arXiv:2606. 28854v1 Announce Type: cross Abstract: The common factor analytic model is related to Helmholtz and Boltzmann machines, can be conceived as a linear autoencoder, or can be thought of as a single-hidden-layer generative neural network.
By Carel F. W. Peeters
arXiv:2601. 18128v2 Announce Type: replace-cross Abstract: High-dimensional data often exhibit variation that can be captured by lower-dimensional factors.
By Gemma E. Moran, Anandi Krishnan
The paper investigates Partial Least Squares (PLS) in high-dimensional settings, focusing on a model where two data matrices share a low-rank latent structure plus individual-specific components. By analyzing the singular vectors of the cross‑covariance matrix with random matrix theory, the authors derive asymptotic characterizations of how well the estimated latent directions align with the true ones. They show that the PLS variant based on Singular Value Decomposition (PLS‑SVD) outperforms separate principal component analysis in detecting the common latent subspace, while also identifying regimes where PLS‑SVD behaves counter‑intuitively or reaches fundamental limits.
By Victor L\'eger, Florent Chatelain