9 citations · 11 across the 7 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.OC2021
Paving the Way for Consensus: Convergence of Block Gossip Algorithms
Jamie Haddock, Benjamin Jarman, Chen Yap
Gossip protocols are popular methods for average consensus problems in distributed computing. We prove new convergence guarantees for a variety of such protocols, including path, c…
math.NA2021★ 1 cited
Randomized Extended Kaczmarz is a Limit Point of Sketch-and-Project
Benjamin Jarman, Nathan Mankovich, Jacob D. Moorman
The sketch-and-project (SAP) framework for solving systems of linear equations has unified the theory behind popular projective iterative methods such as randomized Kaczmarz, rando…
math.NA2021
QuantileRK: Solving Large-Scale Linear Systems with Corrupted, Noisy Data
Benjamin Jarman, Deanna Needell
Measurement data in linear systems arising from real-world applications often suffers from both large, sparse corruptions, and widespread small-scale noise. This can render many po…