EconPapers    
Economics at your fingertips  
 

The nested Sinkhorn divergence to learn the nested distance

Alois Pichler and Michael Weinhardt
Additional contact information
Alois Pichler: University of Technology, Chemnitz
Michael Weinhardt: University of Technology, Chemnitz

Computational Management Science, 2022, vol. 19, issue 2, No 5, 269-293

Abstract: Abstract 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.

Keywords: Nested distance; Optimal transport; Sinkhorn divergence; Entropy; 90C08; 90C15; 60G07 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10287-021-00415-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:19:y:2022:i:2:d:10.1007_s10287-021-00415-7

Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2

DOI: 10.1007/s10287-021-00415-7

Access Statistics for this article

Computational Management Science is currently edited by Ruediger Schultz

More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:comgts:v:19:y:2022:i:2:d:10.1007_s10287-021-00415-7