mlsanityData to 14 Oct 2026

Non-unique games over compact groups and orientation estimation in cryo-EM

arXiv 1505.03840 ↗First posted 14 May 2015cs.CV cs.DS math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

Let G be a compact group and let fij ∈ L2(G). We define the Non-Unique Games (NUG) problem as finding g1,dots,gn ∈ G to minimize sumi,j=1n fij left( gi gj-1right). We devise a relaxation of the NUG problem to a semidefinite program (SDP) by taking the Fourier transform of fij over G, which can then be solved efficiently. The NUG framework can be seen as a generalization of the little Grothendieck problem over the orthogonal group and the Unique Games problem and includes many practically relevant problems, such as the maximum likelihood estimator to registering bandlimited functions over the unit sphere in d-dimensions and orientation estimation in cryo-Electron Microscopy.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 May 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 0; 2025: 1; 2026: 1.

8 papers.