<p>We study the problem of signal recovery in the dihedral multi-reference alignment (MRA) model, where a signal is observed under random actions of the dihedral group and corrupted by additive noise. While previous work has shown that cyclic invariants of degree three (the bispectrum) suffice to recover generic signals up to circular shift [<CitationRef CitationID="CR11">11</CitationRef>], the dihedral setting introduces new challenges due to the group’s non-abelian structure. In particular, reflections prevent the diagonalization of the third moment tensor in the Fourier basis, making classical bispectrum techniques inapplicable. In this work, we prove that the orbit of a generic signal in the <i>n</i>-dimensional standard representation of the 2<i>n</i>-element dihedral group <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(D_{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> is uniquely determined by its invariant tensors of degree at most three. This resolves an open question posed in [<CitationRef CitationID="CR12">12</CitationRef>], and establishes that the sample complexity for dihedral MRA with uniform distribution is <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\omega (\sigma ^6)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ω</mi> <mo stretchy="false">(</mo> <msup> <mi>σ</mi> <mn>6</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, matching the cyclic case. Along the way we prove a result of independent interest (Theorem&#xa0;<InternalRef RefID="FPar12">3.2</InternalRef>), namely that invariants of degree at most three separate generic real orbits in band-limited representations of the orthogonal group <i>O</i>(2). While frequency marching becomes computationally impractical in the dihedral setting, we show numerically that a simple optimization algorithm reliably recovers the signal from third-order moments, even with random initialization. Our results establish the dihedral model as both a challenging and viable alternative to the cyclic model–one that better reflects practical symmetry constraints and deserves further exploration in both theoretical and applied settings.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

The Reflection-Invariant Bispectrum: Signal Recovery in the Dihedral Model

  • Dan Edidin,
  • Josh Katz

摘要

We study the problem of signal recovery in the dihedral multi-reference alignment (MRA) model, where a signal is observed under random actions of the dihedral group and corrupted by additive noise. While previous work has shown that cyclic invariants of degree three (the bispectrum) suffice to recover generic signals up to circular shift [11], the dihedral setting introduces new challenges due to the group’s non-abelian structure. In particular, reflections prevent the diagonalization of the third moment tensor in the Fourier basis, making classical bispectrum techniques inapplicable. In this work, we prove that the orbit of a generic signal in the n-dimensional standard representation of the 2n-element dihedral group \(D_{n}\) D n is uniquely determined by its invariant tensors of degree at most three. This resolves an open question posed in [12], and establishes that the sample complexity for dihedral MRA with uniform distribution is \(\omega (\sigma ^6)\) ω ( σ 6 ) , matching the cyclic case. Along the way we prove a result of independent interest (Theorem 3.2), namely that invariants of degree at most three separate generic real orbits in band-limited representations of the orthogonal group O(2). While frequency marching becomes computationally impractical in the dihedral setting, we show numerically that a simple optimization algorithm reliably recovers the signal from third-order moments, even with random initialization. Our results establish the dihedral model as both a challenging and viable alternative to the cyclic model–one that better reflects practical symmetry constraints and deserves further exploration in both theoretical and applied settings.