SSFA is developed, a latent factor model for complex-valued arrays with a separable covariance structure across modes that improves covariance estimation relative to vectorization-based methods, including complex principal component analysis.
Abstract
Complex-valued arrays arise in signal processing, where scientific interpretation depends on retaining amplitude and phase information. Existing covariance estimation methods either ignore the multiway organization of such data or rely on real-domain embeddings that do not directly exploit their complex structure. We develop sparse separable factor analysis (SSFA), a latent factor model for complex-valued arrays with a separable covariance structure across modes. Each mode-specific covariance matrix is modeled through a low-rank Hermitian factor structure and a diagonal residual covariance matrix. To obtain interpretable estimates, we impose elementwise lasso penalties on the complex loading matrices and estimate the SSFA parameters using a mode-wise parameter-expanded expectation-maximization procedure. The resulting loading updates admit closed-form complex soft-thresholding solutions, which shrink the modulus of each loading while preserving its phase. A separate balancing step resolves the scale nonidentifiability of the separable covariance structure. Simulation studies show that SSFA improves covariance estimation relative to vectorization-based methods, including complex principal component analysis. We apply SSFA to local field potential recordings from mice, where we compare separability structures induced by different groupings of brain region, frequency, and time and perform model-based imputation of recordings missing because of electrode misplacement.
We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational...
Robin Armstrong, Anil Damle, Samuel E. Otto· 0 citations
Simulations and an empirical application show that SMPCA is more accurate and stable than competitors under heavy-tailed distributions and outlier contamination, while retaining competitive performance under light-tailed settings.
Dong-Xu Yang, Wanfeng Liang, Le Zhou et al.· 0 citations
This paper derives non-asymptotic quasi-optimality bounds governed by a regularized inverse Christoffel function associated with the gradient field and shows that additional smoothness of the gradient map yields sharper coherence estimates and motivates tractable importance sampling from kernel diagonal measures.
Fabio Nobile, Matteo Raviola, R. Tempone· 0 citations
Theoretical analysis and numerical experiments demonstrate that the model achieves exact inference with $\mathcal{O}(n \log^2 n)$ training cost and $\mathcal{O}(\log^d n)$ prediction cost, establishing a principled framework for scalable and high-fidelity Gaussian process regression.
Yan-Chuang Cao, Jun Liu, Teng-Chao Yu et al.· arXiv.org· 0 citations
A stochastic, alternating least-squares algorithm that operates on smaller blocks of this dense matrix and scales as a result to much larger problems and is used to analyze the sparse matrix of synaptic weights for the recently published $\textit{Drosphilia}$ connectome.
Lawrence K. Saul, N. Huang, Dennis Bollweg et al.· 1 citation· ⚡1
A Toeplitz-enhanced neural network for DOA estimation, a hybrid physics-informed framework for uniform linear arrays that combines the array signal processing prior with a lightweight learning-based regressor, and results show TENN-DOA achieves a higher resolution probability and lower root mean square error compared w...
Xin Jin, Ya-Nan Fan, Xiu-Juan Yao et al.· Italian National Conference...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.