Rates of estimation for high-dimensional multi-reference alignment

05/04/2022
by   Zehao Dou, et al.
0

We study the continuous multi-reference alignment model of estimating a periodic function on the circle from noisy and circularly-rotated observations. Motivated by analogous high-dimensional problems that arise in cryo-electron microscopy, we establish minimax rates for estimating generic signals that are explicit in the dimension K. In a high-noise regime with noise variance σ^2 ≳ K, the rate scales as σ^6 and has no further dependence on the dimension. This rate is achieved by a bispectrum inversion procedure, and our analyses provide new stability bounds for bispectrum inversion that may be of independent interest. In a low-noise regime where σ^2 ≲ K/log K, the rate scales instead as Kσ^2, and we establish this rate by a sharp analysis of the maximum likelihood estimator that marginalizes over latent rotations. A complementary lower bound that interpolates between these two regimes is obtained using Assouad's hypercube lemma.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2021

Dihedral multi-reference alignment

We study the dihedral multi-reference alignment problem of estimating th...
research
07/23/2019

Minimax rates in sparse, high-dimensional changepoint detection

We study the detection of a sparse change in a high-dimensional mean vec...
research
07/22/2020

Multi-reference alignment in high dimensions: sample complexity and phase transition

Multi-reference alignment entails estimating a signal in ℝ^L from its ci...
research
07/11/2016

Bounds on the Number of Measurements for Reliable Compressive Classification

This paper studies the classification of high-dimensional Gaussian signa...
research
07/02/2019

The generalized orthogonal Procrustes problem in the high noise regime

We consider the problem of estimating a cloud of points from numerous no...
research
03/24/2019

Non-Standard Asymptotics in High Dimensions: Manski's Maximum Score Estimator Revisited

Manski's celebrated maximum score estimator for the binary choice model ...
research
09/23/2021

Sparse multi-reference alignment: sample complexity and computational hardness

Motivated by the problem of determining the atomic structure of macromol...

Please sign up or login with your details

Forgot password? Click here to reset