{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:55:21Z","timestamp":1772556921160,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ANR","award":["ANR-18-CE91-0007"],"award-info":[{"award-number":["ANR-18-CE91-0007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11222-022-10184-1","type":"journal-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T22:02:36Z","timestamp":1670450556000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Performance analysis of greedy algorithms for minimising a Maximum Mean Discrepancy"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7704-9222","authenticated-orcid":false,"given":"Luc","family":"Pronzato","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"10184_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"S Ahipa\u015fao\u011flu","year":"2008","unstructured":"Ahipa\u015fao\u011flu, S., Sun, P., Todd, M.: Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Mehods Softw. 23, 5\u201319 (2008)","journal-title":"Optim. Mehods Softw."},{"issue":"2","key":"10184_CR2","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1214\/aos\/1176342371","volume":"1","author":"C Atwood","year":"1973","unstructured":"Atwood, C.: Sequences converging to $${D}$$-optimal designs of experiments. Ann. Stat. 1(2), 342\u2013352 (1973)","journal-title":"Ann. Stat."},{"key":"10184_CR3","unstructured":"Bach, F., Lacoste-Julien, S., Obozinski, G.: On the equivalence between herding and conditional gradient algorithms. In Proc. 29th Annual International Conference on Machine Learning, pp. 1355\u20131362 (2012)"},{"key":"10184_CR4","unstructured":"Briol, F.-X., Oates, C., Girolami, M., Osborne, M.: Frank\u2013Wolfe Bayesian quadrature: probabilistic integration with theoretical guarantees. Adv. Neural Inform. Process. Syst. 28, pp. 1162\u20131170 (2015)"},{"issue":"1","key":"10184_CR5","first-page":"1","volume":"34","author":"F-X Briol","year":"2019","unstructured":"Briol, F.-X., Oates, C., Girolami, M., Osborne, M., Sejdinovic, D.: Probabilistic integration: a role in statistical computation? Stat. Sci. 34(1), 1\u201322 (2019)","journal-title":"Stat. Sci."},{"key":"10184_CR6","unstructured":"Chen, W., Barp, A., Briol, F.-X., Gorham, J., Girolami, M., Mackey, L., Oates, C.: Stein point Markov Chain Monte Carlo. arXiv preprint arXiv:1905.03673 (2019)"},{"key":"10184_CR7","unstructured":"Chen, W., Mackey, L., Gorham, J., Briol, F.-X., Oates, C.: Stein points. arXiv preprint arXiv:1803.10161v4, Proc. ICML (2018)"},{"key":"10184_CR8","unstructured":"Chen, Y., Welling, M., Smola, A.: Super-samples from kernel herding. In Proceedings 26th Conference on Uncertainty in Artificial Intelligence (UAI\u201910), pages 109\u2013116, Catalina Island, CA. AUAI Press Arlington, Virginia. arXiv preprint arXiv:1203.3472 (2010)"},{"issue":"4","key":"10184_CR9","first-page":"63","volume":"6","author":"K Clarkson","year":"2010","unstructured":"Clarkson, K.: Coresets, sparse greedy approximation, and the Frank\u2013Wolfe algorithm. ACM Transactions Algorithms (TALG) 6(4), 63 (2010)","journal-title":"ACM Transactions Algorithms (TALG)"},{"key":"10184_CR10","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s00041-010-9153-2","volume":"16","author":"S Damelin","year":"2010","unstructured":"Damelin, S., Hickernell, F., Ragozin, D., Zeng, X.: On energy, discrepancy and group invariant measures on measurable subsets of Euclidean space. J. Fourier Anal. Appl. 16, 813\u2013839 (2010)","journal-title":"J. Fourier Anal. Appl."},{"key":"10184_CR11","unstructured":"Detommaso, G., Cui, T., Marzouk, Y., Spantini, A., Scheichl, R.: A Stein variational Newton method. Adv. Neural Inform. Process, 9187\u20139197 (2018)"},{"issue":"5","key":"10184_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0318035","volume":"18","author":"J Dunn","year":"1980","unstructured":"Dunn, J.: Convergence rates for conditional gradient sequences generated by implicit step length rules. SIAM J. Control Optim. 18(5), 473\u2013487 (1980)","journal-title":"SIAM J. Control Optim."},{"key":"10184_CR13","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","volume":"62","author":"J Dunn","year":"1978","unstructured":"Dunn, J., Harshbarger, S.: Conditional gradient algorithms with open loop step size rules. J. Math. Anal. Appl. 62, 432\u2013444 (1978)","journal-title":"J. Math. Anal. Appl."},{"key":"10184_CR14","volume-title":"Design and Modeling for Computer Experiments","author":"K-T Fang","year":"2006","unstructured":"Fang, K.-T., Li, R., Sudjianto, A.: Design and Modeling for Computer Experiments. Chapman & Hall\/CRC, Boca Raton (2006)"},{"key":"10184_CR15","volume-title":"Theory of Optimal Experiments","author":"V Fedorov","year":"1972","unstructured":"Fedorov, V.: Theory of Optimal Experiments. Academic Press, New York (1972)"},{"key":"10184_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Quart. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"10184_CR17","unstructured":"Garreau, D., Jitkrittum, W., Kanagawa, M.: Large sample analysis of the median heuristic. arXiv preprint arXiv:1707.07269 (2017)"},{"key":"10184_CR18","unstructured":"Gorham, J. MacKey, L.: Measuring sample quality with kernels. arXiv preprint arXiv:1703.01717 (2017)"},{"key":"10184_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103945","volume-title":"Foundations of Quantization for Probability Distributions","author":"S Graf","year":"2000","unstructured":"Graf, S., Luschgy, H.: Foundations of Quantization for Probability Distributions. Springer, Berlin (2000)"},{"issue":"221","key":"10184_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1090\/S0025-5718-98-00894-1","volume":"67","author":"F Hickernell","year":"1998","unstructured":"Hickernell, F.: A generalized discrepancy and quadrature error bound. Math. Comput. 67(221), 299\u2013322 (1998)","journal-title":"Math. Comput."},{"key":"10184_CR21","unstructured":"Husz\u00e1r, F., Duvenaud, D.: Optimally-weighted herding is Bayesian quadrature. In Proceedings 28th Conference on Uncertainty in Artificial Intelligence (UAI\u201912), pp. 377\u2013385, Catalina Island, CA. AUAI Press Arlington, Virginia. arXiv preprint arXiv:1204.1664 (2012)"},{"issue":"1","key":"10184_CR22","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1080\/00401706.2014.881749","volume":"57","author":"V Joseph","year":"2015","unstructured":"Joseph, V., Dasgupta, T., Tuo, R., Wu, C.: Sequential exploration of complex surfaces using minimum energy designs. Technometrics 57(1), 64\u201374 (2015)","journal-title":"Technometrics"},{"issue":"2","key":"10184_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1093\/biomet\/asv002","volume":"102","author":"V Joseph","year":"2015","unstructured":"Joseph, V., Gul, E., Ba, S.: Maximum projection designs for computer experiments. Biometrika 102(2), 371\u2013380 (2015)","journal-title":"Biometrika"},{"issue":"3","key":"10184_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/00401706.2018.1552203","volume":"61","author":"V Joseph","year":"2019","unstructured":"Joseph, V., Wang, D., Gu, L., Lyu, S., Tuo, R.: Deterministic sampling of expensive posteriors using minimum energy designs. Technometrics 61(3), 297\u2013308 (2019)","journal-title":"Technometrics"},{"issue":"6","key":"10184_CR25","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1007\/s11222-019-09901-0","volume":"29","author":"T Karvonen","year":"2019","unstructured":"Karvonen, T., Kanagawa, M., S\u00e4rkk\u00e4, S.: On the positivity and magnitudes of Bayesian quadrature weights. Stat. Comput. 29(6), 1317\u20131333 (2019)","journal-title":"Stat. Comput."},{"key":"10184_CR26","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank\u2013Wolfe optimization variants. Adv. Neural Process. Inform. Syst., 28: 496\u2013504. arXiv preprint arXiv:1511.05932v1 (2015)"},{"key":"10184_CR27","unstructured":"Liu, Q., Wang, D.: Stein variational gradient descent: a general purpose Bayesian inference algorithm. Adv. Neural Inform. Process. Syst., pp. 2378\u20132386. arXiv preprint arXiv:1608.04471v2 (2016)"},{"key":"10184_CR28","unstructured":"Mak, S., Joseph, V.: Projected support points, with application to optimal MCMC reduction. arXiv preprint arXiv:1708.06897 (2017)"},{"issue":"6A","key":"10184_CR29","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1214\/17-AOS1629","volume":"46","author":"S Mak","year":"2018","unstructured":"Mak, S., Joseph, V.: Support points. Ann. Stat. 46(6A), 2562\u20132592 (2018)","journal-title":"Ann. Stat."},{"issue":"3","key":"10184_CR30","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1111\/rssb.12185","volume":"B79","author":"C Oates","year":"2017","unstructured":"Oates, C., Girolami, M., Chopin, N.: Control functionals for Monte Carlo integration. J. R. Statistical Soc. B79(3), 695\u2013718 (2017)","journal-title":"J. R. Statistical Soc."},{"issue":"1","key":"10184_CR31","first-page":"7","volume":"158","author":"L Pronzato","year":"2017","unstructured":"Pronzato, L.: Minimax and maximin space-filling designs: some properties and methods for construction. Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique 158(1), 7\u201336 (2017)","journal-title":"Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique"},{"key":"10184_CR32","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11222-011-9242-3","volume":"22","author":"L Pronzato","year":"2012","unstructured":"Pronzato, L., M\u00fcller, W.: Design of computer experiments: space filling and beyond. Stat. Comput. 22, 681\u2013701 (2012)","journal-title":"Stat. Comput."},{"key":"10184_CR33","doi-asserted-by":"crossref","unstructured":"Pronzato, L., P\u00e1zman, A.: Design of Experiments in Nonlinear Models. Asymptotic Normality, Optimality Criteria and Small-Sample Properties. Springer, LNS 212, New York (2013)","DOI":"10.1007\/978-1-4614-6363-4"},{"issue":"3","key":"10184_CR34","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/18M1210332","volume":"8","author":"L Pronzato","year":"2020","unstructured":"Pronzato, L., Zhigljavsky, A.: Bayesian quadrature, energy minimization and space-filling design. SIAM\/ASA J. Uncertain. Quantification 8(3), 959\u20131011 (2020)","journal-title":"SIAM\/ASA J. Uncertain. Quantification"},{"key":"10184_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.113089","volume":"382","author":"L Pronzato","year":"2021","unstructured":"Pronzato, L., Zhigljavsky, A.: Minimum-energy measures for singular kernels. J. Comput. Appl. Math. 382, 113089 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"10184_CR36","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1214\/13-AOS1140","volume":"41","author":"S Sejdinovic","year":"2013","unstructured":"Sejdinovic, S., Sriperumbudur, B., Gretton, A., Fukumizu, K.: Equivalence of distance-based and RKHS-based statistics in hypothesis testing. Ann. Stat. 41(5), 2263\u20132291 (2013)","journal-title":"Ann. Stat."},{"key":"10184_CR37","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316481","volume-title":"Approximation Theorems of Mathematical Statistics","author":"R Serfling","year":"1980","unstructured":"Serfling, R.: Approximation Theorems of Mathematical Statistics. Wiley, New York (1980)"},{"key":"10184_CR38","first-page":"1517","volume":"11","author":"B Sriperumbudur","year":"2010","unstructured":"Sriperumbudur, B., Gretton, A., Fukumizu, K., Sch\u00f6lkopf, B., Lanckriet, G.: Hilbert space embeddings and metrics on probability measures. J. Mach. Learn. Res. 11, 1517\u20131561 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"10184_CR39","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.jspi.2013.03.018","volume":"143","author":"G Sz\u00e9kely","year":"2013","unstructured":"Sz\u00e9kely, G., Rizzo, M.: Energy statistics: a class of statistics based on distances. J. Statistical Plann. Infer. 143(8), 1249\u20131272 (2013)","journal-title":"J. Statistical Plann. Infer."},{"key":"10184_CR40","unstructured":"Teymur, O., Gorham, J., Riabiz, M., Oates, C.: Optimal quantisation of probability measures using maximum mean discrepancy. In Int. Conf. Artif. Intell. Statistics, pp 1027\u20131035. arXiv preprint arXiv:2010.07064v1 (2021)"},{"key":"10184_CR41","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1016\/j.dam.2007.02.013","volume":"155","author":"M Todd","year":"2007","unstructured":"Todd, M., Yildirim, E.: On Khachiyan\u2019s algorithm for the computation of minimum volume enclosing ellipsoids. Discrete Appl. Math. 155, 1731\u20131744 (2007)","journal-title":"Discrete Appl. Math."},{"key":"10184_CR42","first-page":"1","volume-title":"Integer and nonlinear programming","author":"P Wolfe","year":"1970","unstructured":"Wolfe, P.: Convergence theory in nonlinear programming. In: Abadie, J. (ed.) Integer and nonlinear programming, pp. 1\u201336. North-Holland, Amsterdam (1970)"},{"key":"10184_CR43","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BF01580381","volume":"11","author":"P Wolfe","year":"1976","unstructured":"Wolfe, P.: Finding the nearest point in a polytope. Math. Program. 11, 128\u2013149 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"10184_CR44","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"10184_CR45","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1214\/aoms\/1177696809","volume":"41","author":"H Wynn","year":"1970","unstructured":"Wynn, H.: The sequential generation of $$D$$-optimum experimental designs. Ann. Math. Stat. 41, 1655\u20131664 (1970)","journal-title":"Ann. Math. Stat."},{"key":"10184_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0491-7","author":"A Zhigljavsky","year":"2012","unstructured":"Zhigljavsky, A., Pronzato, L., Bukina, E.: An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost. Optim. Lett. (2012). https:\/\/doi.org\/10.1007\/s11590-012-0491-7","journal-title":"Optim. Lett."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-022-10184-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-022-10184-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-022-10184-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T22:47:24Z","timestamp":1676328444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-022-10184-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,7]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10184"],"URL":"https:\/\/doi.org\/10.1007\/s11222-022-10184-1","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,7]]},"assertion":[{"value":"19 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}