Jie Hu

I am an Assistant Professor in the Department of Computer Science and Engineering at Oakland University, based in Rochester, MI. My research focuses on machine learning theory and graph sampling. In particular, I’m interested in designing efficient algorithms for distributed optimization and graph mining, with the goal of pushing the boundaries of how quickly and effectively AI and ML tasks can be accomplished.

Research Areas

  • Machine learning theory
  • Graph mining
  • Distributed optimization and algorithms

Prospective Students:

I am recruiting PhD students to start in Winter 2026 with expertise in applied probability, optimization, machine learning algorithms, or Markov chain Monte Carlo, and a passion for leveraging advanced algorithms to tackle complex, discipline-specific challenges.

News

  • 08-15-2025: Glad to start working at OU as an Assistant Professor.
  • 07-14-2025: Attended ICML 2025 and made an oral presentation.

Selected Publication

ICML’25      Jie Hu, Yi-Ting Ma, and Do Young Eun, “Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs“, International Conference on Machine Learning, Vancouver, Canada, July 2025 (Oral Presentation) (within 1% out of 12107 submissions)

ICLR’24      Jie Hu, Vishwaraj Doshi, and Do Young Eun, “Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks”, in International Conference on Learning Representations, Vienna, Austria, May 2024 (Oral Presentation) (within 1.2% out of 7262 submissions)

ICML’23      Vishwaraj Doshi, Jie Hu, and Do Young Eun, “Self-Repellent Random Walks on General Graphs – Achieving Minimal Sampling Variance via Nonlinear Markov Chains”, in International Conference on Machine Learning, Hawaii, July 2023 (Outstanding Paper Award)

Full Publication List

Please refer to the full list on Google Scholar.

Mentoring

  • Yi-Ting Ma, Ph.D. student at North Carolina State University