Main content start

Learning with latent symmetries

Date
Tue April 15th 2025, 4:30pm
Location
Sloan 380C
Speaker
Subhro Ghosh, National University of Singapore

Learning problems augmented with latent symmetries have attracted considerable interest in recent years. A significant class of such problems arises in experiments where a system is constrained to evolve in accordance with the rigid laws of nature, such as the celebrated technique of cryo-electron microscopy (cryo-EM). The constraint of such latent symmetries, given by group invariances or equivariances, precludes the possibility of having many repeated measurements of the exact same object and poses a fundamental challenge for learning a signal in the presence of ambient noise. We will start with a gentle introduction to the problem of learning under latent symmetries and explore its intriguing connections with a range of disparate topics: invariant theory, harmonic analysis, compressive sensing, and Gaussian calculus. We will subsequently specialize to the multi-reference alignment (MRA) model and explore fundamental aspects of the recovery problem (such as sample complexity) in the presence of structural constraints on the signal (such as sparsity). In particular, we unveil a novel quartic dependence on noise level for the sample complexity of sparse MRA, leveraging a range of mathematical tools from uncertainty principles of Fourier analysis to ideas from combinatorial optimization.

This talk is based in part on the following works:

  1. Ghosh, S. and Rigollet, P. (2023). Sparse multi-reference alignment: Phase retrieval, uniform uncertainty principles and the beltway problem. Foundations of Computational Mathematics 23(5), 1851-1898.
  2. Ghosh, S., Mukherjee, S.S. and Pan, J.B. (2023). Minimax-optimal estimation for sparse multi-reference alignment with collision-free signals. Prepublished, arXiv:2312.07839.