abstract
motivated by geometric problems in signal processing, computer vision, and structural biology, we
study a class of orbit recovery problems where we observe noisy copies of an unknown signal, each acted
upon by a random element of some group (such as z/p or so(3)). the goal is to recover the orbit of the
signal under the group action. this generalizes problems of interest such as multi-reference alignment
(mra) and the reconstruction problem in cryo-electron microscopy (cryo-em). we obtain matching
lower and upper bounds on the sample complexity of these problems in high generality, showing that the
statistical difficulty is intricately determined by the invariant theory of the underlying symmetry group.
in particular, we determine that for cryo-em with noise variance σ 2 and uniform viewing directions,
the number of samples required scales as σ 6 . we match this bound with a novel algorithm for ab initio
reconstruction in cryo-em, based on invariant features of degree at most 3. we further discuss how to
recover multiple molecular structures from heterogeneous cryo-em samples.