We present an alternating least squares type numerical optimization scheme to estimate conditionally-independent mixture models in $\mathbb{R}^n$, with minimal additional distributional assumptions. Following the method of moments, we tackle a coupled system of low-rank tensor decomposition problems. The steep costs associated with high-dimensional tensors are avoided, through the development of specialized tensor-free operations. Numerical experiments illustrate the performance of the algorithm and its applicability to various models and applications. In many cases the results exhibit improved reliability over the expectation-maximization algorithm, with similar time and storage costs. We also provide some supporting theory, establishing identifiability and local linear convergence.
翻译:我们提出了一个交替的最小方形数字优化计划,用$\mathbb{R ⁇ ⁇ n$估算有条件独立的混合物模型,并尽可能多地附加分配假设。按照时间方法,我们处理一个低级高压分解问题结合系统。通过开发专门的无虫操作,避免了高维数的高昂成本。数字实验说明了算法的性能及其对各种模型和应用的可适用性。在许多情况下,结果显示比预期-最大化算法的可靠性有所提高,时间和储存成本相似。我们还提供了一些支持理论,确定了可识别性和局部线性趋同性。