Pingbangย Hu

Write-The-Formula

Mathematician
Nov. 10, 2000
United States
sleepymalc@gmail.com

About Me

Hi ๐Ÿ‘‹! I'm Pingbang Hu ่ƒกๅนณ้‚ฆ (Hu, PingหŠ-Bongห‰) from Taiwan ๐Ÿ‡น๐Ÿ‡ผ, an incoming Ph.D.student in Information Science at University of Illinois Urbana - Champaign (UIUC) ๐Ÿ‡บ๐Ÿ‡ธ advised by Prof. Jiaqi Ma. My research interest is about machine learning theory and theoretical computer science, specialized on graphs.

I obtained my B.S. degree in Computer Science (minor in Mathematics) at University of Michigan (UMich) ๐Ÿ‡บ๐Ÿ‡ธ and B.E. degree in Electrical Computer Engineering at Shanghai Jiao Tong University (SJTU) ๐Ÿ‡จ๐Ÿ‡ณ (dual-degree program).

My (academic) interest spreads widely among TCS and math. To name a few: I enjoy algorithm design, computational complexity ๐Ÿง , high dimensional statistic ๐Ÿ“Š, analysis, geometry/topology and optimization theory ๐Ÿ“š. Occasionally, I'll do street photography ๐Ÿ“ท and write blog posts ๐Ÿ“.

Now, I'm: designing fast graph algorithms, exploring graph neural network theory, studying graphings.

Education

(incoming) Sept 2023
Ph.D. in Information Science
School of Information Science, University of Illinois Urbana-Champaign
Sept 2021 - Apr 2022
Bachelor in Computer Science
College of Engineering, University of Michigan
Sept 2021 - Apr 2022
Minor in Mathematics
College of Literature, Science, and the Arts, University of Michigan
Sept 2019 - Present
Bachelor in Electrical Computer Engineering
UM-SJTU Joint Institute, Shanghai Jiao Tong University

Interests

Photography
HHKB, the best
Who doesn't love cats?
Algorithm
Topology
Drum!

Awards & Scholarships

Hong Kong, Macao and Taiwan Overseas Chinese Student Scholarship, SJTU
Oct. 2021
Undergraduate Excellent Scholarship, SJTU
Nov. 2020
Bao Gang Excellent Scholarship, SJTU
Jun. 2020
Hong Kong, Macao and Taiwan Overseas Chinese Student Scholarship, SJTU
Dec. 2019

Selected Research

Travel the Same Path: A Novel TSP Solving Strategy
Jan 2022 - April 2022
#Reinforcement Learning
#Deep Learning
#Optimization

A novel approach to exactly solve the NP-hard combinatorial optimization problem by using imitation learning.

GitHub
arXiv
Last Updated on Jun 6th 2023