Fetching the paper…
Reading the bibliography…
Natural evolutionary strategies (NES) are a family of gradient-free black-box optimization algorithms.
H.-P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie: mit einer vergleichenden Einführung in die Hill-Climbing-und Zufallsstrategie , Vol. 1 (Springer, 1977)
1977
Earlier work this paper cites.
I. Rechenberg, Evolutionsstrategien, in Simulationsmethoden in der Medizin und Biologie (Springer, 1978) pp. 83–114
1978
Earlier work this paper cites.
J. C. Spall, Multivariate stochastic approximation using a simultaneous perturbation gradient approximation, IEEE Transactions on Automatic Control 37
1992
Earlier work this paper cites.
S.-I. Amari, Natural gradient works efficiently in learning, Neural computation 10
1998
Earlier work this paper cites.
S.-I. Amari and S. C. Douglas, Why natural gradient?, in Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP’98 (Cat. No. 98CH36181) , Vol. 2 (IEEE, 1998) pp. 1213–1216
1998
Earlier work this paper cites.
N. Hansen and A. Ostermeier, Completely derandomized self-adaptation in evolution strategies, Evolutionary computation 9
2001
Earlier work this paper cites.
D. Wierstra, T. Schaul, J. Peters, and J. Schmidhuber, Natural evolution strategies, in 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) (IEEE, 2008) pp. 3381–3387
2008
Earlier work this paper cites.
T. Glasmachers, T. Schaul, S. Yi, D. Wierstra, and J. Schmidhuber, Exponential natural evolution strategies, in Proceedings of the 12th annual conference on Genetic and evolutionary computation (2010) pp. 393–400
2010
Earlier work this paper cites.
C. Loken, D. Gruner, L. Groer, R. Peltier, N. Bunn, M. Craig, T. Henriques, J. Dempsey, C.-H. Yu, J. Chen, L. J. Dursi, J. Chong, S. Northrup, J. Pinto, N. Knecht, and R. V. Zon, SciNet: Lessons learned from building a power-efficient top-20 system and data centre, Journal of Physics: Conference Series 256
2010
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, A variational eigenvalue solver on a photonic quantum processor, Nature communications 5
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
D. Wierstra, T. Schaul, T. Glasmachers, Y. Sun, J. Peters, and J. Schmidhuber, Natural evolution strategies, The Journal of Machine Learning Research 15
2014
Earlier work this paper cites.
J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, The theory of variational hybrid quantum-classical algorithms, New Journal of Physics 18
2016
Earlier work this paper cites.
J. Romero, J. P. Olson, and A. Aspuru-Guzik, Quantum autoencoders for efficient compression of quantum data, Quantum Science and Technology 2
2017
Earlier work this paper cites.
K. H. Wan, O. Dahlsten, H. Kristjánsson, R. Gardner, and M. Kim, Quantum generalisation of feedforward neural networks, npj Quantum Information 3
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2
2018
Earlier work this paper cites.
E. Grant, M. Benedetti, S. Cao, A. Hallam, J. Lockhart, V. Stojevic, A. G. Green, and S. Severini, Hierarchical quantum classifiers, npj Quantum Information 4
2018
Cited alongside, same era.
S. Lloyd and C. Weedbrook, Quantum generative adversarial learning, Physical review letters 121
2018
Cited alongside, same era.
P.-L. Dallaire-Demers and N. Killoran, Quantum generative adversarial networks, Physical Review A 98
2018
Cited alongside, same era.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature communications 9
2018
Cited alongside, same era.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. Johnson, M. Kieferová, I. D. Kivlichan, T. Menke, B. Peropadre, N. P. Sawaya, et al. , Quantum chemistry in the age of quantum computing, Chemical reviews 119
2019
Cited alongside, same era.
A. Pepper, N. Tischler, and G. J. Pryde, Experimental realization of a quantum autoencoder: The compression of qutrits via machine learning, Physical review letters 122
2019
Cited alongside, same era.
2019
Cited alongside, same era.
D. Zhu, N. M. Linke, M. Benedetti, K. A. Landsman, N. H. Nguyen, C. H. Alderete, A. Perdomo-Ortiz, N. Korda, A. Garfoot, C. Brecque, et al. , Training of quantum circuits on a hybrid quantum computer, Science advances 5
2019
Cited alongside, same era.
L. Hu, S.-H. Wu, W. Cai, Y. Ma, X. Mu, Y. Xu, H. Wang, Y. Song, D.-L. Deng, C.-L. Zou, et al. , Quantum generative adversarial learning in a superconducting quantum circuit, Science advances 5
2019
Cited alongside, same era.
2019
Cited alongside, same era.
M. Ponce, R. van Zon, S. Northrup, D. Gruner, J. Chen, F. Ertinaz, A. Fedoseev, L. Groer, F. Mao, B. C. Mundim, M. Nolta, J. Pinto, M. Saldarriaga, V. Slavnic, E. Spence, C.-H. Yu, and W. R. Peltier, Deploying a top-100 supercomputer for large parallel workloads: The niagara supercomputer, in Proceedings of the Practice and Experience in Advanced Research Computing on Rise of the Machines (Learning) , PEARC ’19 (Association for Computing Machinery, New York, NY, USA, 2019)
2019
Cited alongside, same era.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
T. Zhao, G. Carleo, J. Stokes, and S. Veerapaneni, Natural evolution strategies and variational monte carlo, Machine Learning: Science and Technology 2
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2021
Closest in time.
J. Kottmann, S. Alperin-Lea, T. Tamayo-Mendoza, A. Cervera-Lierta, C. Lavigne, T.-C. Yen, V. Verteletskyi, P. Schleich, A. Anand, M. Degroote, S. Chaney, M. Kesibi, N. G. Curnow, B. Solo, G. Tsilimigkounakis, C. Zendejas-Morales, A. F. Izmaylov, and A. Aspuru-Guzik, Tequila: A platform for rapid development of quantum algorithms., Quantum Science and Technology (2021)
2021
Closest in time.
S. Sim, J. R. Fontalvo, J. F. Gonthier, and A. A. Kunitsa, Adaptive pruning-based optimization of parameterized quantum circuits, Quantum Science and Technology (2021)
2021
Closest in time.