PhD student, University of Texas at Austin
3 papers at NeurIPS 2025
We give a nearly-linear time algorithm for privately computing the geometric median, addressing the main open question of Haghifam et al (NeurIPS '24).
Low-precision quantized variants of Oja’s algorithm can provably converge in streaming PCA under suitably fine discretization while drastically reducing memory and compute requirements.
