Dynamics-Based Intrinsic Signal Model for High-Dimensional, Small-Sample Data
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
The Flow has not summarised this story yet — read it at arXiv Statistics ML.
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.
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.
arXiv:2610.07284v1 Announce Type: cross Abstract: Spectral methods are central to high-dimensional statistics and machine learning, underlying procedures for covariance estimation, matrix denoising,...
arXiv:2608. 11995v1 Announce Type: cross Abstract: The robust treatment of environmental and operational variability (EOV) is an open challenge in population-based structural health monitoring (PBSHM).
DANCo (Dimensionality from Angle and Norm Concentration) jointly calibrates nearest-neighbor distance and angular statistics and consistently reaches state-of-the-art accuracy on clean intrinsic-dimen...
SuperPCA is a new algorithm for high‑dimensional principal component analysis that exploits an approximate eigenspace of the sample covariance matrix. The authors show that the subspace spanned by several leading eigenvectors contains useful signal information long before individual eigenvectors converge, and they derive posteriori bounds on the angle between this subspace and the true signal subspace. By using only a small number of subsampled coordinates, SuperPCA can achieve up to a ten‑fold improvement in accuracy over classical PCA while reducing data acquisition costs, especially when the signals are approximately sparse.