Caleb Ju

  • Program Year: 1
  • Academic Institution: Georgia Institute of Technology
  • Field of Study: Operations Research
  • Academic Advisor: Guanghui (George) Lan
  • Practicum(s): Practicum Not Yet Completed
  • Degree(s):
    B.S. Mathematics and Computer Science, University of Illinois at Urbana-Champaign, 2020
  • Personal URL: https://jucaleb4.github.io/

Summary of Research

I am interested in developing fast and scalable optimization algorithms for challenging problems arising in machine learning and computational science.

Publications

- Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik. Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. Submitted, Aug 2021
- Yan Li, Caleb Ju, Ethan X. Fang, Tuo Zhao. Implicit regularization of Bregman proximal point algorithm and mirror descent on separable data. arXiv, Aug 2021
- Caleb Ju, Yifan Zhang, and Edgar Solomonik. Communication lower bounds for nested bilinear algorithms. arXiv, Jul 2021
- Caleb Ju and Edgar Solomonik. "Derivation and analysis of fast bilinear algorithms for convolution". SIAM Review. Nov 2020 (https://epubs.siam.org/doi/abs/10.1137/19M1301059)

Awards

- OP21 Travel Award
- Illinois Summer Research Poster: Best Research Presentation Award (Illinois)
- Franz Hohn and J.P. Nash Scholarship (Illinois)
- Dean's List, Fall 2017 (Illinois)