# Learning to Sample: Data-Driven Sampling and Reconstruction of FRI Signals

arXiv: https://arxiv.org/abs/2106.14500 · HTML: https://mlsanity.com/paper/2106.14500/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jun 2021.

## Built on by (most cited first, 4 of 4)

- [Theoretical Perspectives on Deep Learning Methods in Inverse Problems](https://mlsanity.com/paper/2206.14373/) (2022)
- [Deep Task-Based Analog-to-Digital Conversion](https://mlsanity.com/paper/2201.12634/) (2022)
- [Learning Structured Compressed Sensing with Automatic Resource Allocation](https://mlsanity.com/paper/2410.18954/) (2024)
- [Compressed BC-LISTA via Low-Rank Convolutional Decomposition](https://mlsanity.com/paper/2601.23148/) (2026)

## Abstract (arXiv)

Finite-rate-of-innovation (FRI) signals are ubiquitous in applications such as radar, ultrasound, and time of flight imaging. Due to their finite degrees of freedom, FRI signals can be sampled at sub-Nyquist rates using appropriate sampling kernels and reconstructed using sparse-recovery algorithms. Typically, Fourier samples of the FRI signals are used for reconstruction. The reconstruction quality depends on the choice of Fourier samples and recovery method. In this paper, we consider to jointly optimize the choice of Fourier samples and reconstruction parameters. Our framework is a combination of a greedy subsampling algorithm and a learning-based sparse recovery method. Unlike existing techniques, the proposed algorithm can flexibly handle changes in the sampling rate and does not suffer from differentiability issues during training. Importantly, exact knowledge of the FRI pulse is not required. Numerical results show that, for a given number of samples, the proposed joint design leads to lower reconstruction error for FRI signals compared to independent data-driven design methods for both noisy and clean samples. Our learning to sample approach can be readily applied to other sampling setups as well including compressed sensing problems.