16 citations · 73 across the 29 of their papers we have counts for
3 papers · 1 filter
Phase Transitions for Detecting Latent Geometry in Random Graphs
Matthew Brennan, Guy Bresler, Dheeraj Nagaraj
Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These g…
Making the Last Iterate of SGD Information Theoretically Optimal
Prateek Jain, Dheeraj Nagaraj, Praneeth Netrapalli
Stochastic gradient descent (SGD) is one of the most widely used algorithms for large scale optimization problems. While classical theoretical analysis of SGD for convex problems s…
SGD without Replacement: Sharper Rates for General Smooth Convex Functions
Prateek Jain, Dheeraj Nagaraj, Praneeth Netrapalli
We study stochastic gradient descent {\em without replacement} (\sgdwor) for smooth convex functions. \sgdwor is widely observed to converge faster than true \sgd where each sample…