Learning latent variable models by improving spectral solutions with exterior point method

作者: Mehrdad Farajtabar , Byron Boots , Bo Xie , Le Song , Amirreza Shaban

DOI:

关键词:

摘要: Probabilistic latent-variable models are a fundamental tool in statistics and machine learning. Despite their widespread use, identifying the parameters of basic latent variable continues to be an extremely challenging problem. Traditional maximum likelihood-based learning algorithms find valid parameters, but suffer from high computational cost, slow convergence, local optima. In contrast, recently developed spectral computationally efficient provide strong statistical guarantees, not guaranteed parameters. this work, we introduce two-stage algorithm for models. We first use method moments solution that is close optimal necessarily set model then incrementally refine via exterior point until optima arbitrarily near found. perform several experiments on synthetic real-world data show our approach more accurate than previous especially when training limited.

参考文章(30)
Heinz H Bauschke, Regina S Burachik, Patrick L Combettes, Veit Elser, D Russell Luke, Henry Wolkowicz, Fixed-Point Algorithms for Inverse Problems in Science and Engineering Springer. ,(2011) , 10.1007/978-1-4419-9569-8
Borja Balle, Xavier Carreras, Ariadna Quattoni, Local Loss Optimization in Operator Models: A New Insight into Spectral Learning international conference on machine learning. pp. 1819- 1826 ,(2012)
Patrick L. Combettes, Jean-Christophe Pesquet, Proximal Splitting Methods in Signal Processing Fixed-point algorithms for inverse problems in science and engineering, 2011, ISBN 978-1-4419-9568-1, págs. 185-212. pp. 185- 212 ,(2011) , 10.1007/978-1-4419-9569-8_10
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Tushar Chandra, Efficient projections onto thel1-ball for learning in high dimensions Proceedings of the 25th international conference on Machine learning - ICML '08. pp. 272- 279 ,(2008) , 10.1145/1390156.1390191
Roman A. Polyak, Primal-dual exterior point method for convex optimization Optimization Methods & Software. ,vol. 23, pp. 141- 160 ,(2008) , 10.1080/10556780701363065
Lieven De Lathauwer, Bart De Moor, Joos Vandewalle, A Multilinear Singular Value Decomposition SIAM Journal on Matrix Analysis and Applications. ,vol. 21, pp. 1253- 1278 ,(2000) , 10.1137/S0895479896305696
Daniel Hsu, Sham M. Kakade, Learning mixtures of spherical gaussians Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13. pp. 11- 20 ,(2013) , 10.1145/2422436.2422439
Karl Pearson, Contributions to the Mathematical Theory of Evolution Philosophical Transactions of the Royal Society A. ,vol. 185, pp. 71- 110 ,(1894) , 10.1098/RSTA.1894.0003
A. P. Dempster, N. M. Laird, D. B. Rubin, Maximum Likelihood from Incomplete Data Via theEMAlgorithm Journal of the Royal Statistical Society: Series B (Methodological). ,vol. 39, pp. 1- 22 ,(1977) , 10.1111/J.2517-6161.1977.TB01600.X