Asymptotic mutual information in quadratic estimation problems over compact groups
From MaRDI portal
Cites work
- A novel and optimal spectral method for permutation synchronization
- Angular synchronization by eigenvectors and semidefinite programming
- Approximate message passing from random initialization with applications to Z₂ synchronization
- Assignment Problems and the Location of Economic Activities
- Asymptotic efficiency of simple decisions for the compound decision problem
- Asymptotic mutual information for the balanced binary stochastic block model
- Asymptotic Properties of the Quadratic Assignment Problem
- Asymptotic Solutions of the Compound Decision Problem for Two Completely Specified Distributions
- Broken replica symmetry bounds in the mean field spin glass model
- Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
- Efficient random graph matching via degree profiles
- Estimating rank-one matrices with mismatched prior and noise: universality and large deviations
- Exact matching of random graphs with constant correlation
- Exact Minimax Estimation for Phase Synchronization
- Exact solution of the gauge symmetric \(p\)-spin glass model on a complete graph
- Fundamental limits of symmetric low-rank matrix estimation
- General maximum likelihood empirical Bayes estimation of normal means
- High-dimensional statistics. A non-asymptotic viewpoint
- Improved performance guarantees for orthogonal group synchronization via generalized power method
- Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization
- Matching recovery threshold for correlated random graphs
- Mean Field Models for Spin Glasses
- Message-passing algorithms for synchronization problems over compact groups
- Minimax rates in permutation estimation for feature matching
- Mutual Information and Minimum Mean-Square Error in Gaussian Channels
- Near-optimal bounds for phase synchronization
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
- Non-unique games over compact groups and orientation estimation in cryo-EM
- Nonconvex phase synchronization
- On convex relaxation of graph isomorphism
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- Optimal errors and phase transitions in high-dimensional generalized linear models
- Optimal orthogonal group synchronization and rotation group synchronization
- Partial Recovery in the Graph Alignment Problem
- Phase transitions in semidefinite relaxations
- Preference Learning and Ranking by Pairwise Comparison
- Quadratic assignment problems
- Random graph matching at Otter's threshold via counting chandeliers
- SDP Achieves Exact Minimax Optimality in Phase Synchronization
- Semidefinite programs on sparse random graphs and their application to community detection
- Settling the Sharp Reconstruction Thresholds of Random Graph Matching
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
- Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality
- Statistical inference of finite-rank tensors
- Statistical limits of correlation detection in trees
- Stochastic Analysis of the Quadratic Assignment Problem
- Strong recovery of geometric planted matchings
- TAP free energy, spin glasses and variational inference
- The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
This page was built for publication: Asymptotic mutual information in quadratic estimation problems over compact groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909003)
