mlsanityData to 13 Oct 2026

Optimal Transport-inspired Deep Learning Framework for Slow-Decaying Kolmogorov n-width Problems: Exploiting Sinkhorn Loss and Wasserstein Kernel

arXiv 2308.13840 ↗First posted 26 Aug 2023math.NA cs.LG cs.NAcited by 2

Not on the map. Why?

Abstract (arXiv)

Reduced order models (ROMs) are widely used in scientific computing to tackle high-dimensional systems. However, traditional ROM methods may only partially capture the intrinsic geometric characteristics of the data. These characteristics encompass the underlying structure, relationships, and essential features crucial for accurate modeling. To overcome this limitation, we propose a novel ROM framework that integrates optimal transport (OT) theory and neural network-based methods. Specifically, we investigate the Kernel Proper Orthogonal Decomposition (kPOD) method exploiting the Wasserstein distance as the custom kernel, and we efficiently train the resulting neural network (NN) employing the Sinkhorn algorithm. By leveraging an OT-based nonlinear reduction, the presented framework can capture the geometric structure of the data, which is crucial for accurate learning of the reduced solution manifold. When compared with traditional metrics such as mean squared error or cross-entropy, exploiting the Sinkhorn divergence as the loss function enhances stability during training, robustness against overfitting and noise, and accelerates convergence. To showcase the approach's effectiveness, we conduct experiments on a set of challenging test cases exhibiting a slow decay of the Kolmogorov n-width. The results show that our framework outperforms traditional ROM methods in terms of accuracy and computational efficiency.

Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 13 of its 63 references that are in the map. First posted on arXiv 26 Aug 2023.

Builds on

13 of 63 references.

References · 13

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,295
  3. 2015An Introduction to Convolutional Neural Networkscited by 512
  4. 2019Variational Adversarial Active Learningcited by 284
  5. 2018Deep Hidden Physics Models: Deep Learning of Nonlinear Partial Differential Equationscited by 234
  6. 2015Learning with a Wasserstein Losscited by 195
  7. 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
  8. 2020A comprehensive deep learning-based approach to reduced order modeling of nonlinear time-dependent parametrized PDEscited by 105
  9. 2021POD-DL-ROM: enhancing deep learning-based reduced order models for nonlinear parametrized PDEs by proper orthogonal decompositioncited by 79
  10. 2023A graph convolutional autoencoder approach to model order reduction for parametrized PDEscited by 44
  11. 2018Optimal Transport: Fast Probabilistic Approximation with Exact Solverscited by 27
  12. 2021An artificial neural network approach to bifurcating phenomena in computational fluid dynamicscited by 11
1 more
  1. 2020Wasserstein Exponential Kernelscited by 10

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.