1 paper
Jeremy Carleton, Prathik Vijaykumar, Divyanshu Saxena +3
We address the challenge of zeroth-order online convex optimization where the objective function's gradient exhibits sparsity, indicating that only a small number of dimensions pos…