| Publication | Date of Publication | Type |
|---|
Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation
(available as arXiv preprint) | 2026-06-25 | Paper |
The devil in the (de)tails: an improved recovery guarantee for sparse approximation
(available as arXiv preprint) | 2026-06-24 | Paper |
The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
Sampling Theory, Signal Processing, and Data Analysis | 2025-05-22 | Paper |
Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
IMA Journal of Numerical Analysis | 2025-03-19 | Paper |
A practical existence theorem for reduced order models based on convolutional autoencoders
Foundations of Data Science | 2025-02-18 | Paper |
Square root LASSO: well-posedness, Lipschitz stability, and the tuning trade-off
SIAM Journal on Optimization | 2024-07-29 | Paper |
LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
SIAM Journal on Mathematics of Data Science | 2024-01-11 | Paper |
| Model-adapted Fourier sampling for generative compressed sensing | 2023-10-07 | Paper |
Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
Foundations of Computational Mathematics | 2023-04-14 | Paper |
| Near-optimal learning of Banach-valued, high-dimensional functions via deep neural networks | 2022-11-22 | Paper |
The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
| Monte Carlo is a good sampling strategy for polynomial approximation in high dimensions | 2022-08-18 | Paper |
| A coherence parameter characterizing generative compressed sensing with Fourier measurements | 2022-07-19 | Paper |
| Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions | 2022-06-02 | Paper |
Wavelet–Fourier CORSING techniques for multidimensional advection–diffusion–reaction equations
IMA Journal of Numerical Analysis | 2022-05-17 | Paper |
| Sparse Polynomial Approximation of High-Dimensional Functions | 2022-04-28 | Paper |
| On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples | 2022-03-25 | Paper |
Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit
(available as arXiv preprint) | 2021-12-02 | Paper |
On oracle-type local recovery guarantees in compressed sensing
Information and Inference: A Journal of the IMA | 2021-08-16 | Paper |
Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs
Applied and Computational Harmonic Analysis | 2021-06-29 | Paper |
A compressive spectral collocation method for the diffusion equation under the restricted isometry property
Lecture Notes in Computational Science and Engineering | 2020-12-18 | Paper |
Compressive isogeometric analysis
Computers & Mathematics with Applications | 2020-12-08 | Paper |
Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
Computers & Mathematics with Applications | 2020-10-11 | Paper |
The benefits of acting locally: Reconstruction algorithms for sparse in levels signals with stable and robust recovery guarantees
(available as arXiv preprint) | 2020-06-23 | Paper |
Compressive Isogeometric Analysis
(available as arXiv preprint) | 2020-03-13 | Paper |
Correcting for unknown errors in sparse high-dimensional function approximation
Numerische Mathematik | 2019-06-25 | Paper |
Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
(available as arXiv preprint) | 2019-05-24 | Paper |
Wavelet-Fourier CORSING techniques for multi-dimensional advection-diffusion-reaction equations
(available as arXiv preprint) | 2018-12-21 | Paper |
Robustness to Unknown Error in Sparse Regularization
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
A theoretical study of compressed solving for advection-diffusion-reaction problems
Mathematics of Computation | 2017-10-30 | Paper |
| Compressed sensing approaches for polynomial approximation of high-dimensional functions | 2017-03-20 | Paper |
| Recovery guarantees for compressed sensing with unknown errors | 2017-02-14 | Paper |
On the simultaneous refinement of the zeros of H-palindromic polynomials
Journal of Computational and Applied Mathematics | 2014-07-25 | Paper |
A practical existence theorem for reduced order models based on convolutional autoencoders
(available as arXiv preprint) | N/A | Paper |
Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks
(available as arXiv preprint) | N/A | Paper |
