no code implementations • 22 Dec 2021 • Antonio Silveti-Falls, Cesare Molinari, Jalal Fadili
Under slightly stricter assumptions, we show almost sure weak convergence of the pointwise iterates to a saddle point.
no code implementations • NeurIPS 2021 • Jérôme Bolte, Tam Le, Edouard Pauwels, Antonio Silveti-Falls
In view of training increasingly complex learning architectures, we establish a nonsmooth implicit function theorem with an operational calculus.
no code implementations • NeurIPS 2021 • Jerome Bolte, Tam Le, Edouard Pauwels, Antonio Silveti-Falls
In view of training increasingly complex learning architectures, we establish a nonsmooth implicit function theorem with an operational calculus.
no code implementations • 11 May 2020 • Antonio Silveti-Falls, Cesare Molinari, Jalal Fadili
In this paper we propose and analyze inexact and stochastic versions of the CGALP algorithm developed in the authors' previous paper, which we denote ICGALP, that allows for errors in the computation of several important quantities.