If m > n, the O(n)-orbit of a generic m-point binary signal with at least some equal magnitudes is uniquely recoverable from autocorrelation, with an O(m^8) algorithm in R^3 when one magnitude is distinct.
Orbit recovery for spherical functions
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
In low-SNR Gaussian latent-variable models, optimally weighted GMoM using minimal-order moments achieves the same leading asymptotic covariance as MLE via matching layerwise expansions of the information operators.
bispectrum library delivers selective G-bispectra for seven groups with reduced costs (O(|G|) for finite groups, O(L^2) for spheres), sub-millisecond GPU times, and superior benchmark performance versus standard pooling in low-data regimes.
citing papers explorer
-
Euclidean distance geometry and the orthogonal beltway problem
If m > n, the O(n)-orbit of a generic m-point binary signal with at least some equal magnitudes is uniquely recoverable from autocorrelation, with an O(m^8) algorithm in R^3 when one magnitude is distinct.
-
The generalized method of moments is (almost) statistically efficient in low-SNR Gaussian latent-variable models
In low-SNR Gaussian latent-variable models, optimally weighted GMoM using minimal-order moments achieves the same leading asymptotic covariance as MLE via matching layerwise expansions of the information operators.
-
bispectrum: Selective $G$-Bispectra Made Practical
bispectrum library delivers selective G-bispectra for seven groups with reduced costs (O(|G|) for finite groups, O(L^2) for spheres), sub-millisecond GPU times, and superior benchmark performance versus standard pooling in low-data regimes.