The proposed multimodal extension shares memberships across modalities with modality-specific basis matrices and can restore identifiability when one modality is insufficient, and establishes identifiability under a pure-subject condition.
Abstract
Matrix-valued observations arise in multiplex networks, neuroimaging, and other domains where population-level patterns are often low-rank and subjects may express several latent patterns simultaneously. Existing tensor PCA methods provide continuous subject scores but their loading matrices can be difficult to interpret as population prototypes, while low-rank clustering yields interpretable prototypes with hard labels. We introduce a low-rank mixed membership model for matrix-valued data in which the expected value of each subject's matrix is a convex combination of latent low-rank basis matrices. The model yields both interpretable population-level extreme profiles and continuous subject-level memberships. Our multimodal extension shares memberships across modalities with modality-specific basis matrices and can restore identifiability when one modality is insufficient. We establish identifiability under a pure-subject condition, propose a constrained least-squares estimator and scalable algorithm with spectral initialization and low-rank refinement, and derive nonasymptotic error bounds. The estimator achieves a minimax-optimal reconstruction rate up to a logarithmic factor, with separate basis and membership convergence rates under a geometric condition. Simulations corroborate the theoretical rates and show strong performance. In an analysis of Human Connectome Project functional connectivity data, the proposed method identifies interpretable brain connectivity profiles whose estimated memberships are strongly associated with cognitive phenotypes.
Through high-probability concentration bounds on the random measurement operator, a novel landscape guarantee with statistically near-optimal sample complexity and recovery error is proved: new guarantees of a benign landscape under a weaker isometry condition.
This work develops efficient algorithms based on the difference-of-convex function algorithm (DCA) and the alternating direction method of multipliers (ADMM) to enhance sparsity and identifiability of the learned factors in separable nonnegative matrix factorization.
NMF-LAB provides a unified, probabilistic, and scalable framework for classification based on nonnegative matrix factorization, which gives rise to two complementary designs that emphasize feature-level interpretability and competitive predictive accuracy.
Kenichi Satoh· Japanese Journal of Statisti...· 1 citation
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.
Ian Hultman, Kirtikanth Kalapatapu, Yassine Filali et al.· 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
Low-rank matrix and tensor bandits exploit structured interactions but typically assume a known reward link. Recent single-index bandit methods accommodate unknown links without directly exploiting matrix or tensor rank. We address this gap by studying stochastic matrix and tensor bandits with an unknown shared Lipschi...
Zhong-Xu Liu, Yue Kang, T. C. M. Lee· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.