289 citations · 1.3k across the 22 of their papers we have counts for
3 papers · 1 filter
A Scale Invariant Flatness Measure for Deep Network Minima
Akshay Rangamani, Nam H. Nguyen, Abhishek Kumar +3
It has been empirically observed that the flatness of minima obtained from training deep networks seems to correlate with better generalization. However, for deep networks with pos…
Near-separable Non-negative Matrix Factorization with - and Bregman Loss Functions
Abhishek Kumar, Vikas Sindhwani
Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al.…
Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization
Abhishek Kumar, Vikas Sindhwani, Prabhanjan Kambadur
The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-c…