Abstract
Modern problems in AI or in numerical analysis require nonsmooth approaches with a exible calculus. We introduce generalized derivatives called conservative fields for which we develop a calculus and provide representation formulas. Functions having a conservative field are called path differentiable: convex, concave, Clarke regular and any semialgebraic Lipschitz continuous functions are path differentiable. Using Whitney stratification techniques for semialgebraic and definable sets, our model provides variational formulas for nonsmooth automatic diffrentiation oracles, as for instance the famous backpropagation algorithm in deep learning. Our differential model is applied to establish the convergence in values of nonsmooth stochastic gradient methods as they are implemented in practice.
Keywords
Deep Learning, Automatic differentiation, Backpropagation algorithm,; Nonsmooth stochastic optimization, Defiable sets, o-minimal structures, Stochastic gradient, Clarke subdifferential, First order methods;
Replaced by
Jérôme Bolte, and Edouard Pauwels, “Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning”, Mathematical Programming, April 2020, pp. 1–33.
Reference
Jérôme Bolte, and Edouard Pauwels, “Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning”, TSE Working Paper, n. 19-1044, October 2019.
See also
Published in
TSE Working Paper, n. 19-1044, October 2019