{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:05Z","timestamp":1774910945116,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-20537-7_10","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:32:25Z","timestamp":1773757945000},"page":"150-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weight Adaptation for\u00a0Improving Parallel Performance of\u00a0Adaptive Stochastic Natural Gradient"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1807-4602","authenticated-orcid":false,"given":"Yutaro","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4179-6020","authenticated-orcid":false,"given":"Kento","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4659-6108","authenticated-orcid":false,"given":"Shinichi","family":"Shirakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2018.05.015","volume":"832","author":"Y Akimoto","year":"2020","unstructured":"Akimoto, Y., Auger, A., Hansen, N.: Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions. Theoret. Comput. Sci. 832, 42\u201367 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.015","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR2","unstructured":"Akimoto, Y., Shirakawa, S., Yoshinari, N., Uchida, K., Saito, S., Nishida, K.: Adaptive stochastic natural gradient method for one-shot neural architecture search. In: International Conference on Machine Learning (ICML), pp. 171\u2013180 (2019)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11513575_12","volume-title":"Foundations of Genetic Algorithms","author":"DV Arnold","year":"2005","unstructured":"Arnold, D.V.: Optimal weighted recombination. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol. 3469, pp. 215\u2013237. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513575_12"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Baluja, S., Caruana, R.: Removing the genetics from the standard genetic algorithm. In: Machine Learning Proceedings 1995, pp. 38\u201346. Morgan Kaufmann, San Francisco, CA (1995). https:\/\/doi.org\/10.1016\/B978-1-55860-377-6.50014-1","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/s00453-018-0507-5","volume":"81","author":"DC Dang","year":"2019","unstructured":"Dang, D.C., Lehre, P.K., Nguyen, P.T.: Level-based analysis of the univariate marginal distribution algorithm. Algorithmica 81(2), 668\u2013702 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0507-5","journal-title":"Algorithmica"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Evans, M., Swartz, T.: Approximating Integrals via Monte Carlo and Deterministic Methods. Oxford University Press (2000). https:\/\/doi.org\/10.1093\/oso\/9780198502784.001.0001","DOI":"10.1093\/oso\/9780198502784.001.0001"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Glasmachers, T., Schaul, T., Yi, S., Wierstra, D., Schmidhuber, J.: Exponential natural evolution strategies. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 393\u2013400. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1830483.1830557","DOI":"10.1145\/1830483.1830557"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2022.108110","volume":"170","author":"LD Gonz\u00e1lez","year":"2023","unstructured":"Gonz\u00e1lez, L.D., Zavala, V.M.: New paradigms for exploiting parallel experiments in Bayesian optimization. Comput. Chem. Eng. 170, 108110 (2023). https:\/\/doi.org\/10.1016\/j.compchemeng.2022.108110","journal-title":"Comput. Chem. Eng."},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 312\u2013317 (1996). https:\/\/doi.org\/10.1109\/ICEC.1996.542381","DOI":"10.1109\/ICEC.1996.542381"},{"key":"10_CR10","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-33206-7_8","volume-title":"Theory and Principled Methods for the Design of Metaheuristics","author":"N Hansen","year":"2014","unstructured":"Hansen, N., Auger, A.: Principled design of continuous stochastic search: from theory to practice. In: Borenstein, Y., Moraglio, A. (eds.) Theory and Principled Methods for the Design of Metaheuristics. NCS, pp. 145\u2013180. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-33206-7_8"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3, 287\u2013297 (1999). https:\/\/doi.org\/10.1109\/4235.797971","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Jastrebski, G., Arnold, D.: Improving evolution strategies through active covariance matrix adaptation. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 2814\u20132821 (2006). https:\/\/doi.org\/10.1109\/CEC.2006.1688662","DOI":"10.1109\/CEC.2006.1688662"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s00453-020-00778-4","volume":"83","author":"J Lengler","year":"2020","unstructured":"Lengler, J., Sudholt, D., Witt, C.: The complex parameter landscape of the compact Genetic Algorithm. Algorithmica 83(4), 1096\u20131137 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00778-4","journal-title":"Algorithmica"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Nishida, K., Akimoto, Y.: PSA-CMA-ES: CMA-ES with population size adaptation. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 865\u2013872. Association for Computing Machinery (2018). https:\/\/doi.org\/10.1145\/3205455.3205467","DOI":"10.1145\/3205455.3205467"},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1145\/3698203","author":"M Nomura","year":"2024","unstructured":"Nomura, M., Akimoto, Y., Ono, I.: CMA-ES with learning rate adaptation. ACM Trans. Evol. Learn. Optim. (2024). https:\/\/doi.org\/10.1145\/3698203","journal-title":"ACM Trans. Evol. Learn. Optim."},{"issue":"1","key":"10_CR16","first-page":"564","volume":"18","author":"Y Ollivier","year":"2017","unstructured":"Ollivier, Y., Arnold, L., Auger, A., Hansen, N.: Information-geometric optimization algorithms: a unifying picture via invariance principles. J. Mach. Learn. Res. 18(1), 564\u2013628 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR17","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning (2017). https:\/\/arxiv.org\/abs\/1703.03864"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-030-58112-1_50","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"T Yamaguchi","year":"2020","unstructured":"Yamaguchi, T., Uchida, K., Shirakawa, S.: Adaptive stochastic natural gradient method for optimizing functions with low effective dimensionality. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 719\u2013731. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_50"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Yang, S., Richter, H.: Hyper-learning for population-based incremental learning in dynamic environments. In: 2009 IEEE Congress on Evolutionary Computation, pp. 682\u2013689 (2009). https:\/\/doi.org\/10.1109\/CEC.2009.4983011","DOI":"10.1109\/CEC.2009.4983011"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:02:51Z","timestamp":1774908171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}