2.3k citations · 2.7k across the 38 of their papers we have counts for
4 papers · 1 filter
The intriguing role of module criticality in the generalization of deep networks
Niladri S. Chatterji, Behnam Neyshabur, Hanie Sedghi
We study the phenomenon that some modules of deep neural networks (DNNs) are more critical than others. Meaning that rewinding their parameter values back to initialization, while…
Langevin Monte Carlo without smoothness
Niladri S. Chatterji, Jelena Diakonikolas, Michael I. Jordan +1
Langevin Monte Carlo (LMC) is an iterative algorithm used to generate samples from a distribution that is known only up to a normalizing constant. The nonasymptotic dependence of i…
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits
Niladri S. Chatterji, Vidya Muthukumar, Peter L. Bartlett
We consider the stochastic linear (multi-armed) contextual bandit problem with the possibility of hidden simple multi-armed bandit structure in which the rewards are independent of…
Is There an Analog of Nesterov Acceleration for MCMC?
Yi-An Ma, Niladri Chatterji, Xiang Cheng +3
We formulate gradient-based Markov chain Monte Carlo (MCMC) sampling as optimization on the space of probability measures, with Kullback-Leibler (KL) divergence as the objective fu…