mlsanityData to 14 Oct 2026

Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation

arXiv 2605.08864 ↗First posted 9 May 2026cs.LG math.ST stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

We study online estimation in latent-variable models by recasting the problem as tracking a moving empirical equilibrium. Standard online EM and stochastic approximation analyses primarily study convergence toward the population parameter and typically do not isolate the empirical batch optimum from the online tracking error at finite horizon. Our framework decomposes the online estimate into the frozen batch equilibrium at the current running statistic and a tracking lag that captures the algorithm's delay behind this moving target. We prove a batch-to-online transfer theorem: provided lVert eT rVert_L2 = o(T-1/2), the online estimator inherits the batch central limit theorem and the sharp first-order risk constant. Our key observation is that the empirical optimum evolves on a smooth equilibrium manifold indexed by the running statistic. An m-th order equilibrium-jet predictor combined with an order-nu frozen corrector yields localized tracking rates O(T-nu(m+1)). We formalize EM-compressibility and EM-jetR-compressibility as the structural conditions that make the equilibrium response and the Newton corrector evaluable from a retained streaming statistic. The theory is instantiated in latent linear Gaussian covariance estimation, where the first-order scheme operates on a compressed d × d statistic with explicit finite-sample risk envelopes and a certified restart rule.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 43 references that are in the map. First posted on arXiv 9 May 2026.

Builds on

4 of 43 references.

References · 4

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  2. 2016Statistical Inference for Model Parameters in Stochastic Gradient Descentcited by 71
  3. 2020Time-Varying Convex Optimization: Time-Structured Algorithms and Applicationscited by 31
  4. 2015A Class of Prediction-Correction Methods for Time-Varying Convex Optimizationcited by 16

Built on by

Not cited yet.