{dede:global.cfg_webname/}
  • English
  • 官方微信
  • 首页
  • 栏目名称
    • 测试
  • 第二个
  • 首页
  • 学院概况
    • 学院简介
    • 历史沿革
    • 机构设置
    • 现任领导
    • 历任领导
    • 联系我们
  • 师资队伍
    • 全职教工
    • 讲座 兼职教授
    • 重要人才计划
    • 退休人员名单
  • 人才培养
    • 本科生培养
    • 硕士生培养
    • 博士生培养
  • 科学研究
    • 学术交流
    • 重点学科
    • 科研机构
    • 科研团队
    • 科研成果
    • 讨论班
  • 党团建设
    • 党建动态
    • 工会活动
    • 团学工作
  • 理论学习
    • 主题教育
  • 合作交流
    • 国际合作
    • 校际合作
    • 校企合作
  • 招生就业
    • 招生信息
    • 就业信息
    • 招生宣传
  • 校友之家
    • 校友组织
    • 校友基金
    • 校友活动
    • 百年院庆
    • 校友动态
  • 院务信箱

学术交流

  • 学术交流
  • 重点学科
  • 科研机构
  • 科研团队
  • 科研成果
  • 讨论班

学术交流

Riemannian Optimization for Projection Robust Optimal Transport

日期:2022-07-28  作者:  点击:[]


报 告 题 目:Riemannian Optimization for Projection Robust Optimal Transport

主 讲 人:马 士 谦

单 位:Rice University

时 间:8月3日10:00

腾 讯 ID:862-610-761

摘 要:

The optimal transport problem is known to suffer the curse of dimensionality. A recently proposed approach to mitigate the curse of dimensionality is to project the sampled data from the high dimensional probability distribution onto a lower-dimensional subspace, and then compute the optimal transport between the projected data. However, this approach requires to solve a max-min problem over the Stiefel manifold, which is very challenging in practice. In this talk, we propose a Riemannian block coordinate descent (RBCD) method to solve this problem. We analyze the complexity of arithmetic operations for RBCD to obtain an ε-stationary point, and show that it significantly improves the corresponding complexity of existing methods. Numerical results on both synthetic and real datasets demonstrate that our method is more efficient than existing methods, especially when the number of sampled data is very large. If time permits, we will also talk about the projection robust Wasserstein barycenter problem.

简 介:

Shiqian Ma is currently an associate professor in the Department of Computational Applied Mathematics and Operations Research at Rice University, and in the Department of Mathematics at University of California, Davis (on leave). He received his BS in Mathematics from Peking University in 2003, MS in Computational Mathematics from the Chinese Academy of Sciences in 2006, and PhD in Industrial Engineering and Operations Research from Columbia University in 2011. Shiqian was an NSF postdoctoral fellow in the Institute for Mathematics and its Applications at the University of Minnesota during 2011-2012 and an assistant professor in the Department of Systems Engineering and Engineering Management at the Chinese University of Hong Kong during 2012-2017. His current research interests include theory and algorithms for large-scale optimization, and their various applications in machine learning, signal processing and statistics. Shiqian received the INFORMS Optimization Society Best Student Paper Prize in 2010, and an honorable mention in the INFORMS George Nicholson Student Paper Competition in 2011. He was one of the finalists for the 2011 IBM Herman Goldstine fellowship. He received the Journal of the Operations Research Society of China Excellent Paper Award in 2016. Shiqian has served as the area chairs for machine learning conferences such as ICML and NeurIPS, and currently serves on the editorial board of Journal of Scientific Computing.



上一条:Noncommutative Lp-spaces and applications 下一条:K-稳定性

【关闭】

友情链接

  • 学校教务处
  • 学校党委办公室
  • 学校校长办公室
  • 清华大学数学系
  • 浙江大学数学科学院
  • 上海大学数学系
版权信息