4 papers · 1 filter
A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
Jackie Lok, Elizaveta Rebrova
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We sh…
Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements
Cullen Haselby, Mark A. Iwen, Deanna Needell +2
In this paper we consider the problem of recovering a low-rank Tucker approximation to a massive tensor based solely on structured random compressive measurements. Crucially, the p…
On Subsampled Quantile Randomized Kaczmarz
Jamie Haddock, Anna Ma, Elizaveta Rebrova
When solving noisy linear systems Ax = b + c, the theoretical and empirical performance of stochastic iterative methods, such as the Randomized Kaczmarz algorithm, depends on the n…
On Graph Uncertainty Principle and Eigenvector Delocalization
Elizaveta Rebrova, Palina Salanevich
Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applic…