Associate Professor, Indian Statistical Institute
1 paper at NeurIPS 2025
The authors design a query-efficient algorithm that, given oracle access to a real valued function over Boolean cube, estimates its $\ell_2^2$ distance to the nearest $k$-Fourier sparse real valued function defined over Boolean Cube.
