Gradient Testing and Estimation by Comparisons
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 , , and , we design a gradient testing algorithm that determines whether the normalized gradient is -close or -far from a given unit vector using queries, as well as a gradient estimation algorithm that outputs an -estimate of using 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 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