13 citations · 23 across the 12 of their papers we have counts for
21 papers
Bounded Memory in Distributed Networks
Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang +3
The recent advent of programmable switches makes distributed algorithms readily deployable in real-world datacenter networks. However, there are still gaps between theory and pract…
Mini-batch -means terminates within iterations
Gregory Schwartzman
We answer the question: "Does local progress (on batches) imply global progress (on the entire dataset) for mini-batch -means?". Specifically, we consider mini-batch -means w…
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse +1
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutio…
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches
Wenchen Han, Vic Feng, Gregory Schwartzman +4
Optimizing the reaction to network events, which is critical in tasks such as clock synchronization, multicast, and routing, becomes increasingly challenging as networks grow large…
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…
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…