English

Gradient Testing and Estimation by Comparisons

Machine Learning 2026-02-20 v2 Data Structures and Algorithms Optimization and Control

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.

Keywords

Cite

@article{arxiv.2405.11454,
  title  = {Gradient Testing and Estimation by Comparisons},
  author = {Xiwen Tao and Chenyi Zhang and Helin Wang and Yexin Zhang and Tongyang Li},
  journal= {arXiv preprint arXiv:2405.11454},
  year   = {2026}
}

Comments

v2: Significant changes compared to v1. v2 focuses on the gradient testing and gradient estimation problems, with an improved bound on classical gradient estimation, a new result on classical gradient testing, as well as a new quantum algorithm and lower bound on gradient estimation