Fetching the paper…
Reading the bibliography…
The EM algorithm is a novel numerical method to obtain maximum likelihood estimates and is often used for practical calculations.
R. P. Feynman and A. R. Hibbs, Quantum mechanics and path integration . McGrawsHill, 1965
1965
Earlier work this paper cites.
R. P. Feynman, Statistical Mechanics: A Set of Lectures . Benjamin Reading, 1972
1972
Earlier work this paper cites.
A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the em algorithm,” JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , vol. 39, no. 1, pp. 1–38, 1977
1977
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science , vol. 220, no. 4598, pp. 671–680, 1983. [Online]. Available: http://www.sciencemag.org/content/220/4598/671.abstract
1983
Earlier work this paper cites.
C. F. J. Wu, “On the convergence properties of the em algorithm,” Ann. Statist. , vol. 11, no. 1, pp. 95–103, 03 1983. [Online]. Available: http://dx.doi.org/10.1214/aos/1176346060
1983
Earlier work this paper cites.
S. Kirkpatrick, “Optimization by simulated annealing: Quantitative studies,” Journal of Statistical Physics , vol. 34, no. 5-6, pp. 975–986, 1984. [Online]. Available: http://dx.doi.org/10.1007/BF01009452
1984
Earlier work this paper cites.
S. Geman and D. Geman, “Stochastic relaxation, gibbs distributions, and the bayesian restoration of images,” Pattern Analysis and Machine Intelligence, IEEE Transactions on , vol. PAMI-6, no. 6, pp. 721–741, Nov 1984
1984
Earlier work this paper cites.
M. Takahashi and M. Imada, “Monte carlo calculation of quantum systems,” Journal of the Physical Society of Japan , vol. 53, no. 3, pp. 963–974, 1984. [Online]. Available: http://dx.doi.org/10.1143/JPSJ.53.963
1984
Earlier work this paper cites.
——, “Monte carlo calculation of quantum systems. ii. higher order correction,” Journal of the Physical Society of Japan , vol. 53, no. 11, pp. 3765–3769, 1984. [Online]. Available: http://dx.doi.org/10.1143/JPSJ.53.3765
1984
Earlier work this paper cites.
B. Apolloni, C. Carvalho, and D. de Falco, “Quantum stochastic optimization,” Stochastic Processes and their Applications , vol. 33, no. 2, pp. 233–244, 1989. [Online]. Available: http://www.sciencedirect.com/science/article/pii/0304414989900409
1989
Cited alongside, same era.
K. Rose, E. Gurewitz, and G. Fox, “A deterministic annealing approach to clustering,” Pattern Recognition Letters , vol. 11, no. 9, pp. 589–594, 1990. [Online]. Available: http://www.sciencedirect.com/science/article/pii/016786559090010Y
1990
Cited alongside, same era.
K. Rose, E. Gurewitz, and G. C. Fox, “Statistical mechanics and phase transitions in clustering,” Phys. Rev. Lett. , vol. 65, pp. 945–948, Aug 1990. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.65.945
1990
Cited alongside, same era.
A. Finnila, M. Gomez, C. Sebenik, C. Stenson, and J. Doll, “Quantum annealing: A new method for minimizing multidimensional functions,” Chemical Physics Letters , vol. 219, no. 5–6, pp. 343–348, 1994. [Online]. Available: http://www.sciencedirect.com/science/article/pii/0009261494001170
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, “A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem,” Science , vol. 292, no. 5516, pp. 472–475, 2001. [Online]. Available: http://www.sciencemag.org/content/292/5516/472.abstract
2001
Later among the works it cites.
G. E. Santoro, R. Martoňák, E. Tosatti, and R. Car, “Theory of quantum annealing of an ising spin glass,” Science , vol. 295, no. 5564, pp. 2427–2430, 2002. [Online]. Available: http://www.sciencemag.org/content/295/5564/2427.abstract
2002
Later among the works it cites.
R. Martoňák, G. E. Santoro, and E. Tosatti, “Quantum annealing by the path-integral monte carlo method: The two-dimensional random ising model,” Phys. Rev. B , vol. 66, p. 094203, Sep 2002. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevB.66.094203
2002
Later among the works it cites.
G. E. Santoro and E. Tosatti, “Optimization using quantum mechanics: quantum annealing through adiabatic evolution,” Journal of Physics A: Mathematical and General , vol. 39, no. 36, p. R393, 2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1994
Cited alongside, same era.
Z. Ghahramani, G. E. Hinton, et al. , “The em algorithm for mixtures of factor analyzers,” 1996
1996
Cited alongside, same era.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,” Phys. Rev. E , vol. 58, pp. 5355–5363, Nov 1998. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevE.58.5355
1998
Cited alongside, same era.
N. Ueda and R. Nakano, “Deterministic annealing em algorithm,” Neural Networks , vol. 11, no. 2, pp. 271–282, 1998. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0893608097001330
1998
Cited alongside, same era.
J. Brooke, D. Bitko, T. F., Rosenbaum, and G. Aeppli, “Quantum annealing of a disordered magnet,” Science , vol. 284, no. 5415, pp. 779–781, 1999. [Online]. Available: http://www.sciencemag.org/content/284/5415/779.abstract
1999
Cited alongside, same era.
2006
Later among the works it cites.
A. Das and B. K. Chakrabarti, “ Colloquium
2008
Later among the works it cites.
D. de Falco and D. Tamascelli, “Quantum annealing and the schrödinger-langevin-kostin equation,” Phys. Rev. A , vol. 79, p. 012315, Jan 2009. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.79.012315
2009
Later among the works it cites.
——, “An introduction to quantum annealing,” RAIRO - Theoretical Informatics and Applications , vol. 45, pp. 99–116, 1 2011
2011
Later among the works it cites.
K. P. Murphy, Machine learning: a probabilistic perspective . MIT press, 2012
2012
Later among the works it cites.