Fetching the paper…
Reading the bibliography…
Algorithm selection and hyperparameter tuning remain two of the most challenging tasks in machine learning.
On the efficient design of statistical investigations
Abraham Wald. 1943 · 1943
Earlier work this paper cites.
On Hotelling’s weighing problem
Alexander M Mood et al · 1946
Earlier work this paper cites.
D-optimality for regression designs: a review
RC St John and Norman R Draper. 1975 · 1975
Earlier work this paper cites.
Information-based objective functions for active data selection
David JC MacKay. 1992 · 1992
Earlier work this paper cites.
Optimal design of experiments . Vol. 50
Friedrich Pukelsheim. 1993 · 1993
Earlier work this paper cites.
Meta-Learning by Landmarking Various Learning Algorithms. In ICML . 743–750
Bernhard Pfahringer, Hilan Bensusan, and Christophe G Giraud-Carrier. 2000 · 2000
Earlier work this paper cites.
Maximum entropy sampling and optimal Bayesian experimental design
Paola Sebastiani and Henry P Wynn. 2000 · 2000
Earlier work this paper cites.
Fast sparse Gaussian process methods: The informative vector machine. In Advances in Neural Information Processing Systems . 625–632
Ralf Herbrich, Neil D Lawrence, and Matthias Seeger. 2003 · 2003
Earlier work this paper cites.
Document clustering based on non-negative matrix factorization. In Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval . ACM, 267–273
Wei Xu, Xin Liu, and Yihong Gong. 2003 · 2003
Earlier work this paper cites.
Tuning search algorithms for real-world applications: A regression tree based approach. In Congress on Evolutionary Computation , Vol. 1. IEEE, 1111–1118
Thomas Bartz-Beielstein and Sandor Markon. 2004 · 2004
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe. 2004 · 2004
Earlier work this paper cites.
Ensemble selection from libraries of models. In ICML . ACM, 18
Rich Caruana, Alexandru Niculescu-Mizil, Geoff Crew, and Alex Ksikes. 2004 · 2004
Earlier work this paper cites.
Getting the most out of ensemble selection. In ICDM . IEEE, 828–833
Rich Caruana, Art Munson, and Alexandru Niculescu-Mizil. 2006 · 2006
Earlier work this paper cites.
Performance prediction and automated tuning of randomized and parametric algorithms. In International Conference on Principles and Practice of Constraint Programming . Springer, 213–228
Frank Hutter, Youssef Hamadi, Holger H Hoos, and Kevin Leyton-Brown. 2006 · 2006
Earlier work this paper cites.
Gaussian processes for machine learning
Carl Edward Rasmussen and Christopher KI Williams. 2006 · 2006
Earlier work this paper cites.
Sparse nonnegative matrix factorization for clustering
Jingu Kim and Haesun Park. 2008 · 2008
Earlier work this paper cites.
Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies
Andreas Krause, Ajit Singh, and Carlos Guestrin. 2008 · 2008
Cited alongside, same era.
Predicting execution time of computer programs using sparse polynomial regression. In Advances in Neural Information Processing Systems . 883–891
Ling Huang, Jinzhu Jia, Bin Yu, Byung-Gon Chun, Petros Maniatis, and Mayur Naik. 2010 · 2010
Cited alongside, same era.
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design. In ICML . 1015–1022
Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. 2010 · 2010
Cited alongside, same era.
Collaborative Expert Portfolio Management. In AAAI . 179–184
David H Stern, Horst Samulowitz, Ralf Herbrich, Thore Graepel, Luca Pulina, and Armando Tacchella. 2010 · 2010
Cited alongside, same era.
Algorithms for hyper-parameter optimization. In Advances in Neural Information Processing Systems . 2546–2554
James S Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl. 2011 · 2011
Efficient transfer learning method for automatic hyperparameter tuning. In Artificial Intelligence and Statistics . 1077–1085
Dani Yogatama and Gideon Mann. 2014 · 2014
Later among the works it cites.
Efficient and robust automated machine learning. In Advances in Neural Information Processing Systems . 2962–2970
Matthias Feurer, Aaron Klein, Katharina Eggensperger, Jost Springenberg, Manuel Blum, and Frank Hutter. 2015 · 2015
Later among the works it cites.
Metalearning: a survey of trends and technologies
Christiane Lemke, Marcin Budka, and Bogdan Gabrys. 2015 · 2015
Later among the works it cites.
A review of nonnegative matrix factorization methods for clustering
Ali Caner Türkmen. 2015 · 2015
Later among the works it cites.
Learning hyperparameter optimization initializations. In IEEE International Conference on Data Science and Advanced Analytics . 1–10
M. Wistuba, N. Schilling, and L. Schmidt-Thieme. 2015 · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sequential Model-Based Optimization for General Algorithm Configuration
Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. 2011 · 2011
Cited alongside, same era.
Scikit-learn: Machine Learning in Python
F. Pedregosa, 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 · 2011
Cited alongside, same era.
Discovering the suitability of optimisation algorithms by learning from evolved instances
Kate Smith-Miles and Jano van Hemert. 2011 · 2011
Cited alongside, same era.
Matrix computations
Gene H Golub and Charles F Van Loan. 2012 · 2012
Cited alongside, same era.
Selecting classification algorithms with active testing. In International Workshop on Machine Learning and Data Mining in Pattern Recognition . Springer, 117–131
Rui Leite, Pavel Brazdil, and Joaquin Vanschoren. 2012 · 2012
Cited alongside, same era.
Practical Bayesian optimization of machine learning algorithms. In Advances in Neural Information Processing Systems . 2951–2959
Jasper Snoek, Hugo Larochelle, and Ryan P Adams. 2012 · 2012
Cited alongside, same era.
Collaborative hyperparameter tuning. In ICML . 199–207
Rémi Bardenet, Mátyás Brendel, Balázs Kégl, and Michele Sebag. 2013 · 2013
Cited alongside, same era.
Later among the works it cites.
mlrMBO: A modular framework for model-based optimization of expensive black-box functions
Bernd Bischl, Jakob Richter, Jakob Bossek, Daniel Horn, Janek Thomas, and Michel Lang. 2017 · 2017
Later among the works it cites.
UCI Machine Learning Repository
Dua Dheeru and Efi Karra Taniskidou. 2017 · 2017
Later among the works it cites.
Alors: An algorithm recommender system
Mustafa Mısır and Michèle Sebag. 2017 · 2017
Later among the works it cites.
Autostacker: A compositional evolutionary learning system. In Proceedings of the Genetic and Evolutionary Computation Conference . ACM, 402–409
Boyuan Chen, Harvey Wu, Warren Mo, Ishanu Chattopadhyay, and Hod Lipson. 2018 · 2018
Closest in time.
CF4CF: Recommending Collaborative Filtering Algorithms Using Collaborative Filtering. In Proceedings of the 12th ACM Conference on Recommender Systems (RecSys ’18) . ACM, New York, NY, USA, 357–361
Tiago Cunha, Carlos Soares, and André C. P. L. F. de Carvalho. 2018 · 2018
Closest in time.
AlphaD3M: Machine learning pipeline synthesis. In AutoML Workshop at ICML
Iddo Drori, Yamuna Krishnamurthy, Remi Rampin, Raoni de Paula Lourenco, Jorge Piazentin Ono, Kyunghyun Cho, Claudio Silva, and Juliana Freire. 2018 · 2018
Closest in time.
Probabilistic matrix factorization for automated machine learning. In Advances in Neural Information Processing Systems . 3352–3361
Nicolo Fusi, Rishit Sheth, and Melih Elibol. 2018 · 2018
Closest in time.
Hyperparameter optimization: a spectral approach. In ICLR
Elad Hazan, Adam Klivans, and Yang Yuan. 2018 · 2018
Closest in time.
Why Are Big Data Matrices Approximately Low Rank?
Madeleine Udell and Alex Townsend. 2019 · 2019
Closest in time.
Yuyu Zhang, Mohammad Taha Bahadori, Hang Su, and Jimeng Sun. 2016 · 2074
Closest in time.