The reviewed record of science sign in
Pith

arxiv: 2312.04709 · v1 · pith:CIGLBWOG · submitted 2023-12-07 · cs.LG · cs.NE

How to guess a gradient

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:CIGLBWOGrecord.jsonopen to challenge →

classification cs.LG cs.NE
keywords gradientsderivativesdirectionalexactgradientnetworkoptimizationanswer
0
0 comments X
read the original abstract

How much can you say about the gradient of a neural network without computing a loss or knowing the label? This may sound like a strange question: surely the answer is "very little." However, in this paper, we show that gradients are more structured than previously thought. Gradients lie in a predictable low-dimensional subspace which depends on the network architecture and incoming features. Exploiting this structure can significantly improve gradient-free optimization schemes based on directional derivatives, which have struggled to scale beyond small networks trained on toy datasets. We study how to narrow the gap in optimization performance between methods that calculate exact gradients and those that use directional derivatives. Furthermore, we highlight new challenges in overcoming the large gap between optimizing with exact gradients and guessing the gradients.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adaptive directional gradients for parameterised quantum circuits

    quant-ph 2026-06 unverdicted novelty 8.0

    Forward gradient framework for PQCs unifies SPSA and parameter-shift as limits, introduces QUIVER adaptive optimizer with closed-form measurement allocation, and demonstrates efficient training of 60-qubit circuits on...