Pages that link to "Item:Q5001817"
From MaRDI portal
The following pages link to Multi-Marginal Optimal Transport and Probabilistic Graphical Models (Q5001817):
Displaying 15 items.
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Learning hidden Markov models from aggregate observations (Q2071943) (← links)
- Feedback particle filter for collective inference (Q2072656) (← links)
- Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem (Q5000631) (← links)
- Wasserstein Barycenters Are NP-Hard to Compute (Q5065469) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- Inference With Aggregate Data in Probabilistic Graphical Models: An Optimal Transport Approach (Q6075993) (← links)
- A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
- Monge-Kantorovich optimal transport through constrictions and flow-rate constraints (Q6152572) (← links)
- Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems (Q6173517) (← links)
- Efficient and exact multimarginal optimal transport with pairwise costs (Q6571369) (← links)
- Graph-structured tensor optimization for nonlinear density control and mean field games (Q6576864) (← links)
- Minimum information dependence modeling (Q6589565) (← links)
- State estimation and structure identification of complex networks with time-varying delays and model uncertainty based on probabilistic graph neural network (Q6591170) (← links)
- Distributionally robust optimization using optimal transport for Gaussian mixture models (Q6640177) (← links)
