Fetching the paper…
Reading the bibliography…
The emergence of Quantum Machine Learning (QML) to enhance traditional classical learning methods has seen various limitations to its realisation.
K. P. F.R.S., On lines and planes of closest fit to systems of points in space, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 2
1901
Earlier work this paper cites.
N. Aronszajn, Theory of reproducing kernels, Transactions of the American Mathematical Society 68
1950
Earlier work this paper cites.
R. Bellman, R. Corporation, and K. M. R. Collection, Dynamic Programming , Rand Corporation research study (Princeton University Press, 1957)
1957
Earlier work this paper cites.
T. M. Cover, Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition, IEEE Transactions on Electronic Computers EC-14
1965
Earlier work this paper cites.
G. Kimeldorf and G. Wahba, Some results on tchebycheffian spline functions, Journal of mathematical analysis and applications 33
1971
Earlier work this paper cites.
J. W. Daniel, Stability of the solution of definite quadratic programs, Mathematical Programming 5
1973
Earlier work this paper cites.
B. Li, J. Friedman, R. Olshen, and C. Stone, Classification and regression trees, Biometrics 40
1984
Earlier work this paper cites.
P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
K. P. Bennett, N. Cristianini, J. Shawe-Taylor, and D. Wu, Enlarging the Margins in Perceptron Decision Trees, Machine Learning 41
2000
Earlier work this paper cites.
A. J. Smola and B. Schökopf, Sparse greedy matrix approximation for machine learning, in Proceedings of the Seventeenth International Conference on Machine Learning , ICML ’00 (Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2000) p. 911–918
2000
Earlier work this paper cites.
2001
Earlier work this paper cites.
L. Breiman, Random Forests, Machine Learning 45
2001
Earlier work this paper cites.
C. Williams and M. Seeger, Using the Nystrom method to speed up kernel machines, Advances in Neural Information Processing Systems 13 , 682 (2001)
2001
Earlier work this paper cites.
B. Schölkopf, R. Herbrich, and A. J. Smola, A generalized representer theorem, in Computational Learning Theory , edited by D. Helmbold and B. Williamson (Springer Berlin Heidelberg, Berlin, Heidelberg, 2001) pp. 416–426
2001
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, 2004)
2004
Earlier work this paper cites.
P. Drineas and M. W. Mahoney, On the nystrom method for approximating a gram matrix for improved kernel-based learning, Journal of Machine Learning Research 6
2005
Earlier work this paper cites.
N. Cristianini, J. Kandola, A. Elisseeff, and J. Shawe-Taylor, On kernel target alignment, in Innovations in Machine Learning: Theory and Applications , edited by D. E. Holmes and L. C. Jain (Springer Berlin Heidelberg, Berlin, Heidelberg, 2006) pp. 205–256
2006
Earlier work this paper cites.
A. Christmann and I. Steinwart, Support Vector Machines, Information Science and Statistics 10.1007/978-0-387-77242-4 (2008)
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters 103
2009
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information, Cambridge University Press , 248 (2009)
2009
Earlier work this paper cites.
2010
Earlier work this paper cites.
K. Zhang and J. T. Kwok, Clustered Nyström Method for Large Scale Manifold Learning and Dimension Reduction, IEEE Transactions on Neural Networks 21
2010
Earlier work this paper cites.
2011
Cited alongside, same era.
N. Wiebe, D. Braun, and S. Lloyd, Quantum algorithm for data fitting, Physical Review Letters 109
2012
Cited alongside, same era.
2013
Cited alongside, same era.
A. Crisimini and J. Shotton, Decision Forests for Computer Vision and Medical Image Analysis , Advances in Computer Vision and Pattern Recognition (Springer London, 2013)
2013
Cited alongside, same era.
F. Bach, Sharp analysis of low-rank kernel matrix approximations, JMLR: Workshop and Conference Proceedings (2013)
M. Schuld and F. Petruccione, Quantum ensembles of quantum classifiers, Scientific Reports 8
2018
Later among the works it cites.
B. Schölkopf and A. J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond (The MIT Press, 2018)
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Mohri and A. Rostamizadeh, Foundations of machine learning, second edition, Statistical Papers 60
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
V. Vovk, Kernel ridge regression, in Empirical inference (Springer, 2013) pp. 105–116
2013
Cited alongside, same era.
2013
Cited alongside, same era.
S. Lu and S. L. Braunstein, Quantum decision tree classifier, Quantum Information Processing 13
2014
Cited alongside, same era.
2014
Cited alongside, same era.
J. H. Zar, Spearman rank correlation: Overview, in Wiley StatsRef: Statistics Reference Online (John Wiley & Sons, Ltd, 2014)
2014
Cited alongside, same era.
S. Shalev-Shwartz and S. Ben-David, Understanding Machine Learning: From Theory to Algorithms (Cambridge University Press, 2014)
2014
Cited alongside, same era.
S. Aaronson, Read the fine print, Nature Physics 11
2015
Cited alongside, same era.
M. C. Caro and I. Datta, Pseudo-dimension of quantum circuits, Quantum Machine Intelligence 2
2020
Later among the works it cites.
M. M. Wolf, Mathematical Foundations of Supervised Learning, Lecture notes (2020)
2020
Later among the works it cites.
E. Peters, J. Caldeira, A. Ho, S. Leichenauer, M. Mohseni, H. Neven, P. Spentzouris, D. Strain, and G. N. Perdue, Machine learning of high dimensional data on a noisy quantum processor, npj Quantum Information 7
2021
Later among the works it cites.
2021
Later among the works it cites.
M. Schuld, Supervised quantum machine learning models are kernel methods, arXiv (2021), 2101.11020
2021
Later among the works it cites.
K. Khadiev and L. Safina, The quantum version of prediction for binary classification problem by ensemble methods (2021)
2021
Later among the works it cites.
K. Bu, D. E. Koh, L. Li, Q. Luo, and Y. Zhang, Rademacher complexity of noisy quantum circuits (2021)
2021
Later among the works it cites.
L. Banchi, J. Pereira, and S. Pirandola, Generalization in quantum machine learning: A quantum information standpoint, PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, Connecting ansatz expressibility to gradient magnitudes and barren plateaus, PRX Quantum 3
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
M. Srikumar, Quantum Random Forest, https://github.com/maiyuren/Quantum-Random-Forest (2022)
2022
Closest in time.
J. Jäger and R. V. Krems, Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines (2022)
2022
Closest in time.
R. Shaydulin and S. M. Wild, Importance of kernel bandwidth in quantum machine learning, Phys. Rev. A 106
2022
Closest in time.