{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:41:29Z","timestamp":1783748489772,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009117","name":"Technische Universit\u00e4t Chemnitz","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009117","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The nested distance builds on the Wasserstein distance to quantify the difference of stochastic processes, including also the evolution of information modelled by filtrations. The Sinkhorn divergence is a relaxation of the Wasserstein distance, which can be computed considerably faster. For this reason we employ the Sinkhorn divergence and take advantage of the related (fixed point) iteration algorithm. Furthermore, we investigate the transition of the entropy throughout the stages of the stochastic process and provide an entropy-regularized nested distance formulation, including a characterization of its dual. Numerical experiments affirm the computational advantage and supremacy.<\/jats:p>","DOI":"10.1007\/s10287-021-00415-7","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T13:05:18Z","timestamp":1632747918000},"page":"269-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The nested Sinkhorn divergence to learn the nested distance"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8876-2429","authenticated-orcid":false,"given":"Alois","family":"Pichler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Weinhardt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"415_CR1","unstructured":"Altschuler J, Weed J, Rigollet P (2017) Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In: Proceedings of the 31st international conference on neural information processing systems, pp 1961\u20131971. Curran Associates Inc., arxiv:1705.09634"},{"issue":"3","key":"415_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10287-014-0213-y","volume":"11","author":"B Analui","year":"2014","unstructured":"Analui B, Pflug GCh (2014) On distributionally robust multiperiod stochastic optimization. Comput Manag Sci 11(3):197\u2013220. https:\/\/doi.org\/10.1007\/s10287-014-0213-y","journal-title":"Comput Manag Sci"},{"issue":"2","key":"415_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/bf02252097","volume":"23","author":"A Bachem","year":"1979","unstructured":"Bachem A, Korte B (1979) On the RAS-algorithm. Computing 23(2):189\u2013198. https:\/\/doi.org\/10.1007\/bf02252097","journal-title":"Computing"},{"issue":"6","key":"415_CR4","doi-asserted-by":"publisher","first-page":"4351","DOI":"10.1109\/tpwrs.2017.2658444","volume":"32","author":"F Beltr\u00e1n","year":"2017","unstructured":"Beltr\u00e1n F, de Oliveira W, Finardi EC (2017) Application of scenario tree reduction via quadratic process to medium-term hydrothermal scheduling problem. IEEE Trans Power Syst 32(6):4351\u20134361. https:\/\/doi.org\/10.1109\/tpwrs.2017.2658444","journal-title":"IEEE Trans Power Syst"},{"issue":"1","key":"415_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/bf02216923","volume":"20","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas DP, Castanon DA (1989) The auction algorithm for the transportation problem. Ann Oper Res 20(1):67\u201396. https:\/\/doi.org\/10.1007\/bf02216923","journal-title":"Ann Oper Res"},{"issue":"2","key":"415_CR6","doi-asserted-by":"publisher","first-page":"5120","DOI":"10.1214\/19-EJS1637","volume":"13","author":"J Bigot","year":"2019","unstructured":"Bigot J, Cazelles E, Papadakis N (2019) Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications. Electron J Stat 13(2):5120\u20135150. https:\/\/doi.org\/10.1214\/19-EJS1637","journal-title":"Electron J Stat"},{"issue":"2","key":"415_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0167-6687(83)90017-3","volume":"2","author":"AI Brodt","year":"1983","unstructured":"Brodt AI (1983) Min-mad life: a multi-period optimization model for life insurance company investment decisions. Insurance Math Econ 2(2):91\u2013102","journal-title":"Insurance Math Econ"},{"issue":"1","key":"415_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10479-011-1027-8","volume":"200","author":"P Carpentier","year":"2012","unstructured":"Carpentier P, Chancelier J-P, Cohen G, De Lara M, Girardeau P (2012) Dynamic consistency for stochastic optimal control problems. Ann Oper Res 200(1):247\u2013263. https:\/\/doi.org\/10.1007\/s10479-011-1027-8","journal-title":"Ann Oper Res"},{"key":"415_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18138-7","volume-title":"Stochastic multi-stage optimization","author":"P Carpentier","year":"2015","unstructured":"Carpentier P, Chancelier J-P, Cohen G, De Lara M (2015) Stochastic multi-stage optimization. Springer International Publishing, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-18138-7"},{"key":"415_CR10","unstructured":"Cuturi M (2013) Sinkhorn distances: Lightspeed computation of optimal transport. In: Advances in neural information processing systems"},{"issue":"1\u20132","key":"415_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10589-005-2053-8","volume":"32","author":"NCP Edirisinghe","year":"2005","unstructured":"Edirisinghe NCP (2005) Multiperiod portfolio optimization with terminal liability: bounds for the convex case. Comput Optim Appl 32(1\u20132):29\u201359. https:\/\/doi.org\/10.1007\/s10589-005-2053-8","journal-title":"Comput Optim Appl"},{"key":"415_CR12","unstructured":"Genevay A, Peyr\u00e9 G, Cuturi M (2018) Learning generative models with Sinkhorn divergences. In: Storkey A, Perez-Cruz F (eds) Proceedings of the twenty-first international conference on artificial intelligence and statistics, volume 84 of proceedings of machine learning research, pp 1608\u20131617. PMLR http:\/\/proceedings.mlr.press\/v84\/genevay18a.html"},{"issue":"2","key":"415_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/050632865","volume":"17","author":"H Heitsch","year":"2006","unstructured":"Heitsch H, R\u00f6misch W, Strugarek C (2006) Stability of multistage stochastic programs. SIAM J Optim 17(2):511\u2013525","journal-title":"SIAM J Optim"},{"issue":"2","key":"415_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10287-020-00375-4","volume":"17","author":"M Horej\u0161ov\u00e1","year":"2020","unstructured":"Horej\u0161ov\u00e1 M, Vitali S, Kopa M, Moriggia V (2020) Evaluation of scenario reduction algorithms with nested distance. CMS 17(2):241\u2013275. https:\/\/doi.org\/10.1007\/s10287-020-00375-4","journal-title":"CMS"},{"key":"415_CR15","doi-asserted-by":"publisher","unstructured":"Kirui KB, Pichler A, Pflug GCh (2020) ScenTrees.jl: a Julia package for generating scenario trees and scenario lattices for multistage stochastic programming. J Open Source Softw 5(46):1912. https:\/\/doi.org\/10.21105\/joss.01912","DOI":"10.21105\/joss.01912"},{"issue":"4","key":"415_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/msp.2017.2695801","volume":"34","author":"S Kolouri","year":"2017","unstructured":"Kolouri S, Park SR, Thorpe M, Slepcev D, Rohde GK (2017) Optimal mass transport: signal processing and machine-learning applications. IEEE Signal Process Mag 34(4):43\u201359. https:\/\/doi.org\/10.1109\/msp.2017.2695801","journal-title":"IEEE Signal Process Mag"},{"key":"415_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-1994-2","author":"RM Kovacevic","year":"2015","unstructured":"Kovacevic RM, Pichler A (2015) Tree approximation for discrete time stochastic processes: a process distance approach. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-015-1994-2","journal-title":"Ann Oper Res"},{"key":"415_CR18","unstructured":"Kruithof R (1937) Telefoonverkeersrekening. De Ingenieur 52:E15-E25. https:\/\/wwwhome.ewi.utwente.nl\/ ptdeboer\/misc\/kruithof-1937-translation.html"},{"key":"415_CR19","unstructured":"Luise G, Rudi A, Pontil M, Ciliberto C (2018) Differential properties of Sinkhorn approximation for learning with Wasserstein distance. In: Advances in neural information processing systems 31 (NIPS 2018). arXiv:1805.11897"},{"issue":"1","key":"415_CR20","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/17M1140601","volume":"29","author":"F Maggioni","year":"2019","unstructured":"Maggioni F, Pflug GCh (2019) Guaranteed bounds for general non-discrete multistage risk-averse stochastic optimization programs. SIAM J Optim 29(1):454\u2013483. https:\/\/doi.org\/10.1137\/17M1140601","journal-title":"SIAM J Optim"},{"key":"415_CR21","doi-asserted-by":"publisher","unstructured":"Peyr\u00e9 G, Cuturi M (2019) Computational optimal transport: with applications to data science. Found Trends\u00ae Mach Learn. 11(5-6):355\u2013607. https:\/\/doi.org\/10.1561\/2200000073","DOI":"10.1561\/2200000073"},{"key":"415_CR22","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1137\/080718401","volume":"20","author":"GCh Pflug","year":"2009","unstructured":"Pflug GCh (2009) Version-independence and nested distributions in multistage stochastic optimization. SIAM J Optim 20:1406\u20131420. https:\/\/doi.org\/10.1137\/080718401","journal-title":"SIAM J Optim"},{"issue":"1","key":"415_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/110825054","volume":"22","author":"ChG Pflug","year":"2012","unstructured":"Pflug ChG, Pichler A (2012) A distance for multistage stochastic optimization models. SIAM J Optim 22(1):1\u201323. https:\/\/doi.org\/10.1137\/110825054","journal-title":"SIAM J Optim"},{"key":"415_CR24","doi-asserted-by":"publisher","unstructured":"Pflug GCh, Pichler A (2014) Multistage stochastic optimization. Springer series in operations research and financial engineering. Springer, Berlin. ISBN 978-3-319-08842-6. https:\/\/doi.org\/10.1007\/978-3-319-08843-3. https:\/\/books.google.com\/books?id=q_VWBQAAQBAJ","DOI":"10.1007\/978-3-319-08843-3"},{"key":"415_CR25","volume-title":"Probability metrics and the stability of stochastic models","author":"ST Rachev","year":"1991","unstructured":"Rachev ST (1991) Probability metrics and the stability of stochastic models. Wiley, West Sussex"},{"key":"415_CR26","doi-asserted-by":"publisher","unstructured":"Rachev ST, R\u00fcschendorf L (1998) Mass transportation problems volume I: theory, volume II: applications, volume XXV of Probability and its applications. Springer, New York. https:\/\/doi.org\/10.1007\/b98893","DOI":"10.1007\/b98893"},{"key":"415_CR27","unstructured":"Rote G, Zachariasen M (2007) Matrix scaling by network flow. In: Bansal N, Pruhs K, Stein C (eds) Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7\u20139. SIAM, pp 848\u2013854. http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283474"},{"issue":"4","key":"415_CR28","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1214\/aos\/1176324703","volume":"23","author":"L R\u00fcschendorf","year":"1995","unstructured":"R\u00fcschendorf L (1995) Convergence of the iterative proportional fitting procedure. Ann Stat 23(4):1160\u20131174. https:\/\/doi.org\/10.1214\/aos\/1176324703","journal-title":"Ann Stat"},{"issue":"4","key":"415_CR29","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/2314570","volume":"74","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn R (1967) Diagonal equivalence to matrices with prescribed row and column sums. Am Math Mon 74(4):402. https:\/\/doi.org\/10.2307\/2314570","journal-title":"Am Math Mon"},{"key":"415_CR30","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn R, Knopp P (1967) Concerning nonnegative matrices and doubly stochastic matrices. Pacific J Math 21:343\u2013348","journal-title":"Pacific J Math"},{"issue":"1","key":"415_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion M (1958) On general minimax theorems. Pacific J Math 8(1):171\u2013176","journal-title":"Pacific J Math"},{"key":"415_CR32","unstructured":"Tran DNB (2020) Programmation dynamique tropicale en optimisation stochastique multi-\u00e9tapes. Ph.D. thesis, Universit\u00e9 Paris-Est"},{"key":"415_CR33","volume-title":"Optimal transport, old and new, vol. 338. Grundlehren der Mathematischen Wissenschaften","author":"C Villani","year":"2009","unstructured":"Villani C (2009) Optimal transport, old and new, vol. 338. Grundlehren der Mathematischen Wissenschaften. Springer, Berlin"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-021-00415-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-021-00415-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-021-00415-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T20:26:49Z","timestamp":1652905609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-021-00415-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["415"],"URL":"https:\/\/doi.org\/10.1007\/s10287-021-00415-7","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"10 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}