MLE of Reconstructions: Methods & Trends

• Maximum likelihood estimation of reconstructions is the process of recovering latent objects by maximizing a likelihood function under physical and noise model constraints.
• The approach couples physics-based forward operators with constrained optimization techniques, such as EM algorithms and projected-gradient methods, to enhance reconstruction fidelity.
• Integrating regularization, simulation-based approximations, and constraint enforcement mitigates overconfidence and grid-lock issues, boosting predictive robustness.

Maximum likelihood estimation of reconstructions is the practice of recovering a latent object from measurements by maximizing a likelihood, or equivalently minimizing a negative log-likelihood, under a specified forward model and noise model, and then using the recovered object as a plug-in surrogate for the unknown truth. In the literature, the reconstructed object ranges from a quantum state $\rho$ to a Faraday spectrum represented by point sources, a nonnegative image $x$, a ptychographic object or probe parameter vector $\theta$, a speckle-free reflectivity image $X$, or a motion-compensated PET activity measure $\mu$ (Blume-Kohout, 2010, Bell et al., 2012, Seifert et al., 2023, Chen et al., 10 Feb 2026, Pouchol et al., 2020).

1. Statistical formulation

In its generic form, maximum likelihood estimation starts with data $D$, an unknown parameter $\theta$, and a statistical model $p(D\mid \theta)$. The likelihood is $L(\theta)=p(D\mid \theta)$, and the estimator is

$$\hat\theta_{\mathrm{MLE}}=\arg\max_\theta L(\theta).$$

The reconstructed object is then “plugged in” for prediction, compression, decision-making, or subsequent inference (Blume-Kohout, 2010).

Across reconstruction problems, this template is specialized by the choice of forward operator and observation model. In quantum tomography with POVM elements $x$0, the normalized negative log-likelihood is

$x$1

optimized over $x$2 and $x$3 (Shang et al., 2016). In Poisson inverse problems, the negative log-likelihood becomes

$x$4

with $x$5 and $x$6 (Clerc et al., 13 Feb 2026). In RM synthesis, assuming independent complex Gaussian noise across frequency channels, the negative log-likelihood is

$x$7

where $x$8 is a continuous parametric model of point sources in Faraday depth (Bell et al., 2012). In coherent imaging with mixed Poisson–Gaussian noise, the data term becomes

$x$9

which explicitly models signal-dependent shot noise and additive readout noise (Seifert et al., 2023).

A recurring structural feature is that the maximum likelihood problem is rarely just a statistical fit. It is simultaneously a constrained inverse problem: the admissible parameter must satisfy physical, geometric, or structural constraints such as positivity, trace-one normalization, simplex constraints, sparsity, or a low-complexity tensor-network form (Shang et al., 2016, Clerc et al., 13 Feb 2026, Baumgratz et al., 2013).

2. Reconstruction objects and forward models

The reconstruction variable depends on the application domain, but the underlying pattern remains a physics-based map from object space to measurement space.

Setting	Reconstruction variable	Likelihood or objective
Quantum state tomography	Density matrix $\theta$0	$\theta$1
RM synthesis imaging	$\theta$2	$\theta$3
Poisson image reconstruction	$\theta$4	$\theta$5
Ptychography	$\theta$6 with predicted intensities $\theta$7	$\theta$8 for Poisson–Gaussian noise
Digital holography with speckle	$\theta$9	$X$0
PET with continuous motion	$X$1	$X$2

These examples illustrate that “reconstruction” may mean estimating a probability distribution, a measure, a list of off-grid point sources, or a high-dimensional field. In PET with continuous motion, for example, the object is a nonnegative Radon measure $X$3 on $X$4, motion is encoded by a time-dependent operator $X$5, and list-mode detections are modeled by time-space Poisson point processes (Pouchol et al., 2020). In digital holography with speckle, the likelihood is Gaussian in measurement space but with covariance

$X$6

so the unknown reflectivity appears inside a matrix-valued covariance rather than only through a linear mean (Chen et al., 10 Feb 2026). In algebraic statistics for Gaussian models, the reconstruction variable may even be a concentration matrix $X$7 constrained to lie in a 3-dimensional linear space $X$8, with log-likelihood

$X$9

turning reconstruction into an explicitly geometric problem on reciprocal surfaces of nets of conics (Dye et al., 2020).

This suggests a useful unifying view: maximum likelihood estimation of reconstructions is less about a single algorithm than about a class of estimation problems in which a latent object is defined indirectly through a measurement operator, and the statistical model is imposed in data space rather than object space.

3. Optimization strategies and computational scalability

