Connecting Score Matching, Maximum Likelihood, and Expectation-Maximization in Mixed Linear Regression

• URL: http://arxiv.org/abs/2609.05688v1
• Date: Fri, 04 Sep 2026 19:52:26 GMT
• Title: Connecting Score Matching, Maximum Likelihood, and Expectation-Maximization in Mixed Linear Regression
• Abstract summary: We study variance-preserving diffusion of the response in mixed linear regression (MLR) with unknown mixing weights.<n>Our analysis separates the statistical guarantees of score matching from the loss geometry and optimization signal at a fixed diffusion noise level.
• Score: 11.223656960922478
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study variance-preserving diffusion of the response in mixed linear regression (MLR) with unknown mixing weights. Our analysis separates the statistical guarantees of score matching from the loss geometry and optimization signal at a fixed diffusion noise level. The KL divergence links the denoising score matching objective integrated over the diffusion path with the likelihood and a terminal discrepancy. Under mild regularity conditions and terminal schedule, the resulting estimator converges up to the ground truth parameters of MLR, and its scaled error converges to the Gaussian limit of the maximum-likelihood estimator. At a fixed scale of the diffusion noise level, we derive a decomposition linking the score matching loss to cross-entropy and Expectation-Maximization (EM) operators. This decomposition yields an EM-related low-noise gradient expansion with additional correction terms of latent variance. In the high-noise limit, we further characterize gradient descent on this limiting loss under isotropic covariance. Along fixed high signal-to-noise ratio rays, the score matching imbalance gradient and the latent-variance term tend to zero pointwise. Numerical experiments illustrate our theoretical findings and statistical guarantees.

Related papers

• Conditional Diffusion for Nonparametric Instrumental Variable Quantile Regression [18.254578337569264]
  This work proposes a two-stage estimator that combines conditional diffusion modeling with a kernel-parametriced conditional moment formulation.<n>We establish an excess-risk bound for the proposed estimator and derive end-to-end total variation guarantees for the conditional diffusion model.<n> Simulation studies and a real-data application demonstrate that the proposed method outperforms existing nonparametric IVQR approaches.
  arXiv  Detail & Related papers  (2026-08-08T16:01:24Z)
• Minimax Optimal Early-Stopped Gradient Descent for Gaussian Mixture Classification [8.717253904965371]
  Training data can be linearly separable even when the underlying distribution is not.<n>We show that early stopping can overcome this suboptimality.<n>A new calibration result converts excess logistic risk into excess zero-one risk.
  arXiv  Detail & Related papers  (2026-08-06T16:41:00Z)
• A Quantitative Approximation Framework for Flow Distillation in Diffusion Models [9.704954388992892]
  Local approximation errors can be strongly amplified in low-noise multimodal regimes.<n>We show that deep residual compositions efficiently approximate the long-horizon transport.<n>Experiments support the prediction and reduce end-to-end relative MSE by up to 51.9% with 8 segments compared with uniform grids.
  arXiv  Detail & Related papers  (2026-06-02T16:00:43Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Variance-Reduced Diffusion Sampling via Target Score Identity [0.0]
  We study variance reduction for score estimation and diffusion-based sampling in settings where the clean (target) score is available or can be approximated.<n>We develop a plug-and-play nonparametric self-normalized importance sampling estimator compatible with standard reverse-time solvers.<n> Experiments on synthetic targets and PDE-governed inverse problems demonstrate improved sample quality for a fixed simulation budget.
  arXiv  Detail & Related papers  (2026-01-04T16:46:31Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Semiparametric conformal prediction [79.6147286161434]
  We construct a conformal prediction set accounting for the joint correlation structure of the vector-valued non-conformity scores.<n>We flexibly estimate the joint cumulative distribution function (CDF) of the scores.<n>Our method yields desired coverage and competitive efficiency on a range of real-world regression problems.
  arXiv  Detail & Related papers  (2024-11-04T14:29:02Z)
• Gradient Normalization Provably Benefits Nonconvex SGD under Heavy-Tailed Noise [60.92029979853314]
  We investigate the roles of gradient normalization and clipping in ensuring the convergence of Gradient Descent (SGD) under heavy-tailed noise. Our work provides the first theoretical evidence demonstrating the benefits of gradient normalization in SGD under heavy-tailed noise. We introduce an accelerated SGD variant incorporating gradient normalization and clipping, further enhancing convergence rates under heavy-tailed noise.
  arXiv  Detail & Related papers  (2024-10-21T22:40:42Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Convergence and concentration properties of constant step-size SGD through Markov chains [0.0]
  We consider the optimization of a smooth and strongly convex objective using constant step-size gradient descent (SGD) We show that, for unbiased gradient estimates with mildly controlled variance, the iteration converges to an invariant distribution in total variation distance. All our results are non-asymptotic and their consequences are discussed through a few applications.
  arXiv  Detail & Related papers  (2023-06-20T12:36:28Z)
• On the Double Descent of Random Features Models Trained with SGD [78.0918823643911]
  We study properties of random features (RF) regression in high dimensions optimized by gradient descent (SGD) We derive precise non-asymptotic error bounds of RF regression under both constant and adaptive step-size SGD setting. We observe the double descent phenomenon both theoretically and empirically.
  arXiv  Detail & Related papers  (2021-10-13T17:47:39Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.