Bingyan Han
University of Michigan
[in-person]

or
Join Zoom Meeting:
https://usc.zoom.us/j/94973619069?pwd=VnU5bVlMc1pzVTlEYUVaZUYyNSt6UT09
Meeting ID: 949 7361 9069
Passcode: 925028

Abstract:
We develop a fitted value iteration (FVI) method to compute bicausal optimal transport (OT) where couplings have an adapted structure. Based on the dynamic programming formulation, FVI adopts a function class to approximate the value functions in bicausal OT. Under the concentrability condition and approximate completeness assumption, we prove the sample complexity using (local) Rademacher complexity. Furthermore, we demonstrate that multilayer neural networks with appropriate structures satisfy the crucial assumptions required in sample complexity proofs. Numerical experiments reveal that FVI outperforms linear programming and adapted Sinkhorn methods in scalability as the time horizon increases, while still maintaining acceptable accuracy. This is a joint work with Prof. Erhan Bayraktar. The preprint is available at https://arxiv.org/abs/2306.12658.