Because exact closed-form solutions are rare, the quality of a reconstruction is inseparable from the optimization method used to obtain it. Several distinct algorithmic families appear repeatedly.

Expectation–maximization and its variants dominate Poisson models. Classical EMML for $\mu$0 uses the multiplicative update

$\mu$1

preserving positivity by construction (Clerc et al., 13 Feb 2026). The same paper reinterprets EMML as mirror descent with mirror map $\mu$2, which makes it possible to add convex constraints by Bregman projections while keeping the multiplicative structure. A related line of work treats EM as a Kullback proximal point algorithm,

$\mu$3

recovering standard EM when $\mu$4, preserving monotonicity for $\mu$5, and obtaining superlinear convergence when $\mu$6 (Chrétien et al., 2012).

Projected-gradient methods are central in quantum tomography. In density-matrix space, the objective is convex and the feasible set is the quantum state space, so accelerated projected-gradient methods can operate directly on $\mu$7 rather than on factored parameterizations. In one benchmark, an 8-qubit product-Pauli MLE that reportedly took weeks in 2005 “now takes less than a minute” on a standard desktop using APG or CG-APG, while older direct-gradient and factored conjugate-gradient methods stalled far above the true maximum likelihood (Shang et al., 2016). For many-body tomography, the same maximum-likelihood principle can be merged with matrix product state/operator representations, turning the update into an $\mu$8-type iteration followed by tensor-network compression (Baumgratz et al., 2013).

Other settings use maximum likelihood as a refinement stage on top of a heuristic initializer. In RM synthesis imaging, CLEAN or RMCLEAN first constructs a sparse but grid-locked model, and then maximum likelihood refines the continuous Faraday depths $\mu$9, complex amplitudes $D$0, and model order through BIC-guided component merging (Bell et al., 2012). In digital holography with speckle, direct likelihood optimization is obstructed by the cost of repeated inversions of $D$1. PGD-MC avoids explicit matrix inversions by combining conjugate gradient solves for $D$2 with Monte Carlo diagonal estimation for $D$3, making full-resolution MLE practical even with finite apertures (Chen et al., 10 Feb 2026).

A common misconception is that MLE is intrinsically computationally slow. The literature instead shows that apparent slowness is often algorithmic: it arises from suboptimal parameterizations, poor handling of constraints, or unnecessary approximations, rather than from the likelihood principle itself (Shang et al., 2016).

4. Regularization, constraints, and predictive robustness

Maximum likelihood reconstructions are often statistically admissible yet operationally brittle. The clearest example is quantum state tomography. Standard MLE frequently produces rank-deficient density matrices with zero eigenvalues, which can assign probability zero to outcomes that were merely unmeasured, not impossible. For predictive tasks such as gambling, coding, or future measurement prediction, this can lead to catastrophic behavior because $D$4 becomes infinite whenever the estimated support fails to contain the true support (Blume-Kohout, 2010).

Hedged maximum likelihood estimation addresses this by modifying the objective with

$D$5

The resulting estimator is strictly positive, reproduces the classical add-$D$6 rule in the single-basis limit, and satisfies

$D$7

so the gain in predictive robustness is obtained at only a small likelihood cost (Blume-Kohout, 2010).

Constraints can also be incorporated directly rather than through penalties. Constrained EMML alternates the standard multiplicative Poisson step with a Bregman projection

$D$8

allowing simplex and related convex constraints to be enforced while preserving the EMML structure (Clerc et al., 13 Feb 2026). In unsupervised imaging, convex regularizers can themselves be learned by maximum marginal likelihood: the prior is parameterized as

$D$9

the MAP reconstruction is

$\theta$0

and the prior parameters are trained from noisy measurements by maximizing $\theta$1, using the identity

$\theta$2

This links empirical Bayes training directly to classical variational reconstruction (Tan et al., 2024).

Another persistent concern has been the nonconvexity introduced by physical parameterizations. In quantum tomography, parameterizing $\theta$3 as $\theta$4 creates a nonconvex unconstrained problem in the parameters $\theta$5, but when the negative log-likelihood is convex in $\theta$6, all local minima of the parameterized problem are global and correspond to the same density matrix. Practical failures are therefore attributed to numerical issues, not to “wrong” local minima (Gonçalves et al., 2011).

5. Approximated, simulated, and marginal likelihoods

In some reconstruction problems the likelihood is itself unavailable in closed form. The estimation target then becomes a reconstructed likelihood rather than a directly evaluable one.

