Organizations: School of Electronics Engineering and Computer Science, Peking University · Computer Science Department, Stanford University · Center on Frontiers of Computing Studies, Peking University · School of Computer Science, Peking University
We study gradient testing and gradient estimation of smooth functions using only a comparison oracle that, given two points, indicates which one has the larger function value. For any smooth f:Rn→R, x∈Rn, and ε>0, we design a gradient testing algorithm that determines whether the normalized gradient ∇f(x)/∥∇f(x)∥ is ε-close or 2ε-far from a given unit vector v using O(1) queries, as well as a gradient estimation algorithm that outputs an ε-estimate of ∇f(x)/∥∇f(x)∥ using O(nlog(1/ε)) queries which we prove to be optimal. Furthermore, we study gradient estimation in the quantum comparison oracle model where queries can be made in superpositions, and develop a quantum algorithm using O(log(n/ε)) queries.