2025/01/01 by Ahmed Abdelkader, David M. Mount
Computer Science · #Advanced Database Systems and Queries #Data Management and Algorithms #Optimization and Search Problems #acm:52C45 #cs.CG #msc:52C45
paper · pdf · doi:10.1137/1.9781611978322.172
published as ACM-SIAM Symposium on Discrete Algorithms (2025) 5065-5099 · Presented at SODA 2025
openalex publication_date 2025/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29 · arxiv created 2026/07/30 · arxiv updated 2026/08/03
The widespread use of gradient-based optimization has motivated the adaptation of various classical algorithms into differentiable solvers compatible with learning pipelines. In this paper, we investigate the enhancement of traditional geometric query problems such that the result consists of both the geometric function as well as its gradient. Specifically, we study the fundamental problem of distance queries against a set of points P in ℝd, which also underlies various similarity measures for learning algorithms.