Gradient flow in parameter space is equivalent to linear interpolation in output space
<|reference_start|>Gradient flow in parameter space is equivalent to linear interpolation in output space: We prove that the usual gradient flow in parameter space that underlies many training algorithms for neural networks in deep learning can be continuously deformed into an adapted gradient flow which yields (constrained) Euclidean gradient flow in output space. Moreover, if the Jacobian of the outputs with respect to the parameters is full rank (for fixed training data), then the time variable can be reparametrized so that the resulting flow is simply linear interpolation, and a global minimum can be achieved.<|reference_end|>
@article{chen2024gradient,
    title={Gradient flow in parameter space is equivalent to linear interpolation
  in output space},
    author={Thomas Chen, Patr'icia Mu~noz Ewald},
    journal={arXiv preprint arXiv:2408.01517},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.01517},
    primaryClass={cs.LG cs.AI math-ph math.MP math.OC stat.ML}
}