{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:16Z","timestamp":1740123196470,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T00:00:00Z","timestamp":1616371200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T00:00:00Z","timestamp":1616371200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10994-021-05949-0","type":"journal-article","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T19:02:26Z","timestamp":1616439746000},"page":"857-879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Bayesian optimization with approximate set kernels"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1905-1399","authenticated-orcid":false,"given":"Jungtaek","family":"Kim","sequence":"first","affiliation":[]},{"given":"Michael","family":"McCourt","sequence":"additional","affiliation":[]},{"given":"Tackgeun","family":"You","sequence":"additional","affiliation":[]},{"given":"Saehoon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Seungjin","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,22]]},"reference":[{"key":"5949_CR1","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). k-means++: The advantages of careful seeding. In Proceedings of the ACM-SIAM symposium on discrete algorithms (SODA), pp. 1027\u20131035. New Orleans, Louisiana, USA."},{"key":"5949_CR2","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., & K\u00e9gl, B. (2011). Algorithms for hyper-parameter optimization. In Advances in neural information processing systems (NeurIPS), vol.\u00a024, pp. 2546\u20132554. Granada, Spain."},{"key":"5949_CR3","unstructured":"Brochu, E., Cora, V. M., & de Freitas, N. (2010). A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. arXiv preprint arXiv:1012.2599"},{"key":"5949_CR4","unstructured":"Buathong, P., Ginsbourger, D., & Krityakierne, T. (2020) Kernels over sets of finite sets using RKHS embeddings, with application to Bayesian (combinatorial) optimization. In Proceedings of the international conference on artificial intelligence and statistics (AISTATS), pp. 2731\u20132741. Virtual."},{"key":"5949_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39, 1\u201338.","journal-title":"Journal of the Royal Statistical Society B"},{"key":"5949_CR6","unstructured":"Dua, D., & Graff, C. (2019). UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"5949_CR7","unstructured":"Edwards, H., & Storkey, A. (2017). Towards a neural statistician. In Proceedings of the international conference on learning representations (ICLR). Toulon, France."},{"key":"5949_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/9335","volume-title":"Kernel-based approximation methods using matlab","author":"GE Fasshauer","year":"2015","unstructured":"Fasshauer, G. E., & McCourt, M. M. (2015). Kernel-based approximation methods using matlab. Singapore: World Scientific."},{"key":"5949_CR9","unstructured":"Finn, C., Abbeel, P., & Levine, S. (2017). Model-agnostic meta-learning for fast adaptation of deep networks. In Proceedings of the international conference on machine learning (ICML), pp. 1126\u20131135. Sydney, Australia."},{"key":"5949_CR10","unstructured":"Frazier, P. I. (2018). A tutorial on Bayesian optimization. arXiv preprint arXiv:1807.02811"},{"key":"5949_CR11","doi-asserted-by":"crossref","unstructured":"Frazier, P. I., & Wang, J. (2016). Bayesian optimization for materials design. In Information science for materials discovery and design, pp. 45\u201375. Springer.","DOI":"10.1007\/978-3-319-23871-5_3"},{"key":"5949_CR12","unstructured":"Garnelo, M., Rosenbaum, D., Maddison, C. J., Ramalho, T., Saxton, D., Shanahan, M., Teh, Y. W., Rezende, D. J., & Eslami, S. M. A. (2018). Conditional neural processes. In Proceedings of the international conference on machine learning (ICML), pp. 1690\u20131699. Stockholm, Sweden."},{"key":"5949_CR13","doi-asserted-by":"crossref","unstructured":"Garnett, R., Osborne, M. A., & Roberts, S. J. (2010). Bayesian optimization for sensor set selection. In ACM\/IEEE international conference on information processing in sensor networks (IPSN), pp. 209\u2013219. Stockholm, Sweden.","DOI":"10.1145\/1791212.1791238"},{"key":"5949_CR14","unstructured":"G\u00e4rtner, T., Flach, P. A., Kowalczyk, A., & Smola, A. J. (2002). Multi-instance kernels. In Proceedings of the international conference on machine learning (ICML), pp. 179\u2013186. Sydney, Australia."},{"key":"5949_CR15","first-page":"299","volume":"2","author":"MG Genton","year":"2001","unstructured":"Genton, M. G. (2001). Classes of kernels for machine learning: A statistics perspective. Journal of Machine Learning Research, 2, 299\u2013312.","journal-title":"Journal of Machine Learning Research"},{"key":"5949_CR16","unstructured":"Gonz\u00e1lez, J., Longworth, J., James, D. C., & Lawrence, N. D. (2014). Bayesian optimization for synthetic gene design. In Neural information processing systems workshop on Bayesian optimization (BayesOpt). Montreal, Quebec, Canada."},{"key":"5949_CR17","first-page":"723","volume":"13","author":"A Gretton","year":"2012","unstructured":"Gretton, A., Borgwardt, K. M., Rasch, M. J., Sch\u00f6lkopf, B., & Smola, A. J. (2012). A kernel two-sample test. Journal of Machine Learning Research, 13, 723\u2013773.","journal-title":"Journal of Machine Learning Research"},{"issue":"8","key":"5949_CR18","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1039\/C9MH00589G","volume":"6","author":"S Haghanifar","year":"2019","unstructured":"Haghanifar, S., McCourt, M., Cheng, B., Wuenschell, J., Ohodnicki, P., & Leu, P. W. (2019). Creating glasswing butterfly-inspired durable antifogging superomniphobic supertransmissive, superclear nanostructured glass through Bayesian learning and optimization. Materials Horizons, 6(8), 1632\u20131642.","journal-title":"Materials Horizons"},{"key":"5949_CR19","unstructured":"Hansen, N. (2016). The CMA evolution strategy: A tutorial. arXiv preprint arXiv:1604.00772"},{"key":"5949_CR20","unstructured":"Haussler, D. (1999). Convolution kernels on discrete structures. Tech. rep.: Department of Computer Science, University of California at Santa Cruz."},{"key":"5949_CR21","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011). Sequential model-based optimization for general algorithm configuration. In Proceedings of the international conference on learning and intelligent optimization (LION), pp. 507\u2013523. Rome, Italy.","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"5949_CR22","unstructured":"Ioffe, S., & Szegedy, C. (2015). Batch normalization: Accelerating deep network training by reducing internal covariate shift. In Proceedings of the international conference on machine learning (ICML), pp. 448\u2013456. Lille, France."},{"issue":"1","key":"5949_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D. R., Perttunen, C. D., & Stuckman, B. E. (1993). Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications, 79(1), 157\u2013181.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"5949_CR24","unstructured":"Kandasamy, K., Neiswanger, W., Schneider, J., P\u00f3czos, B., & Xing, E.P. (2018). Neural architecture search with Bayesian optimisation and optimal transport. In Advances in neural information processing systems (NeurIPS), vol.\u00a031, pp. 2016\u20132025. Montreal, Quebec, Canada."},{"key":"5949_CR25","unstructured":"Kandasamy, K., Schneider, J., & P\u00f3czos, B. (2015). High dimensional Bayesian optimisation and bandits via additive models. In Proceedings of the international conference on machine learning (ICML), pp. 295\u2013304. Lille, France."},{"key":"5949_CR26","unstructured":"Kim, J., McCourt, M., You, T., Kim, S., & Choi, S. (2019). Bayesian optimization over sets. In International conference on machine learning workshop on automated machine learning (AutoML). Long Beach, California, USA."},{"issue":"3","key":"5949_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D. C., & Nocedal, J. (1989). On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45(3), 503\u2013528.","journal-title":"Mathematical Programming"},{"issue":"2","key":"5949_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129\u2013137.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1\u20132","key":"5949_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000060","volume":"10","author":"K Muandet","year":"2017","unstructured":"Muandet, K., Fukumizu, K., Sriperumbudur, B., & Sch\u00f6lkopf, B. (2017). Kernel mean embedding of distributions: A review and beyond. Foundations and Trends in Machine Learning, 10(1\u20132), 1\u2013141.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5949_CR30","unstructured":"Paciorek, C. J., & Schervish, M. J. (2004). Nonstationary covariance functions for Gaussian process regression. In Advances in neural information processing systems (NeurIPS), vol.\u00a017, pp. 273\u2013280. Vancouver, BC, Canada."},{"key":"5949_CR31","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"5949_CR32","first-page":"1","volume":"18","author":"V Perrone","year":"2017","unstructured":"Perrone, V., Jenkins, P. A., Spano, D., & Teh, Y. W. (2017). Poisson random fields for dynamic feature models. Journal of Machine Learning Research, 18, 1\u201345.","journal-title":"Journal of Machine Learning Research"},{"key":"5949_CR33","volume-title":"Gaussian processes for machine learning","author":"CE Rasmussen","year":"2006","unstructured":"Rasmussen, C. E., & Williams, C. K. I. (2006). Gaussian processes for machine learning. Cambridge: MIT Press."},{"key":"5949_CR34","volume-title":"Learning with kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. J. (2002). Learning with kernels. Cambridge: MIT Press."},{"issue":"1","key":"5949_CR35","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","volume":"104","author":"B Shahriari","year":"2016","unstructured":"Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016). Taking the human out of the loop: A review of Bayesian optimization. Proceedings of the IEEE, 104(1), 148\u2013175.","journal-title":"Proceedings of the IEEE"},{"key":"5949_CR36","unstructured":"Snoek, J., Larochelle, H., & Adams, R. P. (2012). Practical Bayesian optimization of machine learning algorithms. In Advances in neural information processing systems (NeurIPS), vol.\u00a025, pp. 2951\u20132959. Lake Tahoe, Nevada, USA."},{"key":"5949_CR37","unstructured":"Srinivas, N., Krause, A., Kakade, S., & Seeger, M. (2010). Gaussian process optimization in the bandit setting: No regret and experimental design. In Proceedings of the international conference on machine learning (ICML), pp. 1015\u20131022. Haifa, Israel."},{"key":"5949_CR38","unstructured":"Wang, Z., Shakibi, B., Jin, L., & de Freitas, N. (2014). Bayesian multi-scale optimistic optimization. In Proceedings of the international conference on artificial intelligence and statistics (AISTATS), pp. 1005\u20131014. Reykjavik, Iceland."},{"issue":"301","key":"5949_CR39","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward","year":"1963","unstructured":"Ward, J. H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58(301), 236\u2013244.","journal-title":"Journal of the American Statistical Association"},{"key":"5949_CR40","unstructured":"Wu, Z., Song, S., Khosla, A., Yu, F., Zhang, L., Tang, X., & Xiao, J. (2015). 3D ShapeNets: A deep representation for volumetric shapes. In Proceedings of the IEEE international conference on computer vision and pattern recognition (CVPR), pp. 1912\u20131920. Boston, MA, USA."},{"key":"5949_CR41","unstructured":"Zaheer, M., Kottur, S., Ravanbakhsh, S., Poczos, B., Salakhutdinov, R. R., & Smola, A. J. (2017). Deep sets. In Advances in neural information processing systems (NeurIPS), vol.\u00a030, pp. 3391\u20133401. Long Beach, CA, USA."},{"key":"5949_CR42","unstructured":"Zhou, Q., Park, J., & Koltun, V. (2018). Open3D: A modern library for 3D data processing. arXiv preprint arXiv:1801.09847"},{"key":"5949_CR43","unstructured":"Zoph, B., & Le, Q. V. (2017). Neural architecture search with reinforcement learning. In Proceedings of the international conference on learning representations (ICLR). Toulon, France."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05949-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-05949-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05949-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T15:37:35Z","timestamp":1724686655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-05949-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,22]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["5949"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-05949-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2021,3,22]]},"assertion":[{"value":"19 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}