198 citations · 764 across the 28 of their papers we have counts for
4 papers · 1 filter
Approximate Gradient Coding via Sparse Random Graphs
Zachary Charles, Dimitris Papailiopoulos, Jordan Ellenberg
Distributed algorithms are often beset by the straggler effect, where the slowest compute nodes in the system dictate the overall running time. Coding-theoretic techniques have bee…
Stability and Generalization of Learning Algorithms that Converge to Global Optima
Zachary Charles, Dimitris Papailiopoulos
We establish novel generalization bounds for learning algorithms that converge to global minima. We do so by deriving black-box stability results that only depend on the convergenc…
Exploiting Algebraic Structure in Global Optimization and the Belgian Chocolate Problem
Zachary Charles, Nigel Boston
The Belgian chocolate problem involves maximizing a parameter δ over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that…
Subspace Clustering with Missing and Corrupted Data
Zachary Charles, Amin Jalali, Rebecca Willett
Given full or partial information about a collection of points that lie close to a union of several subspaces, subspace clustering refers to the process of clustering the points ac…