Undergrad student, Indian Institute of Technology, Bombay
1 paper at NeurIPS 2025
We present a viable algorithm for the problem of optimally covering a compact set with a fixed number of balls using results from sensitivity analysis and nonsmooth and nonconvex optimization.
