no code implementations • 3 Nov 2022 • Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos, Leello Tadesse Dadi, Volkan Cevher
We propose an adaptive variance-reduction method, called AdaSpider, for minimization of $L$-smooth, non-convex functions with a finite-sum structure.
no code implementations • ICLR 2022 • Moulik Choraria, Leello Tadesse Dadi, Grigorios Chrysos, Julien Mairal, Volkan Cevher
Inspired by such studies, we conduct a spectral analysis of the Neural Tangent Kernel (NTK) of PNNs.
no code implementations • NeurIPS 2021 • Fabian Latorre, Leello Tadesse Dadi, Paul Rolland, Volkan Cevher
We demonstrate this by deriving an upper bound on the Rademacher Complexity that depends on two key quantities: (i) the intrinsic dimension, which is a measure of isotropy, and (ii) the largest eigenvalue of the second moment (covariance) matrix of the distribution.