2 problems

The multireference alignment problem estimates a $d$-dimensional signal from $n$ shifted noisy copies, using the SDP-based relaxation described in Bandeira et al. Rank recovery con…

Let $d>1$, $n>2$, $m\geq d+1$, $A\in\mathbb{R}^{d\times m}$ represent $m$ random points in $\mathbb{R}^d$ (i.i.d. uniform random coordinates in $[0,1]^d$), and let…