Guanyi Wang

About

Dr. Guanyi Wang (王冠一) is an assistant professor at the Department of Industrial Systems Engineering and Management, National University of Singapore. Before joining the NUS, he was a postdoctoral researcher at Polytechnique Montréal, under the supervision of Dr. Andrea Lodi from July 2021 to Jun 2022. Guanyi Wang received his Ph.D. degree in Algorithms, Combinatorics and Optimization (ACO) from the Milton Stewart School of Industrial and Systems Engineering (ISyE) at Georgia Institute of Technology, in May 2021, advised by Dr. Santanu S. Dey. Before joining Georgia Tech, Guanyi Wang received a Master's degree in Applied Mathematics and Statistics from the Department of Applied Mathematics and Statistics at Johns Hopkins University, advised by Dr. Amitabh Basu, and a Bachelor's degree in Mathematics from the University of Science and Technology Beijing. Guanyi Wang's research interest lies broadly in discrete/nonlinear optimization. On the theoretical part, his focus is on analyzing first-order methods/approximation algorithms for discrete/nonlinear optimization problems with guarantees. On the practical part, his focus is on designing and implementing efficient algorithms for important applications in discrete/nonlinear optimization (data science, healthcare, neural network).

Work

National University of Singapore
|

Assistant Professor

Singapore

Polytechnique Montréal
|

Postdoc

Canada

Education

Georgia Institute of Technology
United States of America

Ph.D. in Algorithms, Combinatorics and Optimization

Johns Hopkins University
United States of America

Master

University of Science and Technology Beijing
China

bachelor

Publications

A framework for fair decision-making over time with time-invariant utilities

Published by

European Journal of Operational Research

Summary

journal-article

Do Algorithms and Barriers for Sparse Principal Component Analysis Extend to Other Structured Settings?

Published by

IEEE Transactions on Signal Processing

Summary

journal-article

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA

Published by

Operations Research

Summary

journal-article