Approximate maximum likelihood estimation uses simulation when only a generative simulator is available. Given observed summary statistics $\theta$7, the likelihood $\theta$8 is estimated by simulation and kernel density estimation, and the parameter is updated by stochastic approximation using simultaneous perturbation stochastic approximation. The estimator is therefore obtained by climbing a locally reconstructed likelihood surface rather than an analytic one (Bertl et al., 2015).

Maximum approximated likelihood generalizes this perspective to deterministic numerical integration. If the exact likelihood contribution is an integral

$\theta$9

and the approximation $p(D\mid \theta)$0 is obtained by Monte Carlo, quasi-Monte Carlo, Gaussian quadrature, or sparse-grid cubature, then the estimator maximizes

$p(D\mid \theta)$1

Consistency follows when $p(D\mid \theta)$2, and asymptotic normality is recovered when the combined approximation error $p(D\mid \theta)$3 satisfies $p(D\mid \theta)$4 (Griebel et al., 2019). This provides a formal answer to when MLE on a numerically reconstructed likelihood still behaves like exact ML.

A more specialized use of the same idea appears in flow matching. Standard flow matching trains a vector field without integrating its ODE during training, creating a train–inference gap. Fine-tuning via maximum likelihood estimation of reconstructions assumes

$p(D\mid \theta)$5

applies this likelihood to the terminal ODE output $p(D\mid \theta)$6, and shows that for $p(D\mid \theta)$7 maximizing the reconstruction likelihood is equivalent to minimizing

$p(D\mid \theta)$8

The paper proposes both straightforward fine-tuning and residual-based fine-tuning, the latter designed to incorporate contraction properties for robustness and interpretability (Li et al., 2 Oct 2025).

These developments enlarge the notion of “maximum likelihood estimation of reconstructions.” It can refer not only to reconstructing an object by ML, but also to reconstructing the likelihood itself, or to fine-tuning a generative dynamical system by maximizing the likelihood of its reconstructions.

6. Empirical regimes, misconceptions, and limitations

The empirical record is heterogeneous but patterned. In quantum tomography, hedged MLE improves relative entropy, Euclidean distance, and infidelity for most single-qubit states, but “for nearly pure states, MLE does slightly better” and “neither method is optimal” (Blume-Kohout, 2010). In RM synthesis, maximum-likelihood refinement eliminates the dependence on pixelization that plagues CLEAN-based reconstructions; in the two-source tests, average errors under RMCLEAN are reported as “2+ orders of magnitude larger than ML” (Bell et al., 2012). In ptychography, the mixed Poisson–Gaussian loss is reported to outperform the conventional Poisson-only loss under low signal-to-noise conditions, while the methods become nearly indistinguishable at high photon counts (Seifert et al., 2023). In continuous-motion PET, the derived ML-EM algorithm is monotone, convergent in the low-noise regime, and recovers the blur that would appear if movement were ignored (Pouchol et al., 2020).

Several misconceptions recur across fields. One is that making the discretization finer is sufficient; the RM synthesis results explicitly show that “even over-resolving the grid does not cure systematic errors” for multiple sources (Bell et al., 2012). Another is that Gaussian approximations are harmless in high-dimensional quantum tomography; in the 8-qubit example, “82% of the outcomes had zero counts,” making Gaussian-noise methods “demonstrably inapplicable” in that regime (Shang et al., 2016). A third is that plain maximum likelihood is automatically the best predictive estimator; the quantum hedging results show that a slightly less likely full-rank estimator can be much better for predictive tasks (Blume-Kohout, 2010).

The principal limitations are equally consistent. Exact likelihoods may be expensive or unavailable; constraints may be hard to encode; and structurally correct models can still be computationally prohibitive without specialized optimization. Point-source assumptions restrict the RM-synthesis method when diffuse Faraday structure is present (Bell et al., 2012). Convex-prior training by marginal likelihood is heavier than supervised training because it requires dual MCMC chains (Tan et al., 2024). MLE in high-dimensional coherent imaging remains challenging because covariance-dependent likelihoods require repeated linear solves or trace surrogates (Chen et al., 10 Feb 2026).

Taken together, these works portray maximum likelihood estimation of reconstructions as a broad methodological family rather than a single doctrine. Its central strength is the explicit coupling of a physics-based forward model with a statistically specified data term. Its central weakness is that naive implementations can be overconfident, grid-locked, or computationally intractable. The mature forms of the method therefore combine likelihood principles with structural representations, constrained optimization, regularization, or controlled approximation, while remaining anchored in the measurement model itself (Shang et al., 2016, Bell et al., 2012, Blume-Kohout, 2010).