9 citations · 11 across the 4 of their papers we have counts for
5 papers
Structural Equivalence in Subgraph Matching
Dominic Yang, Yurun Ge, Thien Nguyen +3
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify t…
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…
Selectable Set Randomized Kaczmarz
Yotam Yaniv, Jacob D. Moorman, William Swartworth +3
The Randomized Kaczmarz method (RK) is a stochastic iterative method for solving linear systems that has recently grown in popularity due to its speed and low memory requirement. S…
Randomized Kaczmarz with Averaging
Jacob D. Moorman, Thomas K. Tu, Denali Molitor +1
The randomized Kaczmarz (RK) method is an iterative method for approximating the least-squares solution of large linear systems of equations. The standard RK method uses sequential…
Adaptive Sketch-and-Project Methods for Solving Linear Systems
Robert Gower, Denali Molitor, Jacob Moorman +1
We present new adaptive sampling rules for the sketch-and-project method for solving linear systems. To deduce our new sampling rules, we first show how the progress of one step of…