Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani,, Junxing Wang, Shen Chen Xu

TL;DR
This paper introduces a nearly-linear time algorithm for approximate elimination orderings in sparse matrices using graph sketching, addressing adaptive adversaries and providing provable guarantees in scientific computing.
Contribution
It presents the first nearly-linear time algorithm with provable approximation guarantees for elimination orderings, incorporating randomized graph sketching against adaptive adversaries.
Findings
Developed a data structure for approximate fill degrees in polylogarithmic time.
Achieved a nearly-linear time algorithm for greedy minimum degree orderings.
Introduced a technique to decorrelate queries and updates in randomized data structures.
Abstract
Motivated by the study of matrix elimination orderings in combinatorial scientific computing, we utilize graph sketching and local sampling to give a data structure that provides access to approximate fill degrees of a matrix undergoing elimination in time per elimination and query. We then study the problem of using this data structure in the minimum degree algorithm, which is a widely-used heuristic for producing elimination orderings for sparse matrices by repeatedly eliminating the vertex with (approximate) minimum fill degree. This leads to a nearly-linear time algorithm for generating approximate greedy minimum degree orderings. Despite extensive studies of algorithms for elimination orderings in combinatorial scientific computing, our result is the first rigorous incorporation of randomized tools in this setting, as well as the first nearly-linear time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
