The following pages link to Ben Adcock (Q404260):
Displaying 26 items.
- A Stability Barrier for Reconstructions from Fourier Samples (Q5415983) (← links)
- Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients (Q5497022) (← links)
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids (Q5741066) (← links)
- Optimal sampling rates for approximating analytic functions from pointwise samples (Q5854358) (← links)
- Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging (Q5860357) (← links)
- An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains (Q5886856) (← links)
- Optimal approximation of infinite-dimensional holomorphic functions (Q6151536) (← links)
- Generalized sampling: stable reconstructions, inverse problems and compressed sensing over the continuum (Q6245340) (← links)
- A note on compressed sensing of structured sparse wavelet coefficients from subsampled Fourier measurements (Q6250142) (← links)
- On asymptotic structure in compressed sensing (Q6252390) (← links)
- Optimal Sparse Recovery for Multi-Sensor Measurements (Q6271779) (← links)
- Sparsity and Parallel Acquisition: Optimal Uniform and Nonuniform Recovery Guarantees (Q6271875) (← links)
- Recovery guarantees for compressed sensing with unknown errors (Q6283191) (← links)
- Compressed sensing approaches for polynomial approximation of high-dimensional functions (Q6284584) (← links)
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing (Q6319290) (← links)
- The benefits of acting locally: Reconstruction algorithms for sparse in levels signals with stable and robust recovery guarantees (Q6343596) (← links)
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames (Q6379727) (← links)
- An Adaptive sampling and domain learning strategy for multivariate function approximation on unknown domains (Q6389781) (← links)
- Towards optimal sampling for learning sparse approximation in high dimensions (Q6390185) (← links)
- NESTANets: Stable, accurate and efficient neural networks for analysis-sparse inverse problems (Q6392537) (← links)
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples (Q6394744) (← links)
- Monte Carlo is a good sampling strategy for polynomial approximation in high dimensions (Q6408243) (← links)
- CAS4DL: Christoffel Adaptive Sampling for function approximation via Deep Learning (Q6408825) (← links)
- Stable and accurate least squares radial basis function approximations on bounded domains (Q6418177) (← links)
- Near-optimal learning of Banach-valued, high-dimensional functions via deep neural networks (Q6418180) (← links)
- Optimal approximation of infinite-dimensional holomorphic functions II: recovery from i.i.d. pointwise samples (Q6456701) (← links)