13 citations · 23 across the 12 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LG2021
SGD Through the Lens of Kolmogorov Complexity
Gregory Schwartzman
We prove that stochastic gradient descent (SGD) finds a solution that achieves classification accuracy on the entire dataset. We do so under two main assumptions: (1. Local…
cs.DC2021
On the Complexity of Load Balancing in Dynamic Networks
Seth Gilbert, Uri Meir, Ami Paz +1
In the load balancing problem, each node in a network is assigned a load, and the goal is to equally distribute the loads among the nodes, by preforming local load exchanges. While…
cs.DC2021
Smoothed Analysis of Population Protocols
Gregory Schwartzman, Yuichi Sudo
In this work, we initiate the study of \emph{smoothed analysis} of population protocols. We consider a population protocol model where an adaptive adversary dictates the interactio…