no code implementations • 25 Jul 2021 • Kevin O'Connor, Kevin McGoff, Andrew B Nobel
We study optimal transport for stationary stochastic processes taking values in finite spaces.
2 code implementations • 13 Jun 2021 • Bongsoo Yi, Kevin O'Connor, Kevin McGoff, Andrew B. Nobel
Given two networks and a cost function relating their vertices, NetOTC finds a transition coupling of their associated random walks having minimum expected cost.
1 code implementation • 5 Feb 2019 • Christopher Bender, Kevin O'Connor, Yang Li, Juan Jose Garcia, Manzil Zaheer, Junier Oliva
In this work, we develop a new approach to generative density estimation for exchangeable, non-i. i. d.