Full Professor, Pennsylvania State University
3 papers at NeurIPS 2025
We develop new theoretical guarantees for optimal transport map estimation under minimal regularity assumptions, providing the first provable error bounds for neural-OT estimators between general distributions.
We propose novel model-free RL and FRL algorithms, which simultaneously achieves the best-known near-optimal regret, a low burn-in cost and a logarithmic policy switching cost or communication cost.