A bidirectional DeepParticle method for efficiently solving low-dimensional transport map problems
From MaRDI portal
Cites work
- A DeepParticle method for learning and generating aggregation patterns in multi-dimensional Keller-Segel chemotaxis systems
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- An invitation to optimal transport, Wasserstein distances, and gradient flows
- Data-driven optimal transport
- DeepParticle: learning invariant measure by a deep neural network minimizing Wasserstein distance on data generated from an interacting particle method
- Generative ensemble regression: Learning particle dynamics from observations of ensembles with physics-informed deep generative models
- Initiation of slime mold aggregation viewed as an instability
- Learning to match via inverse optimal transport
- Lectures on optimal transport
- Normalizing flows for probabilistic modeling and inference
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal transport: fast probabilistic approximation with exact solvers
- Unnormalized optimal transport
This page was built for publication: A bidirectional DeepParticle method for efficiently solving low-dimensional transport map problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312100)