- Seminar Calendar
- Seminar Archive
- 2026-2027 Semester 1
- 2025-2026 Semester 2
- 2025-2026 Semester 1
- 2024-2025 Semester 2
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
Optimal Transport for Matching and Simulation
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Tuesday, November 17, 2026, 4:30pm to 5:30pm HKT
Venue: ERB909, The Chinese University of Hong Kong
Title: Optimal Transport for Matching and Simulation
Speaker: Prof. Binh T. Nguyen, VinUniversity
Abstract:
Optimal transport provides a powerful mathematical framework for comparing probability distributions, with applications ranging from matching structured data to simulation and decision-making under uncertainty. In this talk, I will discuss two recent works that explore how optimal transport can be used to address two distinct challenges in optimization and machine learning. In the first part, I consider the Gromov–Wasserstein (GW) problem, which seeks to match objects across incomparable spaces by preserving their underlying geometric structures. Since GW is formulated as a nonconvex quadratic optimization problem, existing algorithms typically provide only locally optimal solutions. I will present a semidefinite programming relaxation that provides computable lower bounds and, in many instances, certifies global optimality. I will also discuss its applications to graph and shape matching. In the second part, I turn to conditional distribution learning, motivated by simulation and personalized decision-making. When observations are scarce, accurately estimating an entire conditional distribution can be substantially more challenging than predicting its mean. I will introduce GENTLE, a neural generative model that combines distributional fitting with entropic optimal transport regularization to learn conditional distributions from limited data. Numerical experiments demonstrate its effectiveness in recovering conditional distributions on real-world and simulation datasets. Together, these works illustrate how optimal transport connects convex optimization, generative modeling, and data-driven decision-making.
Biography:
Binh T. Nguyen is currently an Assistant Professor at VinUniversity. His research interest includes generative modeling (LLM evaluation and alignment, post-training and model steering; diffusion models), optimal transport, and large-scale statistical inference. His works have appeared in leading machine learning, optimization, and natural language processing venues, including NeurIPS, ICML, ICLR, EMNLP, NAACL, and SIAM Journal of Optimization.
Everyone is welcome to attend the talk!
SEEM-5201 Website: http://seminar.se.cuhk.edu.hk
Date:
Tuesday, November 17, 2026 - 16:30 to 17:30


