4 citations · 12 across the 16 of their papers we have counts for
18 papers · 1 filter
Node and Edge Differential Privacy for Graph Laplacian Spectra: Mechanisms and Scaling Laws
Calvin Hawkins, Bo Chen, Kasra Yazdani +1
This paper develops a framework for privatizing the spectrum of the graph Laplacian of an undirected graph using differential privacy. We consider two privacy formulations. The fir…
Technical Report: Distributed Asynchronous Large-Scale Mixed-Integer Linear Programming via Saddle Point Computation
Luke Fina, Matthew Hale
We solve large-scale mixed-integer linear programs (MILPs) via distributed asynchronous saddle point computation. This is motivated by the MILPs being able to model problems in mul…
Faster Asynchronous Nonconvex Block Coordinate Descent with Locally Chosen Stepsizes
Matthew Ubl, Matthew T. Hale
Distributed nonconvex optimization problems underlie many applications in learning and autonomy, and such problems commonly face asynchrony in agents' computations and communicatio…
Technical Report: A Totally Asynchronous Algorithm for Tracking Solutions to Time-Varying Convex Optimization Problems
Gabriel Behrendt, Matthew Hale
This paper presents a decentralized algorithm for a team of agents to track time-varying fixed points that are the solutions to time-varying convex optimization problems. The algor…
Exponentially Converging Distributed Gradient Descent with Intermittent Communication via Hybrid Methods
Katherine Hendrickson, Dawn Hustig-Schultz, Matthew Hale +1
We present a hybrid systems framework for multi-agent optimization in which agents execute computations in continuous time and communicate in discrete time. The optimization algori…
Asynchronous Parallel Nonconvex Optimization Under the Polyak-Lojasiewicz Condition
Kasra Yazdani, Matthew Hale
Communication delays and synchronization are major bottlenecks for parallel computing, and tolerating asynchrony is therefore crucial for accelerating parallel computation. Motivat…