cs.LGMay 19, 2024

Gradient Testing and Estimation by Comparisons

Authors: Xiwen TaoChenyi ZhangHelin WangYexin ZhangTongyang Li

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

Abstract

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 ⁣:RnRf\colon\mathbb R^n\to\mathbb R, xRn\mathbf{x}\in\mathbb R^n, and ε>0\varepsilon>0, we design a gradient testing algorithm that determines whether the normalized gradient f(x)/f(x)\nabla f(\mathbf{x})/\|\nabla f(\mathbf{x})\| is ε\varepsilon-close or 2ε2\varepsilon-far from a given unit vector v\mathbf{v} using O(1)O(1) queries, as well as a gradient estimation algorithm that outputs an ε\varepsilon-estimate of f(x)/f(x)\nabla f(\mathbf{x})/\|\nabla f(\mathbf{x})\| using O(nlog(1/ε))O(n\log(1/\varepsilon)) 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/ε))O(\log (n/\varepsilon)) queries.

Explore similar work

CardsList
  1. Finding Stationary Points by Comparisons

    Jun 25, 2026Helin Wang, Chenyi Zhang, Xiwen Tao +2Sharp Joint-Kl Oracle TheoryNonconvex

  2. Min-Max Optimization Requires Exponentially Many Queries

    May 13, 2026Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1Convex OptimizationNonconvex