Fast Approximations of the Pattern Maximum Likelihood Estimate
summary
Defines the pattern maximum likelihood (PML) as the p that maximizes a permanent over a matrix parameterized by p and shows practical surrogates: a Bethe (beta) free‑energy approximation and a Sinkhorn (row/column scaling) approximation. Uses alternating maximization with sum‑product to find a doubly stochastic gamma that connects estimators. Gives deterministic guarantees of 2^n and e^n (Bethe conjectured ~sqrt2^n), and numerical evidence on 10,000 random 10x10 matrices that Bethe matches the permanent’s slope better than Sinkhorn. Valiant–Valiant uses Poissonization plus an LP over discretized probabilities.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:46Overview
- 2:31Simons pointer
- 7:16Permutation Matrix
- 14:02General Information
- 15:26Free Energy
- 17:26Approximations
- 17:45Approximate
- 19:01Sinkhole
- 19:30Efficient Approximation
- 20:35Linear Program
- 23:12Conclusions
related talks
14mEfficient Universal Estimators For Symmetric Property Estimation
48mExact Minimax Estimation for Phase Synchronization
45mEfficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
36mTo Be (Hard) or Not Be:...
44mA Modern Maximum-Likelihood Theory for High-Dimensional Logistic Regression
35mPhase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
41mpMSE Mechanism: Differentially Private Synthetic Data with Maximal Distributional Similarity
58mUniversality of Approximate Message Passing on Semi-random Matrices
