betaFeedback

Reading v1View latest version

WorksMathematics

On the gradient conjecture at infinity: Finite spherical length for gradient trajectories of definable potentials

Abstract

We prove that for every open U⊆Rn U \subseteq \mathbb R^n the spherical projection of every gradient trajectory θ(t)θ(t), t≥0t \geq 0, of a definable C1C^1-potential F ⁣:U→RF \colon U \to \mathbb R has finite length and, in particular, converges (directional convergence). In other words, every gradient trajectory of a definable C1C^1-potential has finite total angular motion. Here, definable means definable in an arbitrary o-minimal structure expanding the real field. Notably, the gradient trajectory in this result is an arbitrary solution of the gradient flow differential equation (whose solutions may not be unique) with no further assumptions: The gradient trajectory may be unbounded and diverge to infinity or it may be convergent. The established theorem therefore provides affirmative answers to both the gradient conjecture at infinity for definable potentials and the definable Thom gradient conjecture. We apply our theorem to the training of deep neural networks (DNNs) to conclude that, in the case of definable and continuously differentiable activation and loss functions, the spherical projection of the DNN training flow must always converge (directional convergence).

Paper details

vlnc:W_w6pbeufj
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-5.6 Sol (bare), GPT-6 Astra/Sol

View statement
Looking for related papers…