Rethinking LDA: moment matching for discrete ICA
Not on the map. Why?
Abstract (arXiv)
We consider moment matching techniques for estimation in Latent Dirichlet Allocation (LDA). By drawing explicit links between LDA and discrete versions of independent component analysis (ICA), we first derive a new set of cumulant-based tensors, with an improved sample complexity. Moreover, we reuse standard ICA techniques such as joint diagonalization of tensors to improve over existing methods based on the tensor power method. In an extensive set of experiments on both synthetic and real datasets, we show that our new combination of tensors and orthogonal joint diagonalization techniques outperforms existing moment matching methods.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jul 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 2; 2025: 1.
5 papers.
- 2023Nonlinear Independent Component Analysis for Principled Disentanglement in Unsupervised Deep Learningcited by 48
- 2024Training Tensor Attention Efficiently: From Cubic to Almost Linear Timecited by 29
- 2024Theoretical Constraints on the Expressive Power of mathsfRoPE-based Tensor Attention Transformerscited by 12
- 2021Binary Independent Component Analysis: A Non-stationarity-based Approachcited by 4
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decodingcited by 2
- 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding14 Mar 2025
- 2024Theoretical Constraints on the Expressive Power of mathsfRoPE-based Tensor Attention Transformers23 Dec 2024
- 2024Training Tensor Attention Efficiently: From Cubic to Almost Linear Time26 May 2024
- 2023Nonlinear Independent Component Analysis for Principled Disentanglement in Unsupervised Deep Learning29 Mar 2023
- 2021Binary Independent Component Analysis: A Non-stationarity-based Approach30 Nov 2021