# Super-resolution meets machine learning: approximation of measures

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Jul 2019.

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

- [A signal separation view of classification](https://mlsanity.com/paper/2509.24140/) (2025)

## Abstract (arXiv)

The problem of super-resolution in general terms is to recuperate a finitely supported measure μ given finitely many of its coefficients hatμ(k) with respect to some orthonormal system. The interesting case concerns situations, where the number of coefficients required is substantially smaller than a power of the reciprocal of the minimal separation among the points in the support of μ. In this paper, we consider the more severe problem of recuperating μ approximately without any assumption on μ beyond having a finite total variation. In particular, μ may be supported on a continuum, so that the minimal separation among the points in the support of μ is 0. A variant of this problem is also of interest in machine learning as well as the inverse problem of de-convolution. We define an appropriate notion of a distance between the target measure and its recuperated version, give an explicit expression for the recuperation operator, and estimate the distance between μ and its approximation. We show that these estimates are the best possible in many different ways. We also explain why for a finitely supported measure the approximation quality of its recuperation is bounded from below if the amount of information is smaller than what is demanded in the super-resolution problem.