arXiv Statistics ML
CP-factorization for high dimensional tensor time series and double projection iterations
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Statistics ML
Oct 2
Heteroskedastic Canonical Polyadic Tensor Decomposition
arXiv:2610.00498v1 Announce Type: cross Abstract: When minimizing the squared-error loss, the popular CP decomposition can be interpreted as parameter inference in a Gaussian model with a low-rank me...
arXiv Machine Learning
Jul 21
Unveiling Invariant and Transferable Latent Factors Across Heterogeneous Environments via ATLAS
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.
arXiv Machine Learning
Jul 9
Tensorized algorithms and scalable filtering methods for hidden Markov and factorial hidden Markov models
arXiv:2607. 07008v1 Announce Type: cross Abstract: A common method for the representation and analysis of time-series data is the hidden Markov model (HMM), where each observation is associated with a hidden state that evolves over time.
arXiv Machine Learning
Sep 30
High-Dimensional Partial Least Squares: Spectral Analysis and Fundamental Limitations
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.
arXiv Machine Learning
Jul 31
Sparsity Induced Identifiability in Matrix Tri-Factorisation
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.
arXiv Machine Learning
Jul 7
Analytical Standard Errors for Exploratory Factor Solutions
arXiv:1811. 05336v2 Announce Type: replace-cross Abstract: Inference for factor models is often hampered by the lack of tractable and accurate variance estimates, which can materially distort downstream analyses.