On the Sample Complexity of Super-Resolution Radar

08/14/2020
by   Mohammad Mahdi Kamjoo, et al.
0

We point out an issue with Lemma 8.6 of [1]. This lemma specifies the required sample complexity for recovering the delay-Doppler pairs in radar systems. In this lemma, it is claimed that the required sample complexity is linearly related to the number of delay-Doppler pairs. However, the way this result is proved seems to be wrong and leads to a quadratic relation. In this work, we provide a correction to the proof of this lemma.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2019

On sample complexity of neural networks

We consider functions defined by deep neural networks as definable objec...
research
03/22/2022

A Note on Target Q-learning For Solving Finite MDPs with A Generative Oracle

Q-learning with function approximation could diverge in the off-policy s...
research
03/29/2021

The Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

We provide a lowerbound on the sample complexity of distribution-free pa...
research
10/06/2018

Super-resolution radar imaging via convex optimization

A radar system emits probing signals and records the reflections. Estima...
research
07/24/2021

On the Sample Complexity of Privately Learning Axis-Aligned Rectangles

We revisit the fundamental problem of learning Axis-Aligned-Rectangles o...
research
02/03/2023

Sample Complexity of Probability Divergences under Group Symmetry

We rigorously quantify the improvement in the sample complexity of varia...
research
09/04/2018

Parity Crowdsourcing for Cooperative Labeling

Consider a database of k objects, e.g., a set of videos, where each obje...

Please sign up or login with your details

Forgot password? Click here to reset