323 citations
- Claremont Graduate UniversityUS16 papers
- Scripps CollegeUS10 papers
- Pomona CollegeUS9 papers
- Harvey Mudd CollegeUS7 papers
- Pitzer CollegeUS7 papers
- Georgia Institute of TechnologyUS4 papers
- Arizona State UniversityUS3 papers
- Jagiellonian UniversityPL3 papers
- Massachusetts Institute of TechnologyUS3 papers
- University of California, Los AngelesUS3 papers
- University of ConnecticutUS3 papers
- University of South FloridaUS3 papers
Showing 2013 · math.NAShow all
3 papers · 2 filters
math.NA2013
Guaranteed sparse signal recovery with highly coherent sensing matrices
Guangliang Chen, Atul Divekar, Deanna Needell
Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the r…
math.NA2013★ 31 cited
Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm
Deanna Needell, Nathan Srebro, Rachel Ward
We obtain an improved finite-sample guarantee on the linear convergence of stochastic gradient descent for smooth and strongly convex objectives, improving from a quadratic depende…
math.NA2013
Kaczmarz Algorithm with Soft Constraints for User Interface Layout
Noreen Jamil, Deanna Needell, Johannes Muller +2
The Kaczmarz method is an iterative method for solving large systems of equations that projects iterates orthogonally onto the solution space of each equation. In contrast to direc…