Academics

Manifold Fitting with CycleGAN

Time:Thur., 10:30-11:30 am Feb. 29, 2024

Venue:Lecture Hall C548, Tsinghua University Shuangqing Complex Building A 清华大学双清综合楼A座C548报告厅;Zoom Meeting ID: 271 534 5558 Passcode: YMSC

Speaker:Yao Zhigang 姚志刚 National University of Singapore

Yao Zhigang 

National University of Singapore

Zhigang Yao is an Associate Professor in the Department of Statistics and Data Science at the National University of Singapore (NUS). He also holds a courtesy joint appointment with the Department of Mathematics at NUS. He is a Faculty Affiliate of the Institute of Data Science (IDS) at NUS. He received his Ph.D. in Statistics from University of Pittsburgh in 2011. His thesis advisors are Bill Eddy at Carnegie Mellon and Leon Gleser at University of Pittsburgh. He has been an Assistant Professor at NUS from 2014-2020. Before joining NUS, he has been working with Victor Panaretos as a post-doc researcher at the Swiss Federal Institute of Technology (EPFL) from 2011-2014.

From 2022, he has been a member of the Center of Mathematical Sciences and Applications (CMSA) at Harvard University. At Harvard, he collaborates with Shing-Tung Yau on manifold fitting and research the interface between statistics and geometry. He is also a Visiting Faculty in the Department of Statistics at Harvard. He is the organizer of the Harvard Conference on Geometry and Statistics, hosted by CMSA in 2023.


Abstract

Manifold fitting, which offers substantial potential for efficient and accurate modeling, poses a critical challenge in non-linear data analysis. This study presents a novel approach that employs neural networks to fit the latent manifold. Leveraging the generative adversarial framework, this method learns smooth mappings between low-dimensional latent space and high-dimensional ambient space, echoing the Riemannian exponential and logarithmic maps. The well-trained neural networks provide estimations for the latent manifold, facilitate data projection onto the manifold, and even generate data points that reside directly within the manifold. Through an extensive series of simulation studies and real data experiments, we demonstrate the effectiveness and accuracy of our approach in capturing the inherent structure of the underlying manifold within the ambient space data. Notably, our method exceeds the computational efficiency limitations of previous approaches and offers control over the dimensionality and smoothness of the resulting manifold. This advancement holds significant potential in the fields of statistics and computer science. The seamless integration of powerful neural network architectures with generative adversarial techniques unlocks new possibilities for manifold fitting, thereby enhancing data analysis. The implications of our findings span diverse applications, from dimensionality reduction and data visualization to generating authentic data. Collectively, our research paves the way for future advancements in non-linear data analysis and offers a beacon for subsequent scholarly pursuits. This talk is based on some results from the following references

https://www.pnas.org/doi/10.1073/pnas.2311436121 (Yao, Su and Yau, 2023),

https://arxiv.org/abs/2304.07680 (Yao, Su, Li and Yau, 2022)

https://arxiv.org/abs/1909.10228 (Yao and Xia, 2019).

DATEFebruary 29, 2024
SHARE
Related News
    • 0

      Manifold fitting: an invitation to statistics

      AbstractWhile classical statistics has dealt with observations which are real numbers or elements of a real vector space, nowadays many statistical problems of high interest in the sciences deal with the analysis of data which consist of more complex objects, taking values in spaces which are naturally not (Euclidean) vector spaces but which still feature some geometric structure. The manifold ...

    • 1

      Gaussian Differential Privacy

      AbstractPrivacy-preserving data analysis has been put on a firm mathematical foundation since the introduction of differential privacy (DP) in 2006. This privacy definition, however, has some well-known weaknesses: notably, it does not tightly handle composition. In this talk, we propose a relaxation of DP that we term "f-DP", which has a number of appealing properties and avoids some of the di...