research
∙
12/17/2020
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables
We consider fast, provably accurate algorithms for approximating functio...
share
research
∙
07/10/2020
Semi-supervised Learning for Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products
We generalize a graph-based multiclass semi-supervised classification te...
research
∙
06/23/2020
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
In this paper a sublinear time algorithm is presented for the reconstruc...
research
∙
03/21/2020
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size
In this paper we present the first known deterministic algorithm for the...
research
∙
11/22/2019
Worst case recovery guarantees for least squares approximation using random samples
We consider a least squares regression algorithm for the recovery of com...
research
∙
09/20/2019
Sparse Harmonic Transforms II: Best s-Term Approximation Guarantees for Bounded Orthonormal Product Bases in Sublinear-Time
In this paper, we develop a sublinear-time compressive sensing algorithm...
research
∙
08/14/2018
