Fetching the paper…
Reading the bibliography…
Machine Learning (ML) is one of the most exciting and dynamic areas of modern research and application.
1901
Earlier work this paper cites.
1901
Earlier work this paper cites.
1901
Earlier work this paper cites.
1901
Earlier work this paper cites.
Jeffreys, Harold (1946), “An invariant form for the prior probability in estimation problems,” Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences , 453–461
1946
Earlier work this paper cites.
Shannon, Claude E (1949), “Communication theory of secrecy systems,” Bell Labs Technical Journal 28
1949
Earlier work this paper cites.
Stratonovich, RL (1957), “On a method of calculating quantum distribution functions,” in Soviet Physics Doklady , Vol. 2, p. 416
1957
Earlier work this paper cites.
Srivastava, Nitish, Geoffrey E Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov (2014), “Dropout: a simple way to prevent neural networks from overfitting.” Journal of machine learning research 15
1958
Earlier work this paper cites.
Torgerson, Warren S (1958), “Theory and methods of scaling.”
1958
Earlier work this paper cites.
Hubbard, J (1959), “Calculation of partition functions,” Physical Review Letters 3
1959
Earlier work this paper cites.
Polyak, Boris T (1964), “Some methods of speeding up the convergence of iteration methods,” USSR Computational Mathematics and Mathematical Physics 4
1964
Earlier work this paper cites.
Chalk, Matthew, Olivier Marre, and Gasper Tkacik (2016), “Relevant sparse codes with variational information bottleneck,” in Advances in Neural Information Processing Systems , pp. 1957–1965
1965
Earlier work this paper cites.
Dreyfus, Hubert L (1965), “Alchemy and artificial intelligence,”
1965
Earlier work this paper cites.
Faddeev, Ludvig D, and Victor N Popov (1967), “Feynman diagrams for the yang-mills field,” Physics Letters B 25
1967
Earlier work this paper cites.
Jaynes, Edwin T (1968), “Prior probabilities,” IEEE Transactions on systems science and cybernetics 4
1968
Earlier work this paper cites.
Bennett, Robert (1969), “The intrinsic dimensionality of signal collections,” IEEE Transactions on Information Theory 15
1969
Earlier work this paper cites.
Arimoto, Suguru (1972), “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” IEEE Transactions on Information Theory 18
1972
Earlier work this paper cites.
Blahut, Richard (1972), “Computation of channel capacity and rate-distortion functions,” IEEE transactions on Information Theory 18
1972
Earlier work this paper cites.
Wilson, Kenneth G, and John Kogut (1974), “The renormalization group and the epsilon expansion,” Physics Reports 12
1974
Earlier work this paper cites.
Dempster, Arthur P, Nan M Laird, and Donald B Rubin (1977), “Maximum likelihood from incomplete data via the em algorithm,” Journal of the royal statistical society. Series B (methodological) , 1–38
1977
Earlier work this paper cites.
Efron, B (1979), “Bootstrap methods: another look at the jackknife annals of statistics 7: 1–26,” View Article PubMed/NCBI Google Scholar
1979
Earlier work this paper cites.
Bickel, Peter J, and David A Freedman (1981), “Some asymptotic theory for the bootstrap,” The Annals of Statistics , 1196–1217
1981
Earlier work this paper cites.
Singh, Kesar (1981), “On the asymptotic accuracy of efron’s bootstrap,” The Annals of Statistics , 1187–1195
1981
Earlier work this paper cites.
Hopfield, John J (1982), “Neural networks and physical systems with emergent collective computational abilities,” Proceedings of the national academy of sciences 79
1982
Earlier work this paper cites.
Nesterov, Yurii (1983), “A method of solving a convex programming problem with convergence rate o (1/k2),” in Soviet Mathematics Doklady , Vol. 27, pp. 372–376
1983
Earlier work this paper cites.
Amit, Daniel J, Hanoch Gutfreund, and Haim Sompolinsky (1985), “Spin-glass models of neural networks,” Physical Review A 32
1985
Earlier work this paper cites.
McDermott, Drew, M Mitchell Waldrop, B Chandrasekaran, John McDermott, and Roger Schank (1985), “The dark ages of ai: a panel discussion at aaai-84,” AI Magazine 6
1985
Earlier work this paper cites.
Rumelhart, David E, and David Zipser (1985), “Feature discovery by competitive learning,” Cognitive science 9
1985
Earlier work this paper cites.
Barnes, Josh, and Piet Hut (1986), “A hierarchical o (n log n) force-calculation algorithm,” nature 324
1986
Earlier work this paper cites.
Williams, DRGHR, and Geoffrey Hinton (1986), “Learning representations by back-propagating errors,” Nature 323
1986
Earlier work this paper cites.
Ackley, David H, Geoffrey E Hinton, and Terrence J Sejnowski (1987), “A learning algorithm for boltzmann machines,” in Readings in Computer Vision (Elsevier) pp. 522–533
1987
Earlier work this paper cites.
Rabiner, Lawrence R (1989), “A tutorial on hidden markov models and selected applications in speech recognition,” Proceedings of the IEEE 77
1989
Earlier work this paper cites.
Amit, Daniel J (1992), Modeling brain function: The world of attractor neural networks (Cambridge university press)
1992
Earlier work this paper cites.
Battiti, Roberto (1992), “First-and second-order methods for learning: between steepest descent and newton’s method,” Neural computation 4
1992
Earlier work this paper cites.
Berger, James O, and José M Bernardo (1992), “On the development of the reference prior method,” Bayesian statistics 4
1992
Earlier work this paper cites.
White, Steven R (1992), “Density matrix formulation for quantum renormalization groups,” Physical review letters 69
1992
Earlier work this paper cites.
Freund, Yoav, and Robert E Schapire (1995), “A desicion-theoretic generalization of on-line learning and an application to boosting,” in European conference on computational learning theory (Springer) pp. 23–37
1995
Earlier work this paper cites.
LeCun, Yann, Yoshua Bengio, et al. (1995), “Convolutional networks for images, speech, and time series,” The handbook of brain theory and neural networks 3361
1995
Earlier work this paper cites.
Breiman, Leo (1996), “Bagging predictors,” Machine learning 24
1996
Earlier work this paper cites.
Ester, Martin, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu, et al. (1996), “A density-based algorithm for discovering clusters in large spatial databases with noise.” in Kdd , Vol. 96, pp. 226–231
1996
Earlier work this paper cites.
Jaynes, Edwin T (1996), Probability theory: the logic of science (Washington University St. Louis, MO)
1996
Earlier work this paper cites.
Kleijnen, Jack PC, and Reuven Y Rubinstein (1996), “Optimization and sensitivity analysis of computer simulation models by the score function method,” European Journal of Operational Research 88
1996
Earlier work this paper cites.
Jarzynski, Christopher (1997), “Nonequilibrium equality for free energy differences,” Physical Review Letters 78
1997
Earlier work this paper cites.
Burges, Christopher JC (1998), “A tutorial on support vector machines for pattern recognition,” Data mining and knowledge discovery 2
1998
Earlier work this paper cites.
Eisen, Michael B, Paul T Spellman, Patrick O Brown, and David Botstein (1998), “Cluster analysis and display of genome-wide expression patterns,” Proceedings of the National Academy of Sciences 95
1998
Earlier work this paper cites.
Ho, Tin Kam (1998), “The random subspace method for constructing decision forests,” IEEE transactions on pattern analysis and machine intelligence 20
1998
Earlier work this paper cites.
Kohonen, Teuvo (1998), “The self-organizing map,” Neurocomputing 21
1998
Earlier work this paper cites.
Neal, Radford M, and Geoffrey E Hinton (1998), “A view of the em algorithm that justifies incremental, sparse, and other variants,” in Learning in graphical models (Springer) pp. 355–368
1998
Earlier work this paper cites.
Sander, Jörg, Martin Ester, Hans-Peter Kriegel, and Xiaowei Xu (1998), “Density-based clustering in spatial databases: The algorithm gdbscan and its applications,” Data mining and knowledge discovery 2
1998
Earlier work this paper cites.
Sutton, Richard S, and Andrew G Barto (1998), Reinforcement learning: An introduction , Vol. 1 (MIT press Cambridge)
1998
Earlier work this paper cites.
Freund, Yoav, Robert Schapire, and Naoki Abe (1999), “A short introduction to boosting,” Journal-Japanese Society For Artificial Intelligence 14
1999
Earlier work this paper cites.
Jordan, Michael I, Zoubin Ghahramani, Tommi S Jaakkola, and Lawrence K Saul (1999), “An introduction to variational methods for graphical models,” Machine learning 37
1999
Earlier work this paper cites.
Larsen, Bjornar, and Chinatsu Aone (1999), “Fast and effective text mining using linear-time document clustering,” in Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining (ACM) pp. 16–22
1999
Earlier work this paper cites.
Qian, Ning (1999), “On the momentum term in gradient descent learning algorithms,” Neural networks 12
1999
Earlier work this paper cites.
Cox, Trevor F, and Michael AA Cox (2000), Multidimensional scaling (CRC press)
2000
Earlier work this paper cites.
Dietterich, Thomas G, et al. (2000), “Ensemble methods in machine learning,” Multiple classifier systems 1857
2000
Earlier work this paper cites.
Lim, Tjen-Sien, Wei-Yin Loh, and Yu-Shan Shih (2000), “A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms,” Machine learning 40
2000
Earlier work this paper cites.
Roweis, Sam T, and Lawrence K Saul (2000), “Nonlinear dimensionality reduction by locally linear embedding,” science 290
2000
Earlier work this paper cites.
Tenenbaum, Joshua B, Vin De Silva, and John C Langford (2000), “A global geometric framework for nonlinear dimensionality reduction,” science 290
2000
Earlier work this paper cites.
Tishby, Naftali, Fernando C Pereira, and William Bialek (2000), “The information bottleneck method,” arXiv preprint physics/0004057
2000
Earlier work this paper cites.
Breiman, Leo (2001), “Random forests,” Machine learning 45
2001
Earlier work this paper cites.
Friedman, Jerome, Trevor Hastie, and Robert Tibshirani (2001), The elements of statistical learning , Vol. 1 (Springer series in statistics New York)
2001
Earlier work this paper cites.
Friedman, Jerome H (2001), “Greedy function approximation: a gradient boosting machine,” Annals of statistics , 1189–1232
2001
Earlier work this paper cites.
Neal, Radford M (2001), “Annealed importance sampling,” Statistics and computing 11
2001
Earlier work this paper cites.
Yedidia, Jonathan (2001), “An idiosyncratic journey beyond mean field theory,” Advanced mean field methods: Theory and practice , 21–36
2001
Earlier work this paper cites.
Friedman, Jerome H (2002), “Stochastic gradient boosting,” Computational Statistics & Data Analysis 38
2002
Earlier work this paper cites.
Hinton, Geoffrey E (2002), “Training products of experts by minimizing contrastive divergence,” Neural computation 14
2002
Earlier work this paper cites.
Andrieu, Christophe, Nando De Freitas, Arnaud Doucet, and Michael I Jordan (2003), “An introduction to mcmc for machine learning,” Machine learning 50
2003
Earlier work this paper cites.
Friedman, Jerome H, Bogdan E Popescu, et al. (2003), “Importance sampled learning ensembles,” Journal of Machine Learning Research 94305
2003
Earlier work this paper cites.
Jaynes, Edwin T (2003), Probability theory: the logic of science (Cambridge university press)
2003
Earlier work this paper cites.
MacKay, David JC (2003), Information theory, inference and learning algorithms (Cambridge university press)
2003
Earlier work this paper cites.
Székely, GJ (2003), “E-statistics: The energy of statistical samples,” Bowling Green State University, Department of Mathematics and Statistics Technical Report 3
2003
Earlier work this paper cites.
Yedidia, Jonathan S, William T Freeman, and Yair Weiss (2003), “Understanding belief propagation and its generalizations,” Morgan Kaufmann Publishers Inc. San Francisco, CA, USA
2003
Earlier work this paper cites.
Boyd, Stephen, and Lieven Vandenberghe (2004), Convex optimization (Cambridge university press)
2004
Earlier work this paper cites.
Efron, Bradley, Trevor Hastie, Iain Johnstone, Robert Tibshirani, et al. (2004), “Least angle regression,” The Annals of statistics 32
2004
Earlier work this paper cites.
Chechik, Gal, Amir Globerson, Naftali Tishby, and Yair Weiss (2005), “Information bottleneck for gaussian variables,” Journal of machine learning research 6
2005
Earlier work this paper cites.
Rokach, Lior, and Oded Maimon (2005), “Clustering methods,” in Data mining and knowledge discovery handbook (Springer) pp. 321–352
2005
Earlier work this paper cites.
Slonim, Noam, Gurinder S Atwal, Gasper Tkacik, and William Bialek (2005), “Estimating mutual information and multi–information in large networks,” arXiv preprint cs/0502017
2005
Earlier work this paper cites.
Zou, Hui, and Trevor Hastie (2005), “Regularization and variable selection via the elastic net,” Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67
2005
Earlier work this paper cites.
Adam, Alison (2006), Artificial knowing: Gender and the thinking machine (Routledge)
2006
Earlier work this paper cites.
Bickel, Peter J, Bo Li, Alexandre B Tsybakov, Sara A van de Geer, Bin Yu, Teófilo Valdés, Carlos Rivero, Jianqing Fan, and Aad van der Vaart (2006), “Regularization in statistics,” Test 15
2006
Earlier work this paper cites.
Bishop, C M (2006), Pattern recognition and machine learning (springer)
2006
Earlier work this paper cites.
Donoho, David L (2006), “Compressed sensing,” IEEE Transactions on information theory 52
2006
Earlier work this paper cites.
Fu, Michael C (2006), “Gradient estimation,” Handbooks in operations research and management science 13
2006
Earlier work this paper cites.
Geurts, Pierre, Damien Ernst, and Louis Wehenkel (2006), “Extremely randomized trees,” Machine learning 63
2006
Earlier work this paper cites.
Hinton, Geoffrey E, Simon Osindero, and Yee-Whye Teh (2006), “A fast learning algorithm for deep belief nets,” Neural computation 18
2006
Earlier work this paper cites.
Hinton, Geoffrey E, and Ruslan R Salakhutdinov (2006), “Reducing the dimensionality of data with neural networks,” science 313
2006
Earlier work this paper cites.
Lehmann, Erich L, and George Casella (2006), Theory of point estimation (Springer Science & Business Media)
2006
Earlier work this paper cites.
Lehmann, Erich L, and Joseph P Romano (2006), Testing statistical hypotheses (Springer Science & Business Media)
2006
Earlier work this paper cites.
Schneidman, Elad, Michael J Berry II, Ronen Segev, and William Bialek (2006), “Weak pairwise correlations imply strongly correlated network states in a neural population,” Nature 440
2006
Earlier work this paper cites.
Sethna, James (2006), Statistical mechanics: entropy, order parameters, and complexity , Vol. 14 (Oxford University Press)
2006
Earlier work this paper cites.
Yang, Tynia, Jinze Liu, Leonard McMillan, and Wei Wang (2006), “A fast approximation to multidimensional scaling,” in IEEE workshop on Computation Intensive Methods for Computer Vision
2006
Earlier work this paper cites.
Vergassola, Massimo, Emmanuel Villermaux, and Boris I Shraiman (2007), Nature 445
2007
Earlier work this paper cites.
Vidal, Guifre (2007), “Entanglement renormalization,” Physical review letters 99
2007
Earlier work this paper cites.
Do, Chuong B, and Serafim Batzoglou (2008), “What is the expectation maximization algorithm?” Nature biotechnology 26
2008
Earlier work this paper cites.
Maaten, Laurens van der, and Geoffrey Hinton (2008), “Visualizing data using t-sne,” Journal of machine learning research 9
2008
Earlier work this paper cites.
Wainwright, Martin J, Michael I Jordan, et al. (2008), “Graphical models, exponential families, and variational inference,” Foundations and Trends® in Machine Learning 1
2008
Earlier work this paper cites.
Kriegel, Hans-Peter, Peer Kröger, and Arthur Zimek (2009), “Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering,” ACM Transactions on Knowledge Discovery from Data (TKDD) 3
2009
Earlier work this paper cites.
Masson, JB, M Bailly Bechet, and Massimo Vergassola (2009), “Chasing information to search in random environments,” Journal of Physics A: Mathematical and Theoretical 42
2009
Earlier work this paper cites.
Mezard, Marc, and Andrea Montanari (2009), Information, physics, and computation (Oxford University Press)
2009
Earlier work this paper cites.
Tieleman, Tijmen, and Geoffrey Hinton (2009), “Using fast weights to improve persistent contrastive divergence,” in Proceedings of the 26th Annual International Conference on Machine Learning (ACM) pp. 1033–1040
2009
Earlier work this paper cites.
Weigt, Martin, Robert A White, Hendrik Szurmant, James A Hoch, and Terence Hwa (2009), “Identification of direct residue contacts in protein–protein interaction by message passing,” Proceedings of the National Academy of Sciences 106
2009
Earlier work this paper cites.
Dahl, George, Abdel-rahman Mohamed, Geoffrey E Hinton, et al. (2010), “Phone recognition with the mean-covariance restricted boltzmann machine,” in Advances in neural information processing systems , pp. 469–477
2010
Earlier work this paper cites.
Glorot, Xavier, and Yoshua Bengio (2010), “Understanding the difficulty of training deep feedforward neural networks,” in Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics , pp. 249–256
2010
Earlier work this paper cites.
Duchi, John, Elad Hazan, and Yoram Singer (2011), “Adaptive subgradient methods for online learning and stochastic optimization,” Journal of Machine Learning Research 12
2011
Earlier work this paper cites.
Elith, Jane, Steven J Phillips, Trevor Hastie, Miroslav Dudík, Yung En Chee, and Colin J Yates (2011), “A statistical explanation of maxent for ecologists,” Diversity and distributions 17
2011
Earlier work this paper cites.
Loh, Wei-Yin (2011), “Classification and regression trees,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 1
2011
Earlier work this paper cites.
Mehta, Pankaj, David J Schwab, and Anirvan M Sengupta (2011), “Statistical mechanics of transcription-factor binding site discovery using hidden markov models,” Journal of statistical physics 142
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
Neal, Radford M, et al. (2011), “Mcmc using hamiltonian dynamics,” Handbook of Markov Chain Monte Carlo 2
2011
Earlier work this paper cites.
Pedregosa, F, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay (2011), “Scikit-learn: Machine learning in Python,” Journal of Machine Learning Research 12
2011
Earlier work this paper cites.
Abu-Mostafa, Yaser S, Malik Magdon-Ismail, and Hsuan-Tien Lin (2012), Learning from data , Vol. 4 (AMLBook New York, NY, USA:)
2012
Earlier work this paper cites.
Barber, David (2012), Bayesian reasoning and machine learning (Cambridge University Press)
2012
Cited alongside, same era.
Barra, Adriano, Alberto Bernacchia, Enrica Santucci, and Pierluigi Contucci (2012), “On the equivalence of hopfield networks and boltzmann machines,” Neural Networks 34
2012
Cited alongside, same era.
Bengio, Yoshua (2012), “Practical recommendations for gradient-based training of deep architectures,” in Neural networks: Tricks of the trade (Springer) pp. 437–478
2012
Cited alongside, same era.
Bottou, Léon (2012), “Stochastic gradient descent tricks,” in Neural networks: Tricks of the trade (Springer) pp. 421–436
2012
Cited alongside, same era.
Domingos, Pedro (2012), “A few useful things to know about machine learning,” Communications of the ACM 55
2012
Cited alongside, same era.
2017
Later among the works it cites.
Lake, Brenden M, Tomer D Ullman, Joshua B Tenenbaum, and Samuel J Gershman (2017), “Building machines that learn and think like people,” Behavioral and Brain Sciences 40
2017
Later among the works it cites.
Lamata, Lucas (2017), “Basic protocols in quantum reinforcement learning with superconducting circuits,” Scientific Reports 7
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gersho, Allen, and Robert M Gray (2012), Vector quantization and signal compression , Vol. 159 (Springer Science & Business Media)
2012
Cited alongside, same era.
Hinton, Geoffrey E (2012), “A practical guide to training restricted boltzmann machines,” in Neural networks: Tricks of the trade (Springer) pp. 599–619
2012
Cited alongside, same era.
Krizhevsky, Alex, Ilya Sutskever, and Geoffrey E Hinton (2012), “Imagenet classification with deep convolutional neural networks,” in Advances in neural information processing systems , pp. 1097–1105
2012
Cited alongside, same era.
Krzakala, Florent, Marc Mézard, Francois Sausset, Yifan Sun, and Lenka Zdeborová (2012b), “Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices,” Journal of Statistical Mechanics: Theory and Experiment 2012
2012
Cited alongside, same era.
Murphy, Kevin (2012), Machine Learning: A Probabilistic Perspective (MIT press)
2012
Cited alongside, same era.
Schapire, Robert E, and Yoav Freund (2012), Boosting: Foundations and algorithms (MIT press)
2012
Cited alongside, same era.
Stoudenmire, EM, and Steven R White (2012), “Studying two-dimensional systems with the density matrix renormalization group,” Annu. Rev. Condens. Matter Phys. 3
2012
Cited alongside, same era.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Lin, Henry W, Max Tegmark, and David Rolnick (2017), “Why does deep and cheap learning work so well?” Journal of Statistical Physics 168
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Metz, Cade (2017), “Move over, coders-physicists will soon rule silicon valley,” Https://deepmind.com/blog/deepmind-ai-reduces-google-data-centre-cooling-bill-40/
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Nguyen, H Chau, Riccardo Zecchina, and Johannes Berg (2017), “Inverse statistical problems: from the inverse ising problem to data science,” Advances in Physics 66
2017
Later among the works it cites.
2017
Later among the works it cites.
Ohtsuki, Tomi, and Tomoki Ohtsuki (2017), “Deep learning the quantum phase transitions in random electron systems: Applications to three dimensions,” Journal of the Physical Society of Japan 86
2017
Later among the works it cites.
O’Neil, Cathy (2017), Weapons of math destruction: How big data increases inequality and threatens democracy (Broadway Books)
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Ramezanpour, A (2017), “Optimization by a quantum reinforcement algorithm,” Phys. Rev. A 96
2017
Later among the works it cites.
2017
Later among the works it cites.
Ravanbakhsh, Siamak, Francois Lanusse, Rachel Mandelbaum, Jeff G Schneider, and Barnabas Poczos (2017), “Enabling dark energy science with deep generative models of galaxy images.” in AAAI , pp. 1488–1494
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Schindler, Frank, Nicolas Regnault, and Titus Neupert (2017), “Probing many-body localization with neural networks,” Phys. Rev. B 95
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Strouse, DJ, and David J Schwab (2017), “The deterministic information bottleneck,” Neural computation 29
2017
Later among the works it cites.
2017
Later among the works it cites.
Torlai, Giacomo, and Roger G. Melko (2017), “Neural decoder for topological codes,” Phys. Rev. Lett. 119
2017
Later among the works it cites.
2017
Later among the works it cites.
Tubiana, Jérôme, and Rémi Monasson (2017), “Emergence of compositional representations in restricted boltzmann machines,” Physical Review Letters 118
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Wang, Lei (2017), “Can boltzmann machines discover cluster updates?” arXiv preprint arXiv:1702.08586
2017
Later among the works it cites.
Wei, Qianshi, Roger G Melko, and Jeff ZY Chen (2017), “Identifying polymer states by machine learning,” Physical Review E 95
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Baldassi, Carlo, Federica Gerace, Luca Saglietti, and Riccardo Zecchina (2018), “From inverse problems to learning: a statistical mechanics approach,” in Journal of Physics: Conference Series , Vol. 955 (IOP Publishing) p. 012001
2018
Closest in time.
Bény, Cédric (2018), “Inferring relevant features: from qft to pca,” arXiv preprint arXiv:1802.05756
2018
Closest in time.
2018
Closest in time.
Bukov, Marin (2018), “Reinforcement learning for autonomous preparation of floquet-engineered states: Inverting the quantum kapitza oscillator,” Phys. Rev. B 98
2018
Closest in time.
Bukov, Marin, Alexandre G. R. Day, Dries Sels, Phillip Weinberg, Anatoli Polkovnikov, and Pankaj Mehta (2018), “Reinforcement learning in different phases of quantum control,” Phys. Rev. X 8
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Carleo, Giuseppe (2018), , Private Communication
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Chen, Jing, Song Cheng, Haidong Xie, Lei Wang, and Tao Xiang (2018), “Equivalence of restricted boltzmann machines and tensor network states,” Phys. Rev. B 97
2018
Closest in time.
2018
Closest in time.
Daskin, Ammar (2018), “A quantum implementation model for artificial neural networks,” Quanta , 7–18
2018
Closest in time.
2018
Closest in time.
Day, Alexandre GR, and Pankaj Mehta (2018), “Validated agglomerative clustering,” in preparation
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Jordan, Michael (2018), “Artificial intelligence: The revolution hasn’t happened yet. medium,”
2018
Closest in time.
Kong, Qingkai, Daniel T. Trugman, Zachary E. Ross, Michael J. Bianco, Brendan J. Meade, and Peter Gerstoft (2018), “Machine learning in seismology: Turning data into insights,” Seismological Research Letters 10.1785/0220180259
2018
Closest in time.
Li, Richard Y, Rosa Di Felice, Remo Rohs, and Daniel A Lidar (2018), “Quantum annealing versus classical machine learning applied to a simplified computational biology problem,” npj Quantum Information 4
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Mattingly, Henry H, Mark K Transtrum, Michael C Abbott, and Benjamin B Machta (2018), “Maximizing the information learned from finite data selects a simple model,” Proceedings of the National Academy of Sciences 115
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Rocchetto, Andrea, Edward Grant, Sergii Strelchuk, Giuseppe Carleo, and Simone Severini (2018), “Learning hard quantum distributions with variational autoencoders,” npj Quantum Information 4
2018
Closest in time.
Rudelius, Tom (2018), “Learning to inflate,” arXiv preprint arXiv:1810.05159
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Simonite, Tom (2018), “Should data scientist adhere to a hippocratic oath?” Wired
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Tomczak, P, and H. Puszkarski (2018), “Ferromagnetic resonance in thin films studied via cross-validation of numerical solutions of the smit-beljers equation: Application to (ga,mn)as,” Phys. Rev. B 98
2018
Closest in time.
Torlai, Giacomo, Guglielmo Mazzola, Juan Carrasquilla, Matthias Troyer, Roger Melko, and Giuseppe Carleo (2018), “Neural-network quantum state tomography,” Nature Physics 14
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
Day, Alexandre GR, Marin Bukov, Phillip Weinberg, Pankaj Mehta, and Dries Sels (2019), “Glassy phase of optimal quantum control,” Physical Review Letters 122
2019
Closest in time.
Huggins, William, Piyush Patil, Bradley Mitchell, K Birgitta Whaley, and E Miles Stoudenmire (2019), “Towards quantum machine learning with tensor networks,” Quantum Science and Technology 4
2019
Closest in time.