1 citations · 1 across the 2 of their papers we have counts for
5 papers
Randomized Kaczmarz for Tensor Linear Systems
Anna Ma, Denali Molitor
Solving linear systems of equations is a fundamental problem in mathematics. When the linear system is so large that it cannot be loaded into memory at once, iterative methods such…
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…
Bias of Homotopic Gradient Descent for the Hinge Loss
Denali Molitor, Deanna Needell, Rachel Ward
Gradient descent is a simple and widely used optimization method for machine learning. For homogeneous linear classifiers applied to separable data, gradient descent has been shown…
On Inferences from Completed Data
Jamie Haddock, Denali Molitor, Deanna Needell +3
Matrix completion has become an extremely important technique as data scientists are routinely faced with large, incomplete datasets on which they wish to perform statistical infer…