Abstract. We design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency recovery. These are signals with the form f (t) = P k j=1 aje iω j t +ν, t ∈ Z Z; i.e., exponential polynomials with a noise term. The frequencies {ωj} satisfy ωj ∈ [η, 2π − η] and min i =j |ωi − ωj| ≥ η for some η > 0. We design a sublinear time randomized algorithm, which takes O(k log k log(1/η)(log k + log( a 1/ ν 1)) samples of f (t) and runs in time proportional to number of samples, recovering {ωj} and {aj} such that, with probability Ω(1), the approximation error satisfies |ω j − ωj| ≤ η/k and |aj − a j | ≤ ν 1/k for all j with |aj| ≥ ν 1/k.