About Jinhao
Hi, everyone. Welcome to my homepage.
I am currently a Ph.D. student in Computer Science at the University of Virginia (UVA), advised by Professor Ferdinando Fioretto. Before that, I completed my M.Phil degree in Computer and Information Engineering at The Chinese University of Hong Kong, Shenzhen (CUHK Shenzhen), under the supervision of Professor Chenye Wu. I also obtained a bachelor's degree in Software Engineering at Xidian University (XDU).
Download my CV here.Research
I am particularly interested in integrating generative AI with optimization to address complex scientific and engineering challenges. Currently, my research topics focus on developing algorithms to ensure the output of diffusion models satisfying constraints with provably guarantees by introducing differentiable optimization techniques into diffusion process. Specifically, I aim to tackle challenges in critical domains such as power systems and robotics, contributing to scalable and adaptive solutions for real-world applications.
News
[2024/12] I will present our work "Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models" at both International Workshop on Multi-Agent Path Finding at AAAI-25 and AAAI-25 Bridge: AI+ORMS. Welcome to drop by our talks.
[2024/11] I am deeply honored to receive the Presidential Award for Outstanding Graduate Students (10 out of over 1,000 graduate students at CUHKSZ) and sincerely thank my advisor, family, friends, and everyone who supported me throughout this wonderful journey at CUHKSZ 🤗.
[2024/09] It's my great honor to receive UVA Provost Fellowship, a profound encouragement for me to continue my exciting and challenging research journey 🎉.
[2024/01] Our paper "Joint Chance-constrained Unit Commitment: Statistically Feasible Robust Optimization with Learning-to-Optimize Acceleration" has been accepted by IEEE Transactions on Power Systems.
[2023/12] I will present our work "Few-shot Residential Load Forecasting Boosted by Learning to Ensemble" at IEEE EI2 2023. Welcome to drop by our talks.
