Reconstruction of frequency-localized functions from pointwise samples via least squares and deep learning
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911308807405568 |
|---|---|
| author | Neuman, A. Martina Pineda, Andres Felipe Lerma Bramburger, Jason J. Brugiapaglia, Simone |
| author_facet | Neuman, A. Martina Pineda, Andres Felipe Lerma Bramburger, Jason J. Brugiapaglia, Simone |
| contents | Recovering frequency-localized functions from pointwise data is a fundamental task in signal processing. We examine this problem from an approximation-theoretic perspective, focusing on least squares and deep learning-based methods. First, we establish a novel recovery theorem for least squares approximations using the Slepian basis from uniform random samples in low dimensions, explicitly tracking the dependence of the bandwidth on the sampling complexity. Building on these results, we then present a recovery guarantee for approximating bandlimited functions via deep learning from pointwise data. This result, framed as a practical existence theorem, provides conditions on the network architecture, training procedure, and data acquisition sufficient for accurate approximation. To complement our theoretical findings, we perform numerical comparisons between least squares and deep learning for approximating one- and two-dimensional functions. We conclude with a discussion of the theoretical limitations and the practical gaps between theory and implementation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09794 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reconstruction of frequency-localized functions from pointwise samples via least squares and deep learning Neuman, A. Martina Pineda, Andres Felipe Lerma Bramburger, Jason J. Brugiapaglia, Simone Classical Analysis and ODEs Machine Learning Numerical Analysis Recovering frequency-localized functions from pointwise data is a fundamental task in signal processing. We examine this problem from an approximation-theoretic perspective, focusing on least squares and deep learning-based methods. First, we establish a novel recovery theorem for least squares approximations using the Slepian basis from uniform random samples in low dimensions, explicitly tracking the dependence of the bandwidth on the sampling complexity. Building on these results, we then present a recovery guarantee for approximating bandlimited functions via deep learning from pointwise data. This result, framed as a practical existence theorem, provides conditions on the network architecture, training procedure, and data acquisition sufficient for accurate approximation. To complement our theoretical findings, we perform numerical comparisons between least squares and deep learning for approximating one- and two-dimensional functions. We conclude with a discussion of the theoretical limitations and the practical gaps between theory and implementation. |
| title | Reconstruction of frequency-localized functions from pointwise samples via least squares and deep learning |
| topic | Classical Analysis and ODEs Machine Learning Numerical Analysis |
| url | https://arxiv.org/abs/2502.09794 |