Local linear convergence of gradient methods for overparameterized Gaussian mixtures


Abstract

We study the problem of learning Gaussian mixture models under overparameterization. Prior work has shown that while overparameterization is essential for avoiding spurious local optima and enables global recovery of the ground-truth model using the gradient-EM (expectation-maximization) algorithm, it can dramatically slow down the local rate of convergence. Under certain assumptions on the mixture weights, we show that a standard divergence measure minimized by statistical learning procedures possesses a manifold of slow growth on which the well-known Polyak stepsize reduces the loss geometrically, and design a gradient-based method that converges to minimizers at a locally linear rate. Additionally, we show that our method converges to nearly optimal solutions — up to a natural misspecification threshold — for mixtures with arbitrary weights. At a high level, the method alternates between several “short” gradient descent steps that approach the manifold and “long” Polyak steps that contract the distance to minimizers. Our results suggest that slow convergence is not an intrinsic challenge of overparameterization, but can be overcome by exploiting the favorable structure of the loss landscape.

1 ↩︎

1.0.1 Introduction↩︎

Gaussian mixture models (GMMs) are canonical latent variable models with a long history in statistics and machine learning, dating back to the work of Pearson in the late \(\text{19}^{\text{th}}\) century. This framework posits that the unknown target distribution \(p^{\star}\) is a mixture of \(m\) Gaussian distributions (for simplicity, in this paper we consider isotropic Gaussians with identity covariance): \[p^{\star} = \sum_{i = 1}^{m} \pi_{i}^{\star} \phi(\cdot \mid \mu_{i}^\star) , \;\; {\pi^{\star}} \geq 0, \; \sum_{i = 1}^{m} \pi^{\star}_{i} = 1, \;\; \text{where} \;\; \phi(x \mid \mu) := \frac{1}{(2 \pi)^{d/2}} e^{-\frac{\norm{x - \mu}^2}{2}}. \label{eq:gaussian-mixture-intro}\tag{1}\] Given samples from \(p^{\star}\), the weights \(\pi^{\star} \in \mathbb{R}^m\) and parameters \(\mu_{i}^{\star}\in \mathbb{R}^d\) are often estimated via an iterative procedure known as the Expectation-Maximization (EM) algorithm [1] and its gradient-based variants, which aim to minimize the Kullback-Leibler (KL) divergence between the mixture and the unknown \(p^{\star}\). Classical analyses on both population and sample-based EM show that EM enjoys local linear convergence under suitable regularity conditions [2], [3], such as well-separated components and a correctly specified number of components.

However, recent work has revealed a fundamental limitation of this classical perspective: if we learn the \(m\)-component distribution by optimizing over an \(n\)-component model (with variables \(\pi_i\) and \(\mu_i\)), \[p_{\mu, \pi} = \sum_{i = 1}^{n} \pi_{i} \phi(\cdot \mid \mu_{i}), \;\; \pi \geq 0, \; \sum_{i} \pi_i = 1, \label{eq:student-mixture-intro}\tag{2}\] then when the model is exactly parameterized (\(n=m\)), the KL divergence landscape can contain spurious local optima, and gradient-based methods fail to recover the ground-truth mixture; specifically, negative results for \(m>2\) are shown in [4]. In contrast, a growing line of work shows that overparameterization—fitting a model with more components than the ground truth; i.e., \(n>m\)—is essential for global convergence [5], [6]. In this regime, under a separation condition, gradient-EM dynamics provably recover the ground-truth GMM from a random initialization: each ground-truth component is captured by a cluster of fitted components, while redundant components are automatically pruned [6].

This raises a natural question: if overparameterization is necessary for global recovery, what are its optimization consequences? A key challenge is that overparameterization fundamentally alters the local geometry of the loss. Near a solution, multiple fitted components may represent a single ground-truth component, leading to a singular Fisher Information Matrix (FIM) and flat directions in the loss landscape, which translates to slow convergence rates near solutions [7]. As a result, standard gradient-based methods exhibit sublinear convergence rates in the local phase [5], [6], even after the global structure of the mixture has been correctly identified. A key question is whether this significant slowdown is unavoidable. We show that this is not the case, by designing and analyzing geometry-aware gradient-based methods that achieve the statistical recovery benefits and favorable (linear) convergence rates simultaneously.

1.0.1.1 Our contributions

The works [5], [6] outline two phases of convergence for the population gradient EM algorithm: a global phase, which drives the loss below a prescribed threshold, and a local phase where all non-redundant student means converge to the nearest teacher mean. In particular, both works show that the KL divergence between \(p^{\star}\) and \(p_{\mu, \pi}\), which we denote by \(\dkl{p^{\star}}{p_{\mu, \pi}}\), satisfies the celebrated Łojasiewicz inequality [8] near solutions: \[\begin{align} \norm{\grad_{\mu} \dkl{p^{\star}}{p_{\mu, \pi}}} \gtrsim (\dkl{p^{\star}}{p_{\mu, \pi}})^{\theta}, \;\; \text{for some \theta \in (0, 1).} \label{eq:lojasiewicz-inequality} \end{align}\tag{3}\] For \(\theta = \frac{1}{2}\), the condition 3 is known as the Polyak-Łojasiewicz inequality [9], leading to local linear convergence of gradient methods [10]. The exponent \(\theta\) is nonstandard and different from \(\frac{1}{2}\) for gradient EM. Indeed, the singularity of the FIM suggests that standard gradient methods should not achieve linear convergence rates, even in the case \(n > m = 1\) where the student weights \(\pi_{i}\) can be assigned arbitrarily. In this work, we ask:

Figure 1: image.

We answer this question affirmatively by designing a two-stage gradient-based algorithm that leverages the landscape of the KL loss (as a function of the student means \(\mu_{i}\)) near minimizers. We show that once the global phase succeeds, the local slowdown due to overparameterization is not intrinsic and can be removed. Our algorithm converges at a nearly linear rate to a collection of student means \(\set{\widetilde{\mu}_i}_{i=1}^n\) that are optimal up to a natural misspecification threshold: \[\dkl{p^{\star}}{p_{\widetilde{\mu}, \pi}} \lesssim \Delta_{\pi}^2, \quad \text{where} \quad \Delta_{\pi} := \max_{\ell = 1, \dots, m} \set*{ \frac{\abs[\big]{(\sum_{j: \text{\mu_j is near \mu_{\ell}^{\star}}} \pi_{j}) - \pi_{\ell}^{\star}}}{\pi_{\ell}^{\star}} }. \label{eq:mismatch-high-level}\tag{4}\] Thus the parameters \(\widetilde{\pi}_i\) are nearly optimal up to a threshold that depends on the worst-case mismatch between the weight of the \(\ell^{\text{th}}\) teacher component, \(\pi_{\star}^{\ell}\), and the aggregate weight of the cluster of students concentrating around \(\mu_{\ell}^{\star}\). In the stylized setting of [5] where the teacher density is Gaussian, we have \(\Delta_{\pi} = 0\). Consequently, our method converges at a nearly linear rate to the unique solution \(\widetilde{\mu}_1 = \dots = \widetilde{\mu}_n = 0\) — an exponential improvement over prior work. More generally, our algorithm alternates between updates to student weights and student means using the methodology in [6], gradually driving \(\Delta_{\pi}\) towards \(0\). 2 demonstrates the typical behavior of our algorithm on an instance with \(\Delta_{\pi} = 0\), comparing it with the gradient EM method. As the plots illustrate, the latter settles into a sublinear rate of convergence; in contrast, our algorithm reduces both the KL loss \(\dkl{p^{\star}}{p_{\mu, \pi}}\) and a natural measure of parameter distance at a nearly linear rate. In summary, our contributions include:

(i) A geometric characterization of the slowdown (ravine structure) and decomposition of error;

(ii) Local acceleration via a geometry-aware first-order method;

(iii) Robustness to weight mismatch via perturbation analysis.

Taken together, our results provide a unified picture: overparameterization is globally beneficial (enabling recovery), but locally singular (inducing flat directions). We show that these two effects can be reconciled by exploiting the induced geometric structure, yielding fast convergence in the local phase without sacrificing the benefits of overparameterization.

Figure 2: Local acceleration for loss and parameter distance. The square markers indicate iterates obtained with Polyak steps, which are interleaved with several steps of gradient descent. In this instance, we have dimension d = 5, m = 3 teacher components, and n = 20 student components.
1.0.1.1.0.1 Notation and basic constructions.

We keep only the notation needed for the main text here; additional notation and standing assumptions are listed in Appendix 2.0.1.1. Throughout, \(\norm{\cdot}\) denotes the Euclidean norm, \([k]:=\set{1,\ldots,k}\), and \(\Delta^{n-1}\) denotes the probability simplex. We write \(a\lesssim b\) to hide constants depending only on fixed model parameters and write \(a \asymp b\) when \(a \lesssim b\) and \(b \lesssim a\) simultaneously. We work under the standard nondegeneracy, boundedness, and separation assumptions used in [6]; for completeness, we list these in 1 in the Appendix.

Given a set \(\mathcal{X} \subset \Rbb^d\), we write \(\dist_{\mathcal{X}}\) and \(\proj_{\mathcal{X}}\) for its distance function and projection map: \[\dist_{\mathcal{X}}(x) = \inf_{y \in \mathcal{X}} \norm{x - y}, \qquad \proj_{\mathcal{X}}(x) = \argmin_{y \in \mathcal{X}} \norm{x - y}. \label{eq:distance-and-projection}\tag{5}\]

Given a mean vector \(\mu \in \mathbb{R}^{nd}\) partitioned into \(\pmx{\mu_1^{\T} & \dots & \mu_{n}^{\T}}^{\T}\) with \(\mu_{i} \in \mathbb{R}^d\), and corresponding mixture weights \(\pi = \pmx{\pi_1 & \dots & \pi_{n}}^{\T} \in \Delta^{n-1}\), we denote the mixture density by \(p_{\mu, \pi}\), as defined in equation 2 . Writing \(\theta = (\mu, \pi)\) for the complete parameterization of the mixture, we let \[\psi_{i}(x; \theta) := \frac{\pi_{i} \phi(x \mid \mu_{i})}{\sum_{j = 1}^n \pi_{j} \phi(x \mid \mu_{j})}, \quad \set{\psi_{i}(x; \theta)}_{i=1}^{n} \in \Delta^{n-1} \label{eq:responsibilities}\tag{6}\] denote the so-called responsibility of the \(i^{\text{th}}\) mixture component. We also write \(\mathcal{L}(\theta)\) for the population KL loss between \(p^{\star}\) and \(p_{\mu, \pi}\), with \(\theta = (\mu, \pi)\): \[\mathcal{L}(\theta) := \dkl{p^{\star}}{p_{\mu, \pi}} := \mathbb{E}_{X \sim p^{\star}}\Big[\log\Big(\frac{p^{\star}(X)}{p_{\mu,\pi}(X)}\Big)\Big]. \label{eq:kl-loss}\tag{7}\]

We also record a basic fact about \(C^{2}\) manifolds that we use throughout our proofs.

Fact 1 (Local expansion). Let \(\mathcal{M}\) be a \(C^{2}\) manifold and fix \(\bar{x} \in \mathcal{M}\). We have that \[\label{eq:local-C2-expansion} x - \bar{x} \in \mathcal{T}_{\mathcal{M}}(\bar{x}) + O(\norm{x - \bar{x}}^2), \;\; \text{for all x \in \mathcal{M} near \bar{x}.}\qquad{(1)}\]

a
b

Figure 3: Loss landscape for the example in 8 . 3 (a): the KL landscape is steep across the tangent space and flat along it. 3 (b): the loss grows quadratically along the normal direction and quartically along the tangent direction. Our algorithm alternates gradient descent steps, which lead towards the ravine, with Polyak steps near the ravine to reduce the loss.. a — KL loss landscape, b — Loss along tangent and normal directions

1.0.2 Related work↩︎

1.0.2.0.0.1 EM and gradient EM for Gaussian mixtures.

EM and gradient EM for Gaussian mixtures have been studied extensively, from classical convergence theory to modern population and finite-sample analyses [1], [2], [11]. Global convergence guarantees have been proved for two-component mixtures, while general multi-component mixtures allow only local analyses under separation assumptions [12][17]. In contrast, exact-parameterized mixtures with three or more components can have bad local optima [4], motivating the recent study of over-parameterized gradient EM. The works by [5] and [6] are most closely related to our work. The first paper, addressing the simplest setting where \(p^{\star} \sim \mathcal{N}(0, I_{d})\), shows that the gradient EM algorithm converges (at a sublinear rate) from any initialization. The second paper [6] extends this result to well-separated, multi-component Gaussian mixtures under mild overparameterization. Our work shows how to significantly accelerate the “local” phase of convergence in the setting of [6], by identifying and exploiting favorable geometry.

1.0.2.0.0.2 Overparameterization, slowdown, and pruning.

Overparameterization has emerged as a central feature of modern learning systems, with both statistical and algorithmic consequences. On the one hand, it enables interpolation without overfitting in classical settings [18] and underlies the double descent phenomenon [19], [20]. On the other hand, it can substantially alter optimization dynamics, even leading to provably slower convergence of gradient-based methods [21], where the rate slows down from exponential to polynomial \(O(T^{-3})\).

Overparameterization creates singular or weakly identifiable directions, leading to slow learning dynamics [7], [22] for the EM algorithm. Related work on overspecified mixtures studies identifiability, redundant components, and vanishing weights [23], [24]. In the gradient-EM setting, [5], [6] show that while overparameterization is essential for global convergence, it also leads to slow optimization dynamics near solutions. We focus on the local difficulty: even after identification or pruning, a teacher may still be represented by multiple active students, producing flat directions that standard gradient descent traverses slowly.

1.0.2.0.0.3 Loss landscapes and manifold identification.

The algorithm proposed in this paper is grounded in a long line of work on exploiting favorable structure in optimization problems, including Wright’s work on identifiable surfaces [25], the partial smoothness framework of [26], and the closely related \(\mathcal{V}\mathcal{U}\)-framework of [27]. The main message from these works is that general optimization problems admit distinguished geometric structures which behave “favorably”; moreover, simple gradient-based methods tend to accelerate once they identify these structures [28][33]. The structure identified in [34], which underpins our main results, differs from these results in the sense that the manifold actually slows down gradient-based methods. Our analysis complements recent work studying local minima in general Gaussian mixtures [35], which does not show how to leverage the local loss landscape to achieve acceleration.

1.0.3 Main results↩︎

We present an overview of our main results, which can be roughly divided into two parts:

1.0.3.0.0.1 Ravine geometry.

First, we study the loss landscape near minimizers under the assumption that student clusters concentrating around teacher components have the same aggregate weights as the corresponding teachers. We show that the KL loss admits an algorithmically exploitable decomposition relative to a manifold of slow growth, named the ravine in recent work by [34], and propose an algorithm that contracts the distance to the optimal means at a linear rate.

1.0.3.0.0.2 Convergence on arbitrary mixtures.

Second, we use a careful trajectory analysis to show that our algorithm behaves nearly identically (up to a weight-mismatch-dependent perturbation) under small mismatches between the aggregate weights of student clusters and their nearest teacher means—a setting that corresponds to the “local identifiability” phase analyzed in [6].

1.0.3.1 Overparameterization, slowdown and acceleration

Before we present our results in full generality, we consider a simple warm-up example that illustrates how overparameterization slows down gradient methods, while simultaneously revealing the key mechanism behind our acceleration method, in a geometrically transparent way. Let \[p^{\star} = \mathcal{N}(0, I_d), \;\; \text{and} \;\; p_{\mu} = \frac{1}{2} \mathcal{N}(\mu_1, I_d) + \frac{1}{2} \mathcal{N}(\mu_2, I_d). \label{eq:simple-example-2-student-intro}\tag{8}\] Clearly, the optimal student model has \(\mu_{1} = \mu_{2} = 0\). A routine calculation shows that \[\grad_{\mu\mu}^2 \dkl{p^{\star}}{p_{\mu}}|_{\mu = (0, 0)} = \frac{1}{4} \begin{bmatrix} 1 & 1 \\ 1 & 1 \end{bmatrix},\] matching our intuition that the Hessian at the optimal solution is rank-deficient; its kernel is spanned by the vector \((1, -1)\). Indeed, the KL loss grows quadratically along the “normal” direction \((1, 1)\), while it grows much slower (at a quartic rate) along the “tangent” direction \((1, -1)\), slowing down gradient descent steps; see Figure 3 for an illustration.

In order to effectively deal with “slow” directions for gradient descent, we turn to the model problem \(f(x, y) := x^{2} + y^{4}\), mimicking the KL loss near \((\mu_1, \mu_2) = 0\). When \(x = 0\), a single step of gradient descent using the well-known Polyak stepsize [36] leads to \[(x_+, y_+) = (x, y) - \frac{f(x, y) - f^{\star}}{\norm{\grad f(x, y)}^2} \cdot \grad f(x, y) = \big(0, {3y}/{4}\big).\] In other words, the gradient method equipped with the Polyak stepsize contracts the distance to \((x^{\star}, y^{\star}) = (0, 0)\) geometrically. Indeed, the work of [34] suggests that several optimization problems whose objectives grow quartically away from minimizers possess a manifold of slow growth — called the ravine — that contains the set of minimizers and satisfies the following properties: (i) the objective function behaves like a pure quartic, \(x \mapsto \norm{x}^4\) along the ravine; and (ii) gradient descent with constant stepsize approaches the ravine at a geometric rate.

Building on the above, [34] design an algorithm, dubbed GDPolyak, that repeatedly interleaves several gradient descent steps (approaching the ravine) with a single Polyak step (reducing the objective function geometrically); one epoch of the \(\texttt{GDPolyak}\) method for an arbitrary loss \(f: \mathbb{R}^d \to \mathbb{R}\) (with \(f_{\textrm{lb}} \leq \min f\)) initialized at \(x\) implements the following steps: \[\tagsleft@true\let\veqno\@@leqno (f, f_{\textrm{lb}}, x, \eta, K)} \boxed{ \begin{align} y^{(0)} & := x - \frac{f(x) - f_{\textrm{lb}}}{\norm{\grad f(x)}^2} \grad f(x); \\ y^{(i+1)} & := y^{(i)} - \eta \cdot \grad f(y^{(i)}), \quad \text{for i = 0, \dots, K-1.} \end{align} } \label{eq:gdpolyak-epoch}\tag{9}\]

1.0.3.2 From single-teacher to arbitrary GMMs

The results of [34] suggest that a ravine exists for any loss with isolated solutions that grows locally quartically away from its minimizers, and it tangent to the nullspace of the Hessian at optimal solutions. In the single-teacher setting of [5], the solution is unique and the KL loss 7 satisfies quartic growth: indeed, we show that (see Prop. 11 for a precise statement): \[\label{eq:single-teacher-quartic-growth-intro} \mathcal{L}(\mu) \gtrsim \Bigl( \pi_{\min} \sum_{i = 1}^{n} \norm{\mu_{i} - \mu^{\star}}^2 \Bigr)^2, \quad \text{where} \;\; \pi_{\min} := \min_{i = 1, \dots, n} \pi_{i}.\tag{10}\] To understand the KL loss geometry for arbitrary mixtures, we first pass to an idealized setting where every teacher component is represented by a cluster of students whose aggregate weight matches the corresponding teacher weight. Such configurations arise during the local convergence phase of gradient EM [6] near minimizers \({\theta}^{\star} = (\widetilde{\mu}, \pi)\) that induce partitions of the following form (cf. 1): \[[n]= \bigsqcup_{\ell=1}^m S_\ell, \quad \widetilde{\mu}_i = \mu_{\ell}^\star, \;\; \text{for i \in S_\ell}, \;\; \text{with} \;\; \sum_{i \in S_\ell}\pi_i=\pi_\ell^\star. \label{eq:partition}\tag{11}\] Our main result in this section characterizes the Hessian (for fixed \(\pi\)) at optimal solutions and shows that the loss indeed admits a ravine. Inspecting the Hessian nullspace, we find that the “slow growth” directions are precisely those along which student cluster means remain unchanged.

Theorem 1 (Ravine geometry of clustered loss (informal); see 8). Fix a minimizer \(\theta^{\star}\) inducing a partition 11 . The Hessian of the KL loss at \(\theta^{\star}\) satisfies \[\ker(\grad^2_{\mu\mu} \mathcal{L}(\theta^{\star})) = \set{ u \in \mathbb{R}^{nd} \mid \sum\limits_{i \in S_{\ell}} \pi_{i} u_{i} = 0, \; \text{for all \ell \in [m]} }. \label{eq:hessian-at-reference-optimum}\tag{12}\] Moreover, define the aggregate cluster weights and corresponding cluster means as \[\widehat{\pi}_{\ell} := \sum_{i \in S_{\ell}} \pi_{i}, \quad \bar{\mu}_{\ell} := \frac{1}{\widehat{\pi}_{\ell}} \sum_{i \in S_{\ell}} \pi_{i} \mu_{i}. \label{eq:cluster-weights-and-means}\tag{13}\] Then, near the optimal solution \(\theta^{\star}\), the KL loss satisfies quartic growth via the decomposition \[\sqrt{\mathcal{L}(\mu, \pi)} \gtrsim \sum_{\ell=1}^m \sum_{i\in S_\ell} \pi_i \norm{\mu_i-\mu_\ell^\star}^2 = \underbrace{ \sum_{\ell=1}^m\widehat\pi_\ell \norm{ \bar{\mu}_{\ell} - \mu_{\ell}^{\star} }^2 }_{\text{cluster bias}} + \underbrace{ \sum_{\ell=1}^m\sum_{i\in S_\ell} \pi_{i} \norm{ \mu_{i} - \bar{\mu}_{\ell} }^2 }_{\text{intra-cluster dispersion}}. \label{eq:bias-dispersion-informal}\tag{14}\]

Remark 2 (Local convergence). The above theorem implies that the KL loss has fourth-order growth near the (isolated) minimizer \(\theta^{\star}\). Therefore, the \(\texttt{GDPolyak}\) method of [34] applied to \(\mathcal{L}(\mu)\) converges locally nearly-linearly to \(\theta^{\star}\).

1.0.3.3 Trajectory analysis under weight mismatch

The condition 11 may not hold in practice. Aggregate weights of clusters could only approximately match the corresponding teacher weights; similarly, student mixtures may include redundant components. Therefore, our forthcoming analysis focuses on the “local” phase of gradient EM [6], where weight mismatches are sufficiently small and redundant student components can be pruned via simple thresholding. We develop a perturbative analysis that relates the trajectory of \(\texttt{GDPolyak}\) for the actual objective \(\mathcal{L}(\mu, \pi)\) to its trajectory on a “reference” objective \(\mathcal{L}(\mu, \bar{\pi})\), suitably reweighted so that 11 takes hold for its minimizers.

To state our results, we need some notation. We define the cluster weight mismatch: \[\Delta_\pi := \max_{\ell\in[m]} \frac{\abs[\big]{\sum_{i\in S_\ell}\pi_i-\pi_\ell^\star}}{\pi_\ell^\star}.\] Moreover, we define the reference weights \(\bar{\pi}_i := \pi_{i} \pi_{\ell}^{\star} / \widehat{\pi}_{\ell}\) for each \(i \in S_{\ell}\). Clearly, \(\Delta_{\bar{\pi}} = 0\).

Lemma 1 (Perturbed loss (informal); see 12). Suppose that \(\min_{i} \pi_{i} > 0\) and that \(\mathcal{L}(\mu, \pi)\) is sufficiently small. Then, for every \(\mu\) on a compact neighborhood \(U\) of \(\mu^{\star}\), it holds that \[\abs{\mathcal{L}(\mu,\pi) - \mathcal{L}(\mu,\bar\pi)}, \;\; \norm{\grad_{\mu} \mathcal{L}(\mu, \pi) - \grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}, \;\; \opnorm{ \grad_{\mu\mu}^2 \mathcal{L}(\mu,\pi) - \grad_{\mu\mu}^2 \mathcal{L}(\mu,\bar\pi) } \lesssim \Delta_{\pi}.\] Moreover, the function value at the minimizer of the perturbed loss satisfies \[\min_{\mu \in U} \mathcal{L}(\mu,\pi) - {\mathcal{L}}^\star \lesssim \Delta_\pi^2. \label{eq:perturbed-loss-at-optimum}\tag{15}\]

The reference weights \(\bar\pi\) preserve the relative weights within each cluster but adjust the cluster aggregate weights. Consequently, \(\mathcal{L}(\mu,\bar\pi)\) satisfies the conditions of 1, whence it possesses a ravine. In what follows, we let \(\mathcal{M}\) denote the ravine of the reference objective.

Theorem 3 (Contraction of Polyak step (informal); see 14). Suppose that the assumptions of 1 hold and that \(\mu\) satisfies the following condition: \[\max\set*{ \dist_{\mathcal{M}}(\mu), \Delta_{\pi} } \lesssim \left( \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \norm{\mu_{i} - \bar{\mu}_{\ell}}^2 \right)^{3/2}. \label{eq:in-annulus-informal}\tag{16}\] Then, the point \(\mu^{+} := \mu - \frac{\mathcal{L}(\mu, \pi)}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} \grad \mathcal{L}(\mu, \pi)\) satisfies one of the following conditions:

(i) \(\norm{P_{\mathcal{M}}(\mu^{+}) - \mu^{\star}} \lesssim \Delta_{\pi}^{1/3}\); or

(ii) \(\norm{P_{\mathcal{M}}(\mu^{+}) - \mu^{\star}} \leq (1 - \gamma) \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}}, \; \text{for some \gamma \in (0, 1).}\)

1.0.3.3.0.1 Proof sketch.

Our proof separates the neighborhood of the minimizer into three regions: (i) a tube \(\mathcal{T}\) around the manifold \(\mathcal{M}\), where \(\dist_{\mathcal{M}}(\mu)\) is small relative to the distance to minimizers; (ii) a “core” region \(\mathcal{C}\), where \(\Delta_{\pi}\) dominates the dispersion term from 1; and (iii) an annulus \(\mathcal{A} := \mathcal{T} \setminus \mathcal{C}\), wherein Polyak steps make algorithmic progress. We then show (see 4):

  1. Starting from \(\mathcal{A}\), the projection of a single Polyak step onto the manifold either reduces the distance to \(\mu^{\star}\) geometrically or already falls into \(\mathcal{C}\) (14).

  2. The Polyak iterate can escape \(\mathcal{A}\); in that case, a few steps of gradient descent with sufficiently small stepsize restore proximity to the manifold (12).

  3. Finally, we show that the gradient descent trajectory cannot undo the progress towards \(\mu^{\star}\) achieved by the Polyak step (7).

To prove the above results for the general loss \(\mathcal{L}(\mu, \pi)\), we show that they hold for the “reference” loss \(\mathcal{L}(\mu, \bar{\pi})\) and establish a stronger version of the perturbation estimates in 10, using 12 as a boostrap. This allows us to directly relate the progress achieved by a single Polyak step on the two different objective functions (11).

Figure 4: Illustration of algorithmic behavior. The Polyak step, \mu^{+}, makes significant progress towards \mu^{\star} along the ravine \mathcal{M} but can escape the tube surrounding it. A few “short steps” of gradient descent rapidly restore proximity to \mathcal{M}, wherein a new Polyak step can be attempted.

1.0.4 Implementation and numerical study↩︎

In this section, we formally describe our two phase method (5) and conduct a numerical study to validate our theoretical predictions and demonstrate the local acceleration mechanism. While our theory covers the population gradient EM setting, our experiments use a large fixed batch of \(N = 10^{7}\) samples to approximate all quantities, treating the empirical dynamics as a finite-sample perturbation of population-level behavior [11]. Each experiment took less than five minutes on a single NVIDIA L40S GPU node with 48GB memory.

Figure 5: Phase-switching \texttt{GDPolyak}

Weight updates. Following [6], we update weights by approximately solving the convex subproblem \(\argmin_{\pi \in \Delta^{n-1}} \mathcal{L}(\mu^{(t)}, \pi)\). We employ the standard EM weight update, which can be viewed as the fixed-point iteration on the KKT system, as the minimization oracle: \[\pi_{i}^{+} \gets \frac{1}{N} \sum_{k = 1}^{N} \frac{\pi_{i} \phi(X_{k} \mid \mu_{i}^{(t)})}{ \sum_{j = 1}^{n} \pi_{j} \phi(X_{k} \mid \mu_{j}^{(t)}) }. \label{eq:weight-update-em}\tag{17}\] We found that \(10\) steps of 17 were sufficient for stable performance in our experiments.

1.0.4.0.0.1 Experiment: acceleration with exact clustering.

In our first experiment, we demonstrate the slowdown of gradient EM and the acceleration achieved by our method on an instance with \(m = 3\) teachers with \(\pi^{\star} = (0.35, 0.35, 0.3)\), \(n = 20\) students with \(\pi_i = \tfrac{1}{20}\) for all \(i\), and ambient dimension \(d = 5\); we initialize the student means artificially close to \(\mu^{\star}\) so that 11 is satisfied. We compare the fixed-weight gradient EM method with \(\texttt{GDPolyak}\), using one Polyak step every \(20\) gradient EM steps, and terminate both methods upon reaching a target KL loss of \(\varepsilon = 10^{-6}\). The results are illustrated in 6; we find that the intra-cluster dispersion term drives the slowdown of gradient EM, but is reduced sharply by the interleaved Polyak steps, as prescribed by our convergence analysis.

Figure 6: Experiment on an instance with \Delta_{\pi} = 0. Gradient EM struggles to reduce the intra-cluster dispersion, which contributes the majority of the loss near minimizers. Polyak steps (indicated by square marks) sharply reduce the dispersion, but slightly increase the cluster bias due to leaving the vicinity of the ravine; interleaved gradient descent steps restore proximity to the manifold.
1.0.4.0.0.2 Experiment: acceleration with arbitrary mixtures.

We turn to an experiment under a more realistic setting where we update both means and mixture weights. We maintain the previous setup but now sample \({\mu_i}^{(0)}\) from \(p^{\star}\), and compare gradient EM with 5 using \(\varepsilon_{\text{id}} = 10^{-3}\); the results are shown in 7, where the “freeze” threshold is indicated by a vertical line. Again, we find that Polyak steps are essential for reducing the dispersion and achieving local linear convergence.

Figure 7: Experiment with general mixtures. Both methods are initialized identically; as in 6, gradient EM struggles to decrease the dispersion term, in contrast with \texttt{GDPolyak}. The vertical dashed line marks the iteration upon which 5 enters its second phase.
1.0.4.0.0.3 Experiment: effect of cluster weight mismatch.

We probe the effect of the mismatch \(\Delta_{\pi}\) on the accuracy of the proposed method, as well as the acceleration mechanism itself. We introduce a controlled mismatch \(\Delta_{\pi} \in \set{10^{-1}, 10^{-2}, \dots, 10^{-4}}\) by perturbing the teacher weights from the setup of 6, freeze student weights, and optimize the means using \(\texttt{GDPolyak}\). Plotting the results in 8, we observe that smaller \(\Delta_{\pi}\) lead to similar geometric contraction factors for \(\texttt{GDPolyak}\), while larger mismatches can interfere with acceleration. All configurations induce a visible loss “barrier” proportional to the prediction \(\Delta_{\pi}^2\) (cf. 1).

Figure 8: Effect of weight mismatch \Delta_{\pi} on acceleration. ([fig:subfig:loss-by-mismatch]): small \Delta_{\pi} maintain the contraction rate and final loss essentially unaffected, while larger \Delta_{\pi} stall at higher loss floors. ([fig:subfig:gradient-em-mismatch-reduction]): gradient EM rapidly reduces \Delta_{\pi}, which stabilizes within less than 15 iterations.
1.0.4.0.0.4 Experiment: model remains overparameterized.

Our last experiments examines whether gradient EM can prune the student model down to a “minimal” parameterization with \(m\) active student components. We sample a mixture with \(m = 3\) teachers and fit a student mixture with \(n = 20\) components using 50 iterations of gradient EM over several trials in dimension \(d \in \set{2,5,10}\); we count the number of active student components, defined as satisfying \(\pi_{i} > \tfrac{1}{100}\). 9 shows the number of active components is typically larger than \(m=3\), especially in low dimensions.

Figure 9: Active components after 50 iterations of gradient EM for a student with n=20 components and a teacher with m = 3 components. The histogram suggests that pruning can remove redundant student components, but does not completely eliminate overparameterization.

Discussion and future work

We introduced a locally accelerated method for learning overparameterized GMMs, leveraging the ravine geometry of the loss landscape near minimizers. Our work leaves open several exciting research directions, such as: (i) extending our guarantees to the finite-sample setting; (ii) obtaining precise quantitative estimates of the neighborhood of local acceleration; and (iii) analyzing a practical variant of 5 that does not artificially separate the local stage by freezing the student weights.

1.0.4.0.0.5 Acknowledgements.

The authors are grateful to Liwei Jiang, Mo Zhou and Weihang Xu for useful discussions. The work of VC was supported in part by grants from the NSF (DMS-2235451) and Simons Foundation (MP-TMPS-00005320) to the NSF-Simons National Institute for Theory and Mathematics in Biology (NITMB). The work of MF was supported in part by awards NSF TRIPODS II 2023166, NSF CCF 2212261, NSF CCF 2312775, and by the Moorthy Family professorship at UW.

2 Appendix↩︎

2.0.1 Background↩︎

2.0.1.1 Notation and standing assumptions

In this section we record additional notation used in the appendix.

We write \(\ip{x, y} = \tr(x^{\T} y)\) for the Euclidean inner product and \(\norm{x} = \sqrt{\ip{x, x}}\) for the induced norm. We write \(\mathbb{S}^{d-1}\) for the unit sphere in \(d\) dimensions and \(\Delta^{n-1}\) for the probability simplex in \(n\) dimensions. We let \(\opnorm{A} := \sup_{x \in \mathbb{S}^{n-1}} \norm{Ax}\) denote the \(\ell_2 \to \ell_2\) operator norm of a matrix \(A \in \mathbb{R}^{m \times n}\), and write \(A \otimes B\) for the Kronecker product between matrices \(A\) and \(B\). Finally, we write \([k]\) for the set \(\set{1, \dots, k}\) and use the notation \(\mathcal{S} = \bigsqcup_{j} \mathcal{S}_j\) to indicate a union of disjoint sets: \(\mathcal{S} = \bigcup_{j} \mathcal{S}_j\) with \(\mathcal{S}_{j} \cap \mathcal{S}_{k} = \emptyset\).

Following [6], we make the following assumptions about \(p^{\star}\).

Assumption 1 (Teacher mixture). The ground-truth density \(p^{\star} = p_{\mu^{\star}, \pi^{\star}}\) is parameterized by \(\mu^{\star} = ({\mu^{\star}_1}^{\T}, \dots, {\mu_{m}^{\star}}^{\T})^{\T} \in \mathbb{R}^{md}\) and \(\pi^{\star} = (\pi_1^{\star}, \dots, \pi_{m}^{\star})^{\T} \in \Delta^{m-1}\) satisfying:

(A1)

(Nondegeneracy). Let \(M^{\star} := \sum_{i = 1}^m \pi_{i}^{\star} \mu_{i}^{\star} {\mu_{i}^{\star}}^{\T}\). There exist \(\lambda_{\max}, \lambda_{\min} \geq 0\) such that

\[0 < \lambda_{\min} = \lambda_{m}(M^{\star}) \leq \lambda_{1}(M^{\star}) = \lambda_{\max},\]

where \(\lambda_{1}(M^{\star}) \geq \dots \geq \lambda_{m}(M^{\star})\) are the nonzero eigenvalues of \(M^{\star}\).

(A2)

(Boundedness). The components of \(\mu^{\star}\) satisfy \[D_{\max} \geq \norm{\mu_{i}^{\star}} \geq D_{\min} \geq 4 \cdot \frac{\lambda_{\max}}{\lambda_{\min}} \sqrt{dn}, \;\; \text{for all i \in [m].}\]

(A3)

(Separation). Let \(\Delta := \min_{i \neq j} \norm{\mu_{i}^{\star} - \mu_{j}^{\star}}\) and \(\pi_{\min}^{\star} = \min_{j} \pi_{j}^{\star}\); we have \[\Delta \geq C \cdot \max\set*{ \sqrt{D_{\max}} (dn)^{1/4}, \sqrt{\frac{d}{\pi_{\min}^{\star}}}, \sqrt{\log\left( \frac{D_{\max} \cdot d n m}{\lambda_{\min} \pi_{\min}^{\star}} \right)} },\] for a sufficiently large constant \(C > 0\).

Note that Item [assm:item:nondegeneracy] implies that \(\pi_{\min}^{\star} > 0\).

2.0.1.2 Auxiliary results

In this section, we collect technical results about the KL loss used throughout our analysis.

Lemma 2 (Gradient of KL loss; [6]). We have that

\[\grad_{\mu_i}\mathcal{L}(\theta) = \mathbb{E}_{X \sim p^{\star}}\left[ \psi_{i}(X; \theta)(\mu_{i} - X) \right] = \sum_{j = 1}^{m} \pi_{j}^{\star}\,\mathbb{E}_{X \sim \mathcal{N}(\mu_{j}^{\star}, \id_{d})}[\psi_{i}(X; \theta)(\mu_{i} - X)]. \label{eq:mu-gradient}\tag{18}\]

where \(\mathcal{L}(\theta)\) and \(\psi_{i}\) are defined in 7 and 6 , respectively.

Theorem 4 (Identifiability; [6]). Suppose 1 is in force. There exist constants \(\varepsilon_0,C>0\) such that the following holds. Let \(\theta=(\mu,\pi)\), and suppose there is a partition \[[n]=\bigsqcup_{\ell=1}^m S_\ell\] such that every student in \(S_\ell\) lies in the local neighborhood of the \(\ell\)-th teacher mean. If \[\mathcal{L}(\theta)\le \varepsilon \le \varepsilon_0,\] then for every \(\ell\in[m]\): \[\begin{align} \sum_{i\in S_\ell}\pi_i\|\mu_i-\mu_\ell^\star\|_2^2 & \le C\sqrt{\mathcal{L}(\theta)}, \tag{19} \\ \abs[\Big]{\sum_{i \in S_{\ell}} \pi_{i} -\pi_\ell^\star} & \le C\sqrt{\mathcal{L}(\theta)}, \tag{20} \\ \opnorm[\Big]{\sum_{i\in S_\ell}\pi_i\mu_i-\pi_\ell^\star\mu_\ell^\star} & \le C\sqrt{\mathcal{L}(\theta)}. \tag{21} \end{align}\] Moreover, letting \(\delta := C \varepsilon^{1/4}\), we have the following inequality: \[\sum_{i\in S_\ell^{\mathrm{close}}(\delta)} \pi_i \ge \frac{1}{2}\pi_\ell^\star, \quad \text{for} \quad S_\ell^{\mathrm{close}}(\delta) := \{i\in S_\ell:\|\mu_i-\mu_\ell^\star\|_2\le \delta\}.\]

Corollary 1 ([34]). Let \(f\) be \(C^5\) near a minimizer \(\bar x\), and let \(\mathcal{S}^{\star}\) be the local solution set of \(f\) near \(\bar x\). Suppose that the following hold:

  • the Hessian \(\nabla^2 f\) has constant rank on \(\mathcal{S}^{\star}\) near \(\bar x\);

  • there exists \(D_{\mathsf{lb}}>0\) such that, for all \(x\) near \(\bar{x}\), it holds that

    \[D_{\mathsf{lb}}\, \dist(x,\mathcal{S}^{\star})^4 \le f(x) - \min f. \label{eq:ddj-4th-order-growth}\tag{22}\]

Then \(f\) admits a local \(C^5\) Morse ravine near \(\bar x\), and satisfies [34] there.

Theorem 5 ([34]). Let \(f\) be \(C^2\) near a minimizer \(\bar x\), and suppose that Assumption A of [34] holds at \(\bar x\) with respect to a ravine \(\mathcal{M}\), with \(C^{2}\) projection \(P_{\mathcal{M}}\) near \(\bar x\). Then there exist constants \(\delta_0,\eta_0,c,C>0\) such that for every initial point \(x_0\in B_{\delta_0}(\bar x)\), every stepsize \(\eta\in(0,\eta_0)\), and every pair of iteration counts \(K,I\in\mathbb{N}\), the output \(x_{\mathrm{out}}\) of the GD-Polyak method of [34] satisfies \[f(x_{\mathrm{out}})-f^\star \le C e^{-c\eta \cdot \min\{K,I\}}.\] Moreover, the total number of gradient and function evaluations is at most \(I(K+1)\).

Lemma 3 (Local Lipschitzness of logarithm). Suppose that \(x, y \geq \zeta > 0\). Then we have that \[\begin{align} \abs{\log(x) - \log(y)} \leq \frac{\abs{x - y}}{\zeta}. \end{align}\]

Proof. Let \(h(t)=\log t\). Fix \(x \geq y\) without loss of generality. By the mean-value theorem, there is \(t \in (y, x)\) such that

\[h(x) - h(y) = h'(t) \cdot (x - y) = \frac{x - y}{t} \leq \frac{x - y}{\zeta}\]

Repeating the above with the role of \(x\) and \(y\) reversed completes the proof. ◻

Lemma 4 (Spectral norm of block matrix). Suppose that \(A \in \mathbf{S}^{dn \times dn}\) is partitioned as \[A = \begin{bmatrix} A_{11} & A_{12} & \dots & A_{1n} \\ A_{12}^{\T} & A_{22} & \dots & A_{2n} \\ \vdots & & & \vdots \\ A_{1n}^{\T} & A_{2n}^{\T} & \dots & A_{nn} \end{bmatrix}, \;\; \text{where} \;\; A_{ij} \in \mathbb{R}^{d \times d}.\] Then it holds that \(\opnorm{A} \leq n \cdot \max_{i, j} \opnorm{A_{ij}}\).

Proof. The spectral norm of \(A\) is given by \(\opnorm{A} = \sup_{u: \norm{u} = 1} \abs{\ip{u, Au}}\). For any such \(u\), \[\begin{align} \abs{\ip{u, Au}} & = \abs[\Big]{\sum_{i = 1}^{n} \ip{u_{i}, \sum_{j = 1}^{n} A_{ij} u_{j}}} \\ & \leq \sum_{i = 1}^{n} \norm{u_{i}} \norm[\Big]{\sum_{j = 1}^{n} A_{ij} u_{j}} \\ & \leq \sqrt{\sum_{i = 1}^{n} \norm[\Big]{\sum_{j = 1}^{n} A_{ij} u_j}^2} \\ & \leq \sqrt{\sum_{i = 1}^{n} \Big(\sum_{j = 1}^{n} \opnorm{A_{ij}} \norm{u_j}\Big)^2} \\ & \leq \sqrt{\sum_{i = 1}^{n} n \cdot \max_{j} \opnorm{A_{ij}}^2} \\ & \leq n \cdot \max_{i, j} \opnorm{A_{ij}}, \end{align}\] by repeatedly applying the Cauchy-Schwarz and Hölder inequalities. ◻

Theorem 6 ([34]). Let \(f\) be \(C^2\) near a minimizer \(\bar x\), let \(\mathcal{S}^{\star}\) be the set of minimizers of \(f\), and suppose that Assumption A of [34] holds at \(\bar x\) with respect to a ravine \(\mathcal{M}\), with \(C^{2}\) projection \(P_{\mathcal{M}}\) near \(\bar x\). Let \[f(x) - f^\star = \underbrace{f(P_{\mathcal{M}}(x))}_{f_{T}(x)} + \underbrace{f(x) - f(P_{\mathcal{M}}(x))}_{f_{N}(x)}\] denote the corresponding normal/tangent decomposition, and let \(p\) be the order appearing in Assumption A. Then there exist a neighborhood \(U\) of \(\bar x\) and constants \[D_{\mathrm{lb}},D_{\mathrm{ub}},\beta_{\mathrm{lb}},\beta_{\mathrm{ub}}>0, \qquad q_{\mathrm P}\in(0,1), \qquad C_{\mathrm P}>0,\] such that the following hold:

(i) For every \(y\in U\cap \mathcal{M}\), the following holds: \[\begin{align} D_{\mathrm{lb}} \dist(y,\mathcal{S}^{\star})^p & \le f_T(y)-f^\star \le D_{\mathrm{ub}} \dist(y,\mathcal{S}^{\star})^p, \\ \beta_{\mathrm{lb}}\dist(y,\mathcal{S}^{\star})^{p-1} & \leq \norm{\grad f_T(y)} \leq \beta_{\mathrm{ub}} \dist(y,\mathcal{S}^{\star})^{p-1}. \end{align}\]

(ii) For every \(x\in U\), setting \(y := P_{\mathcal{M}}x\), let \[x^+ := x- \frac{f(x)-f^\star}{\norm{\nabla f(x)}^2} \nabla f(x), \quad y^+ := P_{\mathcal{M}} x^+,\]

 Then if
 $\norm{\grad f_{N}(x)} \leq \tfrac{1}{100} \norm{\grad f_{T}(y)}$,
 the following holds:

 $$\dist(y^+,\mathcal{S}^{\star}) \leq q_{\mathrm{P}} \dist(y,\mathcal{S}^{\star}), \quad \text{and} \quad \dist(x^+,\mathcal{M}) \leq C_{\mathrm{P}} \dist(y,\mathcal{S}^{\star}).$$

Corollary 2 ([34]). Under the assumptions of Theorem 6, for every \(\rho>0\), after shrinking \(U\) if necessary there exist constants \(c_{\mathrm G}, \eta_{\mathrm G}>0\) such that the following holds for every \(x\in U\) and every \(0<\eta<\eta_{\mathrm G}\): \[\norm{x - \eta \nabla f(x) - \proj_{\mathcal{M}}(x)} \leq (1 - c_{\mathrm{G}} \eta) \dist_{\mathcal{M}}(x) + \rho \eta \cdot \dist^{p-1}(P_{\mathcal{M}}(x), \mathcal{S}^{\star}).\]

2.0.2 Ravine geometry under exact clustering↩︎

In this section, we study the geometry of the loss landscape near the optimal solution set \(\Theta^{\star}\). Before we proceed, we establish some notation. Following [6], we define \(S_{\ell} \subset [n]\) as the set of mean vectors closest to the mean of the \(\ell^{\text{th}}\) teacher component: \[S_{\ell} := \set[\big]{\mu \in \mathbb{R}^d \mid \norm{\mu - \mu_{\ell}^{\star}} \leq \min_{j \neq \ell}\,\norm{\mu - \mu_{j}^{\star}}}. \label{eq:nearest-mean-assignment}\tag{23}\] Additionally, we write \(S_{\ell}(\delta) := S_{\ell} \cap \mathcal{B}(\mu_{\ell}^{\star}; \delta)\) for the \(\delta\)-close elements in \(S_{\ell}\).

Any optimal parameterization \(\theta^{\star} \in \Theta^{\star}\) induces a partition \([n] = \bigcup_{\ell=1}^m S_{\ell}\). When that parameterization contains components with \(\pi_{i} = 0\), or when \(S_{\ell} \cap S_{k} \neq \emptyset\), such a partition need not be unique. The following definition rules out such cases.

Definition 1 (Exact clustering at minimizer). Fix \(\theta^{\star} = (\widetilde{\mu}, \widetilde{\pi}) \in \Theta^{\star}\). We say that \(\theta^{\star}\) induces an exact clustering, \(\set{S_{\ell}}_{\ell=1}^m\), if the following conditions hold:

(i) Mean alignment: for every \(\ell\in[m]\) and every \(i\in S_\ell\),

$$\widetilde{\mu}_i = \mu_\ell^\star.$$

(ii) Weight aggregation: for every \(\ell = 1, \dots, m\),

 $$\sum_{i\in S_\ell}\widetilde{\pi}_i = \pi_\ell^\star.$$

In this case, we have an exact partition \([n] = \bigsqcup_{\ell=1}^m S_{\ell}\).

Definition 2 (Cluster averaging operator and tangent subspace). Fix an exact clustering according to 1 and its corresponding partition and define the averaging operator \[\mathsf{Avg}: \mathbb{R}^{dn} \to \mathbb{R}^{dm}, \qquad \mathsf{Avg}_\ell(u):=\sum_{i\in S_\ell}\pi_i u_i, \qquad \ell\in[m].\] We denote the corresponding cluster-mean-preserving subspace by \[T:=\ker(\mathsf{Avg}) = \left\{ u=(u_1,\ldots,u_n)\in\mathbb{R}^{dn}: \sum_{i\in S_\ell}\pi_i u_i=0 \text{ for every }\ell\in[m] \right\}. \label{eq:mean-preserving-subspace}\tag{24}\]

Definition 1 specifies the exact clustering structure at the minimizer, while Definition 2 extracts the corresponding linear geometry. The operator \(\mathsf{Avg}\) records the weighted cluster means; its kernel comprises all perturbations that preserve cluster means. The next result shows that, at such minimizers, the subspace \(T\) coincides with the nullspace of the Hessian of \(\mathcal{L}\).

Proposition 7 (Hessian block formula at a minimizer). Assume \(\theta^\star=(\mu^\star,\pi)\in\Theta_\star\) admits an exact clustering with induced partition \([n]=\bigsqcup_{\ell=1}^m S_\ell\). Then, for \(i, j \in [n]\), we have \[\grad^2_{\mu_i \mu_j} \mathcal{L}(\theta^{\star}) = \mathbb{E}_{X\sim p^\star}\!\Big[ \psi_i(X;\theta^\star)\psi_j(X;\theta^\star) (X-\mu_i^\star)(X-\mu_j^\star)^\T \Big].\] In particular, if \(i\in S_\ell\) and \(j\in S_k\), it follows that \[\grad^2_{\mu_i\mu_j} \mathcal{L}(\theta^\star) = \frac{\pi_i\pi_j}{\pi_\ell^\star\pi_k^\star}\Gamma_{\ell k}, \qquad \Gamma_{\ell k} := \mathbb{E}_{X\sim p^\star}\!\Big[ \gamma_\ell(X)\gamma_k(X) (X-\mu_\ell^\star)(X-\mu_k^\star)^\T \Big],\] where we define the reduced model responsibilities \(\gamma_{\ell}\) as \[\gamma_\ell(x):=\frac{\pi_\ell^\star \phi(x\mid \mu_\ell^\star)}{p^\star(x)}.\]

Proof of Proposition 7. Below, we write \(H_{ij}(\theta) := \grad^2_{\mu_i \mu_j} \mathcal{L}(\theta)\). By 2, we have that \[\nabla_{\mu_i}\mathcal{L}(\theta) = -\mathbb{E}_{X\sim p^\star}\!\big[\psi_i(X;\theta)(X-\mu_i)\big].\] To differentiate the responsibility, write \[\psi_i(x;\theta)=\frac{N_i(x)}{Z(x)}, \qquad N_i(x):=\pi_i\phi(x\mid \mu_i), \qquad Z(x):=\sum_{k=1}^n N_k(x).\] Then \[\nabla_{\mu_j}N_i(x)=\mathbf{1}_{\{i=j\}}N_i(x)(x-\mu_j), \qquad \nabla_{\mu_j}Z(x)=N_j(x)(x-\mu_j).\] Hence, by the quotient rule, \[\begin{align} \nabla_{\mu_j}\psi_i(x;\theta) & = \frac{\nabla_{\mu_j}N_i(x)}{Z(x)} -\frac{N_i(x)\nabla_{\mu_j}Z(x)}{Z(x)^2} \\ & = \mathbf{1}_{\{i=j\}}\frac{N_i(x)}{Z(x)}(x-\mu_j) -\frac{N_i(x)}{Z(x)}\frac{N_j(x)}{Z(x)}(x-\mu_j) \\ & = \psi_i(x;\theta)\big(\mathbf{1}_{\{i=j\}}-\psi_j(x;\theta)\big)(x-\mu_j). \end{align}\] Continuing with the calculation of the second derivative, we obtain \[\begin{align} H_{ij}(\theta) & = \nabla_{\mu_j}(\nabla_{\mu_i}\mathcal{L}(\theta)) \\ & = -\mathbb{E}_{X\sim p^\star}\!\Big[ \nabla_{\mu_j}\big(\psi_i(X;\theta)(X-\mu_i)\big) \Big] \\ & = -\mathbb{E}_{X\sim p^\star}\!\Big[ (X-\mu_i)\big(\nabla_{\mu_j}\psi_i(X;\theta)\big)^\T -\mathbf{1}_{\{i=j\}}\psi_i(X;\theta)I_d \Big] \\ & = -\,\mathbb{E}_{X\sim p^\star}\!\Big[ \psi_i(X;\theta)\big(\mathbf{1}_{\{i=j\}}-\psi_j(X;\theta)\big) (X-\mu_i)(X-\mu_j)^\T \Big] \\ & \qquad +\,\mathbf{1}_{\{i=j\}}\mathbb{E}_{X\sim p^\star}\!\big[\psi_i(X;\theta)\big]I_d. \end{align}\] We now carry out the calculation for \(\theta \equiv \theta^\star\in\Theta_\star\). Since \(p_{\theta^\star}=p^\star\), \[\begin{align} \mathbb{E}_{X\sim p^\star}\!\Big[\psi_i(X;\theta^\star)(X-\mu_i^\star)(X-\mu_i^\star)^\T\Big] & = \int \pi_i\phi(x\mid \mu_i^\star)(x-\mu_i^\star)(x-\mu_i^\star)^\T\,dx \\ & = \mathbb{E}_{X\sim p^\star}\!\big[\psi_i(X;\theta^\star)\big]I_d. \end{align}\] Substituting this identity into the diagonal blocks yields \[H_{ij}(\theta^\star) = \mathbb{E}_{X\sim p^\star}\!\Big[ \psi_i(X;\theta^\star)\psi_j(X;\theta^\star) (X-\mu_i^\star)(X-\mu_j^\star)^\T \Big].\] Finally, if \(i\in S_\ell\) and \(j\in S_k\), the exact clustered representation gives \(\mu_i^\star=\mu_\ell^\star\) and \(\mu_j^\star=\mu_k^\star\). Hence \[\psi_i(x;\theta^\star)=\frac{\pi_i}{\pi_\ell^\star}\gamma_\ell(x), \qquad \psi_j(x;\theta^\star)=\frac{\pi_j}{\pi_k^\star}\gamma_k(x),\] which gives the factorized expression. ◻

Lemma 5 (Positive definiteness of the collapsed model Hessian). Define \[\mathcal{L}_{\mathrm{coll}}(\nu) := D_{\mathrm{KL}}\!\left(p^\star\,\|\,\sum_{\ell=1}^m \pi_\ell^\star \phi(\,\cdot\,\mid \nu_\ell)\right), \qquad \nu=(\nu_1,\dots,\nu_m)\in \mathbb{R}^{dm},\] and let \(\nu^\star:=(\mu_1^\star,\dots,\mu_m^\star)\) denote the exact teacher mean vector. Assume that Item [assm:item:nondegeneracy] holds; then the Hessian of the collapsed exact-parametrized loss at \(\nu^\star\) is positive definite: \[\nabla^2 \mathcal{L}_{\mathrm{coll}}(\nu^\star)\succ 0.\]

Proof. A standard statistical result states that the Hessian of the KL divergence evaluated at the optimal parameters \(\nu^\star\) coincides with the Fisher Information Matrix (FIM) of this model [37]. Therefore, proving \(\nabla^2 \mathcal{L}_{\mathrm{coll}}(\nu^\star) \succ 0\) is equivalent to proving that the FIM is non-singular. For parametric models satisfying standard smoothness and regularity conditions (which the Gaussian family easily satisfies), the FIM is strictly positive definite if and only if the model is locally identifiable [38].

A classic result by [39] establishes that finite mixtures of Gaussians are strictly identifiable. Under Item [assm:item:nondegeneracy], the mapping from the means \(\nu\) to the density \(p_\nu\) is unique. This strict identifiability guarantees that the Fisher Information Matrix is positive definite, concluding the proof. ◻

Theorem 8 (Ravine geometry at minimizer). Assume \(\theta^\star=(\mu^\star,\pi)\in\Theta_\star\) admits an exact clustering with partition \([n]=\bigsqcup_{\ell=1}^m S_\ell\) and let \(\mathsf{Avg}\) be the operator from Definition 2. Then

\[\ker\bigl(\nabla^2_{\mu\mu}\mathcal{L}(\theta^\star)\bigr)= \ker(\mathsf{Avg}).\]

Proof. We introduce the following notation for simplicity: \[H:=\nabla^2_{\mu\mu}\mathcal{L}(\theta^\star), \qquad \nu^\star:=(\mu_1^\star,\dots,\mu_m^\star), \qquad \bar H:=\nabla^2 \mathcal{L}_{\mathrm{coll}}(\nu^\star).\] By Lemma 5, we have \(\bar H\succ 0\). For \(u=(u_1,\dots,u_n)\in(\mathbb{R}^d)^n\), define \[v_\ell:=\frac{1}{\pi_\ell^\star}\sum_{i\in S_\ell}\pi_i u_i = \frac{1}{\pi_\ell^\star}\mathsf{Avg}_{\ell}(u), \qquad v=(v_1,\dots,v_m)\in(\mathbb{R}^d)^m.\] Fix \(i\in S_\ell\). Then Proposition 7 gives \[\begin{align} (Hu)_i & = \sum_{k=1}^m\sum_{j\in S_k}H_{ij}u_j \\ & = \sum_{k=1}^m\sum_{j\in S_k} \frac{\pi_i\pi_j}{\pi_\ell^\star\pi_k^\star}\Gamma_{\ell k}u_j \\ & = \frac{\pi_i}{\pi_\ell^\star}\sum_{k=1}^m \Gamma_{\ell k} \left( \frac{1}{\pi_k^\star}\sum_{j\in S_k}\pi_j u_j \right) \\ & = \frac{\pi_i}{\pi_\ell^\star}\sum_{k=1}^m \Gamma_{\ell k}v_k. \end{align}\] Clearly, if \(u \in \ker(\mathsf{Avg})\), we have \(v = 0\). Consequently, \(Hu = 0\) and thus \(\mathcal{T} \subset \ker(H)\). Conversely, \[u \in \ker(H) \implies 0 = (Hu)_i = \frac{\pi_i}{\pi_\ell^\star}\sum_{k=1}^m \Gamma_{\ell k}v_k \qquad \text{for every }i\in S_\ell.\] Since \(\pi_i>0\) by assumption, this implies \[\sum_{k=1}^m \Gamma_{\ell k}v_k=0 \qquad \text{for every }\ell\in[m].\] Applying Proposition 7 to the exact-parametrized \(m\)-component model shows that the \((\ell,k)\) block of \(\bar H\) is exactly \(\Gamma_{\ell k}\), so \(\bar H v=0\). Because \(\bar H\succ0\), we must have \(v=0\), which is equivalent to \[\sum_{i\in S_\ell}\pi_i u_i=0 \qquad \text{for every }\ell\in[m].\] Hence \(u\in\mathcal{T}\), proving the reverse inclusion.

Finally, we prove that \(\mathsf{Avg}: \mathbb{R}^{dn}\to \mathbb{R}^{dm}\) has rank \(md\): for each \(\ell\), the map \((u_i)_{i\in S_\ell}\mapsto \sum_{i\in S_\ell}\pi_i u_i\) is surjective onto \(\mathbb{R}^d\) because \(\pi_i>0\) and \(S_\ell\neq\varnothing\). Therefore \[\dim \mathcal{T} = nd-md = (n-m)d.\] ◻

Corollary 3 (Cluster bias / dispersion decomposition). For any \(\mu \in \mathbb{R}^{dn}\), we have \[\begin{align} & \sum_{\ell=1}^m\sum_{i\in S_\ell}\pi_i\norm{\mu_i-\mu_\ell^\star}^2 = B(\mu)+D(\mu), \notag \\ \text{where} \qquad B(\mu) & := \sum_{\ell=1}^m \widehat\pi_\ell\norm{\bar\mu_\ell-\mu_\ell^\star}^2, \quad D(\mu) := \sum_{\ell=1}^m\sum_{i\in S_\ell}\pi_i\norm{\mu_i-\bar\mu_\ell}^2. \label{eq:bias-dispersion-defn} \end{align}\tag{25}\]

Proof of Corollary 3. For each \(\ell\in[m]\), write \[\mu_i-\mu_\ell^\star=(\mu_i-\bar\mu_\ell)+(\bar\mu_\ell-\mu_\ell^\star).\] Expanding the squared norm, multiplying by \(\pi_i\), and summing over \(i\in S_\ell\) gives \[\sum_{i\in S_\ell}\pi_i\norm{\mu_i-\mu_\ell^\star}^2 = \widehat\pi_\ell\norm{\bar\mu_\ell-\mu_\ell^\star}^2 + \sum_{i\in S_\ell}\pi_i\norm{\mu_i-\bar\mu_\ell}^2,\] because the cross term vanishes: \[\sum_{i\in S_\ell}\pi_i(\mu_i-\bar\mu_\ell)=0.\] Summing over \(\ell\in[m]\) yields the claimed decomposition. ◻

Theorem 9 (Local quartic growth). Assume the hypotheses of Theorem 4, and let \[f_\pi(\mu):=\mathcal{L}(\mu,\pi),\] where \(\theta^\star=(\mu^\star,\pi)\in\Theta_\star\) is a global minimizer inducing a partition as in 1. Then there exist a neighborhood \(U\) of \(\mu^\star\) and a constant \(c_4>0\) such that \[f_\pi(\mu)-f_\pi(\mu^\star)\ge c_4\|\mu-\mu^\star\|_2^4 \qquad \forall \mu\in U.\]

Proof. Because \(\theta^\star\) is a global minimizer, \(f_\pi(\mu^\star)=\mathcal{L}^\star\). By continuity of \(f_\pi\) and of the student means, we may choose a neighborhood \(U\) of \(\mu^\star\) such that for every \(\mu\in U\), the partition \([n]=\bigsqcup_{\ell=1}^m S_\ell\) remains valid and \[f_\pi(\mu)-f_\pi(\mu^\star)\le \varepsilon_0,\] where \(\varepsilon_0\) is the threshold in Theorem 4. Then, for any \(\mu \in U\), we have \[\sum_{\ell=1}^m\sum_{i\in S_\ell}\pi_i\|\mu_i-\mu_\ell^\star\|_2^2 \le C\sqrt{\mathcal{L}(\mu, \pi)}.\] On the other hand, we have the following lower bound: \[\sum_{\ell=1}^m\sum_{i\in S_\ell}\pi_i\|\mu_i-\mu_\ell^\star\|_2^2 \ge \pi_{\min}\|\mu-\mu^\star\|_2^2, \qquad \pi_{\min}:=\min_{i\in[n]}\pi_i>0.\] Combining the last two displays and squaring both sides yields \[\mathcal{L}(\mu, \pi) \gtrsim \pi_{\min}^2 \norm{\mu-\mu^\star}^4.\] This proves the claim. ◻

Corollary 4 (Existence of ravine). Under the assumptions of Theorem 9, \(f_\pi\) admits a local \(C^\infty\) Morse ravine near \(\mu^{\star}\) and satisfies [34] at that point.

Proof. Theorem 9 implies that \(\mu^\star\) is the unique minimizer of \(f_\pi\) in a sufficiently small neighborhood of \(\mu^\star\). Since \(f_\pi\) is \(C^\infty\), the local solution set is the singleton \(\{\mu^\star\}\), so the Hessian rank is constant on the solution set. Corollary 1 therefore applies. ◻

2.0.2.1 Single-teacher geometry

In this section, we analyze the geometry of a simpler problem; namely, learning a single Gaussian with an over-parameterized Gaussian mixture. We normalize the single teacher to \[p^\star(x)=\phi(x\mid 0),\] which is without loss of generality by translation. The student weights \(\pi\in\Delta^{n-1}\) are fixed and strictly positive, and the corresponding fixed-weight minimizer is \[\theta^\star=((0,\dots,0),\pi).\] In this case, the averaging operator from 2 reduces to the weighted mean.

Proposition 10 (Single-teacher Hessian and tangent space). At the single-teacher minimizer \(\theta^\star=((0,\dots,0),\pi)\), the Hessian with respect to the student means satisfies \[\nabla^2_{\mu\mu}\mathcal{L}(\theta^\star) = (\pi\pi^\T)\otimes I_d.\] Consequently, we have that \(\rank(\grad^2_{\mu\mu}\mathcal{L}(\theta^{\star})) = d\), with \[\ker\bigl(\nabla^2_{\mu\mu}\mathcal{L}(\theta^\star)\bigr) = \Bigl\{ u=(u_1,\dots,u_n)\in(\mathbb{R}^d)^n: \sum_{i=1}^n \pi_i u_i=0 \Bigr\}.\]

Proof. At \(\theta^\star\), every student mean equals the teacher mean. Consequently, \[\psi_i(x;\theta^\star) = \frac{\pi_i\phi(x\mid 0)}{\sum_{k=1}^n \pi_k\phi(x\mid 0)} = \pi_i.\] Applying Proposition 7 with \(m=1\) therefore gives \[H_{ij}(\theta^\star) = \mathbb{E}_{X\sim p^\star}\!\big[\pi_i\pi_j XX^\T\big] = \pi_i\pi_j I_d,\] because \(X\sim\mathcal{N}(0,I_d)\) under \(p^\star\). Hence \[\nabla^2_{\mu\mu}\mathcal{L}(\theta^\star) = (\pi\pi^\T)\otimes I_d = (\pi \otimes I_d)(\pi \otimes I_d)^{\T}.\] By standard properties of the Kronecker product, for any \(u \in \mathbb{R}^{dn}\), we have \[(\pi \otimes I_d)^{\T} u = \sum_{i = 1}^{n} \pi_{i} u_{i} \implies \ker(\grad_{\mu\mu}^2 \mathcal{L}(\theta^{\star})) = \ker(\pi^{\T} \otimes I_d) = \set*{u \in \mathbb{R}^{dn} \mid \sum_{i = 1}^{n} \pi_{i} u_{i} = 0}.\] The rank property is immediate from \(\rank(A \otimes B) = \rank(A) \cdot \rank(B)\). ◻

For \(\mu=(\mu_1,\dots,\mu_n)\in(\mathbb{R}^d)^n\), define the weighted mean \[\bar\mu:=\sum_{i=1}^n \pi_i\mu_i.\] The following Corollary is an easy consequence of 5.

Corollary 5 (Single-teacher bias/dispersion decomposition). For every \(\mu \in \mathbb{R}^{dn}\), \[\sum_{i=1}^n \pi_i \norm{\mu_i-\mu^\star}_2^2 = \norm{\bar\mu-\mu^\star}_2^2 + \sum_{i=1}^n \pi_i \norm{\mu_i-\bar\mu}_2^2.\]

Proposition 11 (Quartic growth for fixed weights). Define the quantities \[\pi_{\min}:=\min_{i\in[n]}\pi_i, \qquad i_{\max}\in\arg\max_{i\in[n]}\norm{\mu_i}_2, \qquad \mu_{\max}:=\mu_{i_{\max}}.\] Then there exists a constant \(C>0\), depending only on the model parameters, such that \[\mathcal{L}(\mu,\pi) \geq C\bigl(\pi_{\min}\norm{\mu_{\max}}_2^2\bigr)^2.\]

Proof of Proposition 11. From [6], which is applicable as long as the weights are bounded, there exists a constant \(D_{\max}>0\) such that for every \(v\in\mathbb{R}^d\) with \(\norm{v}_2=1\), \[\mathcal{L}(\mu,\pi) \geq D_{\max}^{-4} \left( \sum_{i=1}^n \pi_i \langle \mu_i,v\rangle^2 \right)^2.\] If \(\mu_{\max}=0\), then every \(\mu_i=0\), so both sides of the desired inequality vanish and there is nothing to prove. Hence we may assume \(\mu_{\max}\neq 0\) in what follows. Choosing \[v:=\frac{\mu_{\max}}{\norm{\mu_{\max}}_2},\] we deduce the following inequality: \[\sum_{i=1}^n \pi_i \langle \mu_i,v\rangle^2 \geq \pi_{\min}\max_{i\in[n]}\langle \mu_i,v\rangle^2 \geq \pi_{\min}\langle \mu_{\max},v\rangle^2 = \pi_{\min}\norm{\mu_{\max}}_2^2.\] Substituting this bound into the previous display gives \[\mathcal{L}(\mu,\pi) \geq D_{\max}^{-4} \bigl(\pi_{\min}\norm{\mu_{\max}}_2^2\bigr)^2.\] The claim follows with \(C:=D_{\max}^{-4}\). ◻

2.0.3 Geometry under weight perturbation↩︎

In this section, we show that small mismatches in the grouped student weight vector \(\widehat{\pi} \in \Delta^{m-1}\) (relative to the ground truth weights, \(\pi^{\star} \in \Delta^{m-1}\)) induce small perturbations in the loss function and its derivatives. Assuming that \(\mathcal{L}(\mu, \pi) \leq \varepsilon_0\) (as it appears in 4) and \(\pi \in \intr{\Delta^{n-1}}\), so that every coordinate \(\pi_{i} > 0\), we define the following quantities: \[\begin{align} \widehat{\pi}_\ell & := \sum_{i\in S_\ell}\pi_i; \tag{26} \\ \Delta_{\pi}^{(\ell)} & := \frac{\abs{\widehat{\pi}_{\ell} - \pi_{\ell}^{\star}}}{\pi_{\ell}^{\star}}; \tag{27} \\ \Delta_{\pi} & := \max_{\ell\in[m]} \Delta_{\pi}^{\ell}. \tag{28} \end{align}\] Since \(\pi \in \intr{\Delta^{n-1}}\), it is immediate that \(\widehat{\pi} \in \intr{\Delta^{m-1}}\).

The basis of our comparison is a reference loss, in which the weight vector \(\pi\) is replaced by a scaled version \(\bar{\pi}\) that matches the ground truth \(\pi^{\star}\) over each group.

Definition 3 (Reference group weights). For any pair \(\pi \in \intr{\Delta^{n-1}}\), we define the reference group weights \(\bar{\pi} \in \intr{\Delta^{n-1}}\) as follows: \[\bar{\pi}_i := \pi_{i} \cdot \frac{\pi_{\ell}^{\star}}{\sum_{j \in S_{\ell}} \pi_{j}} = \pi_{i} \cdot \frac{\pi_{\ell}^{\star}}{\widehat{\pi}_{\ell}}, \quad \text{for all i \in S_{\ell} and \ell \in [m].} \label{eq:reference-group-weights}\tag{29}\] In particular, we have \(\sum_{i \in S_{\ell}} \bar{\pi}_i = \pi_{\ell}^{\star}\).

The next Lemma bounds the \(\ell_{1}\) distance between \(\pi\) and \(\bar{\pi}\) in terms of worst-case group mismatch.

Lemma 6 (Distance to reference group weights). For \(\bar{\pi}\) defined in 3, it holds that \[\label{eq:distance-to-group-ref-weights} \norm{\bar{\pi} - \pi}_1 = \sum_{\ell = 1}^{m} \abs{\widehat{\pi}_{\ell} - \pi_{\ell}^{\star}} \leq \Delta_{\pi}.\tag{30}\]

Proof. Expanding the definition of \(\bar{\pi}\), we obtain \[\begin{align} \norm{\bar{\pi}-\pi}_1 & = \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \abs{\bar{\pi}_i - \pi} \\ & = \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \abs[\Big]{\pi_{i} \Big(\tfrac{\pi_{\ell}^{\star}}{\widehat{\pi}_{\ell}} - 1\Big)} \\ & = \sum_{\ell = 1}^{m} \abs[\big]{\tfrac{\pi_{\ell}^{\star}}{\widehat{\pi}_{\ell}} - 1} \sum_{i \in S_{\ell}} \pi_{i} \\ & = \sum_{\ell = 1}^{m} \abs{\widehat{\pi}_{\ell} - \pi_{\ell}^{\star}} \\ & = \sum_{\ell = 1}^{m} \Delta_{\pi}^{(\ell)} \cdot \pi_{\ell}^{\star} \\ & \leq \Delta_{\pi}, \end{align}\] where the second equality follows from the fact that \(\frac{\widehat{\pi}_{\ell}}{\pi_{\ell}^{\star}}\) is constant throughout \(S_{\ell}\), the fourth equality follows from 26 , and the last two lines follow from 27 28 . ◻

Equipped with 6, we derive a uniform bound between \(\mathcal{L}(\mu, \pi)\) and the “reference” \(\mathcal{L}(\mu, \bar{\pi})\) that also extends to their first two derivatives after suitable rescaling.

Proposition 12 (Loss perturbation). Fix a compact \(U\subset \mathbb{R}^{dn}\) and suppose that \(\Delta_{\pi} \leq \tfrac{1}{2}\). Define \[M_U:=\max_{\mu\in U}\max_{i\in[n]}\|\mu_i\|_2, \quad m_1:=\expec[X\sim p^\star]{\norm{X}} \;\; \text{and} \;\; m_2:=\expec[X \sim p^{\star}]{\norm{X}^2}.\] Let \(c_{0} := \frac{1}{2} \pi_{\min}^{\star}\) and \(C_{0} = 2 (1 + \tfrac{1}{\pi_{\min}^{\star}})\). There are constants \(C_{U}^{(0)}\), \(C_{U}^{(1)}\) and \(C_{U}^{(2)}\) such that \[\begin{align} \sup_{\mu\in U}\abs{\mathcal{L}(\mu,\pi)-\mathcal{L}(\mu,\bar\pi)} & \leq C_{U}^{(0)}\Delta_\pi; \label{eq:loss-perturbation} \\ \sup_{\mu\in U}\norm{\grad_{\mu} \mathcal{L}(\mu,\pi) - \grad_{\mu} \mathcal{L}(\mu,\bar\pi)} & \leq C_{U}^{(1)}\Delta_\pi; \label{eq:grad-perturbation} \\ \sup_{\mu\in U} \opnorm{\grad_{\mu\mu}^2 \mathcal{L}(\mu,\pi) - \grad_{\mu\mu}^2 \mathcal{L}(\mu,\bar\pi)} & \leq C_{U}^{(2)}\Delta_\pi. \label{eq:hessian-perturbation} \end{align}\] {#eq: sublabel=eq:eq:loss-perturbation,eq:eq:grad-perturbation,eq:eq:hessian-perturbation} In particular, the constants are given by \[C_{U}^{(0)} = \frac{1}{c_0}, \; C_{U}^{(1)} = C_{0}\sqrt{2n(m_2 + M_{U}^2)}, \; C_{U}^{(2)} = C_{0} n (1 + 2 (2 + C_0 \Delta_{\pi}) (m_2 + M_{U}^2)). \label{eq:perturbation-constants}\qquad{(2)}\]

Proof. Since \(\mathcal{L}(\mu, \pi) = \expec[X \sim p^{\star}]{\log(p^{\star}(X) / p_{\mu, \pi}(X))}\), we control deviations by comparing the densities induced by \(\pi\) and \(\bar{\pi}\). For \(\mu \in \mathbb{R}^{dn}\) and corresponding partition \([n] = \bigsqcup_{\ell} S_{\ell}\), let \[q_\ell(x;\mu):=\frac{1}{\widehat\pi_\ell}\sum_{i\in S_\ell}\pi_i\phi(x\mid \mu_i). \;\; \text{for \ell \in [m]} \label{eq:group-partition}\tag{31}\] With 31 at hand, we rewrite both densities as \[\begin{align} p_{\mu,\pi}(x) & = \sum_{\ell=1}^m \widehat\pi_\ell q_\ell(x;\mu), \tag{32} \\ p_{\mu,\bar{\pi}}(x) & = \sum_{\ell=1}^m \pi_\ell^\star q_\ell(x;\mu). \tag{33} \end{align}\] Using the preceding decomposition and Jensen’s inequality, we obtain \[\abs{\mathcal{L}(\mu, \pi) - \mathcal{L}(\mu, \bar{\pi})} = \abs[\big]{\expec[X \sim p^{\star}]{\log\left(\tfrac{p_{\mu, \bar{\pi}}(X)}{p_{\mu, \pi}(X)}\right)}} \leq \expec[X \sim p^{\star}]{\abs*{\log\left(\tfrac{p_{\mu, \bar{\pi}}(X)}{p_{\mu, \pi}(X)}\right)}}, \label{eq:log-diff}\tag{34}\] We now bound the expression inside the expectation in 34 . For any finite \(X\), 3 yields

\[\abs{\log(\tfrac{p_{\mu, \bar{\pi}}(X)}{p_{\mu, \pi}(X)})} \leq \frac{\abs{p_{\mu, \pi}(X) - p_{\mu, \bar{\pi}}(X)}}{\min\set*{ p_{\mu, \pi}(X), p_{\mu, \bar{\pi}}(X) }} \label{eq:log-density-ratio-bound}\tag{35}\]

To further bound the right-hand side in 35 , we proceed as follows:

  • We lower bound both densities uniformly. Indeed, since \(\Delta_{\pi} < \tfrac{1}{2}\) by assumption, \[\widehat{\pi}_{\ell} \geq (1 - \Delta_{\pi}^{\ell}) \cdot \pi_{\ell}^{\star} \geq \frac{1}{2} \pi_{\ell}^{\star}. \label{eq:adjusted-density-bound}\tag{36}\] From the above and 32 33 , we deduce the lower bounds \[\begin{align} p_{\mu, \bar{\pi}}(X) & = \sum_{\ell = 1}^{m} \pi_{\ell}^{\star} q_{\ell}(X; \mu) \geq \pi_{\min}^{\star} \sum_{\ell=1}^{m} q_{\ell}(X; \mu); \tag{37} \\ p_{\mu, \pi}(X) & = \sum_{\ell = 1}^{m} \widehat{\pi}_{\ell} q_{\ell}(X; \mu) \geq \frac{1}{2} \pi_{\min}^{\star} \sum_{\ell=1}^{m} q_{\ell}(X; \mu). \tag{38} \end{align}\]

  • We upper bound their difference for a fixed \(X\). Indeed, 6 supplies the bound \[\begin{align} \abs{p_{\mu,\pi}(X)-p_{\mu,\bar\pi}(X)} & = \abs[\Big]{\sum_{\ell=1}^m (\widehat\pi_\ell-\pi_\ell^\star)q_\ell(X;\mu)} \notag \\ & \le \sum_{\ell=1}^m \abs{\widehat{\pi}_\ell-\pi_{\ell}^\star} q_\ell(X;\mu) \notag \\ & \leq \Delta_{\pi} \sum_{\ell=1}^m q_\ell(X;\mu). \label{eq:density-difference-under-weight-mismatch} \end{align}\tag{39}\]

Plugging the previous estimates into 35 and taking expectations, noting \(\norm{X} < \infty\) a.s., yields \[\expec[X \sim p^{\star}]{\abs{\log(p_{\mu, \pi}(X)) - \log(p_{\mu, \bar{\pi}}(X))}} \leq \frac{2 \Delta_{\pi}}{\pi_{\min}^{\star}}.\] Substituting into 34 completes the proof of ?? .

We now turn to the gradient bound. Fix \(i \in S_{\ell}\); by the definition of \(\bar{\pi}_i\) and 6 , we have \[\psi_i(x;\mu, \pi) = \frac{\pi_i\phi(x\mid \mu_i)}{p_{\mu,\pi}(x)}, \quad \psi_i(x;\mu,\bar{\pi}) = \frac{\bar\pi_i\phi(x\mid \mu_i)}{p_{\mu,\bar\pi}(x)} = \frac{\pi_\ell^\star}{\widehat\pi_\ell} \cdot \frac{p_{\mu, \pi}(x)}{p_{\mu,\bar\pi}(x)} \cdot \psi_{i}(x; \mu, \pi).\] This implies the following bound on the difference between responsibilities: \[\begin{align} \abs{\psi_{i}(X; \mu, \pi) - \psi_{i}(X; \mu, \bar{\pi})} & = \psi_{i}(X; \mu, \pi) \cdot \abs[\Big]{ 1 - \frac{\pi_{\ell}^{\star}}{\widehat{\pi}_{\ell}} \cdot \frac{p_{\mu, \pi}(X)}{p_{\mu, \bar{\pi}}(X)} } \\ & = \psi_{i}(X; \mu, \pi) \cdot \abs[\Big]{ \frac{\widehat{\pi}_{\ell} p_{\mu, \bar{\pi}}(X) - \pi_{\ell}^{\star} p_{\mu, \pi}(X)}{ \widehat{\pi}_{\ell} p_{\mu, \bar{\pi}}(X) } } \\ & \leq 2\,\psi_{i}(X; \mu, \pi) \cdot \abs[\Big]{ \frac{\widehat{\pi}_{\ell} p_{\mu, \bar{\pi}}(X) - \pi_{\ell}^{\star} p_{\mu, \pi}(X)}{ {\pi}_{\ell}^{\star} p_{\mu, \bar{\pi}}(X) } } \\ & \leq 2\, \psi_{i}(X; \mu, \pi) \cdot \left( \Delta_{\pi}^{(\ell)} + \frac{\abs{p_{\mu, \pi}(X) - p_{\mu, \bar{\pi}}(X)}}{p_{\mu, \bar{\pi}}(X)} \right) \\ & \leq 2\, \psi_{i}(X; \mu, \pi) \cdot \left( \Delta_{\pi}^{(\ell)} + \frac{\Delta_{\pi}}{\pi_{\min}^{\star}} \right) \\ & \leq 2\,\Delta_{\pi} \left(1 + \frac{1}{\pi_{\min}^{\star}}\right) \\ & = C_{0} \Delta_{\pi}, \end{align}\] where the first inequality follows from the bound 36 , the second inequality follows from the definition of \(\Delta_{\pi}^{(\ell)}\), the penultimate inequality follows from 39 and 37 , and the last inequality follows from \(\Delta_{\pi}^{(\ell)} \leq \Delta_{\pi}\) and the fact that \(\set{\psi_{i}(X; \mu, \pi)}_{i=1}^n \in \Delta^{n-1}\).

By the gradient identity furnished by 2, we have \[\begin{align} \norm{\grad_{\mu_i}\mathcal{L}(\mu,\pi) - \grad_{\mu_{i}}\mathcal{L}(\mu,\bar{\pi})} & = \norm{\expec[X\sim p^\star]{(\psi_i(X;\mu, \pi) - \psi_{i}(X; \mu, \bar{\pi})) \cdot (X-\mu_i)}} \\ & \leq C_{0} \Delta_{\pi} \cdot \Big(\expec[X \sim p^{\star}]{\norm{X - \mu_{i}}^2}\Big)^{1/2} \\ & \leq C_{0} \Delta_{\pi} \sqrt{2(m_{2} + M_{U}^2)}, \end{align}\] where the penultimate inequality follows from Cauchy-Schwarz and the fact that \[\begin{align} \big(\expec[X \sim p^{\star}]{\norm{X - \mu_{i}}^2})^{1/2} & \leq \big(2 \expec[X \sim p^{\star}]{\norm{X}^2} + 2 \norm{\mu_{i}}^2\big)^{1/2} \\ & \leq 2^{1/2} \cdot \big(m_{2} + M_{U}^2\big)^{1/2}. \end{align}\] Taking the Euclidean norm over the \(n\) blocks of the gradient proves ?? .

Finally, let \(H^\pi_{ij}(\mu)\) and \(H^{\bar\pi}_{ij}(\mu)\) denote the \((i,j)\) blocks of \(\grad^2_{\mu\mu}\mathcal{L}(\mu,\pi)\) and \(\grad^2_{\mu\mu}\mathcal{L}(\mu,\bar\pi)\). By the derivation in the proof of Proposition 7, we obtain \[H^\pi_{ij}(\mu) = -\expec{\psi_i(X; \mu, \pi)(\delta_{ij}-\psi_j^\pi) (X-\mu_i)(X-\mu_j)^\T } + \delta_{ij}\expec{\psi_i(X; \mu, \pi)}I_d.\] The formula for \(H^{\bar\pi}_{ij}(\mu)\) follows mutatis-mutandis. Writing \(\psi_{i}^{\pi} := \psi_{i}(X; \mu, \pi)\) for brevity, we have \[\begin{align} \abs{\psi_i^{\pi}(\delta_{ij}-\psi_j^\pi)-\psi_i^{\bar\pi}(\delta_{ij}-\psi_j^{\bar\pi})} & \leq \delta_{ij} \abs{\psi_{i}^{\pi} - \psi_{i}^{\bar{\pi}}} + \abs{ \psi_{i}^{\pi} \psi_{j}^{\pi} - \psi_{i}^{\bar{\pi}} \psi_{j}^{\bar{\pi}} } \\ & \leq \abs{\psi_{i}^{\pi} - \psi_{i}^{\bar{\pi}}} + \psi_j^{\pi} \abs{\psi_{i}^{\pi} - \psi_{i}^{\bar{\pi}}} + \psi_{i}^{\bar{\pi}} \abs{\psi_{j}^{\pi} - \psi_{j}^{\bar{\pi}}} \\ & \leq C_{0} \Delta_{\pi} \left( 1 + \psi_{j}^{\bar{\pi}} + \psi_{i}^{\bar{\pi}} + \psi_{j}^{\bar{\pi}} - \psi_{j}^{\pi} \right) \\ & \leq C_{0} \Delta_{\pi} \left(2 + C_{0} \Delta_{\pi}\right) =: C_{1} \Delta_{\pi}, \end{align}\] using the fact that \(\set{\psi_{i}^{\bar{\pi}}}_{i=1}^n \in \Delta^{n-1}\) in the last inequality. Therefore, we deduce \[\begin{align} \opnorm{H^\pi_{ij}(\mu)-H^{\bar\pi}_{ij}(\mu)} & \leq C_{1} \Delta_{\pi} \expec{\norm{X-\mu_i}\norm{X-\mu_j}} + \delta_{ij} \expec{\abs{\psi_{i}^{\pi} - \psi_{i}^{\bar{\pi}}}} \\ & \leq C_{1} \Delta_{\pi} (\expec{\norm{X - \mu_{i}}^2})^{1/2} (\expec{\norm{X - \mu_j}^2})^{1/2} + C_{0} \Delta_{\pi} \\ & \leq C_{0} \Delta_{\pi} + 2C_{1} \Delta_{\pi} \left(m_{2} + M_{U}^2\right) \\ &= C_0 \Delta_{\pi} \left( 1 + 2(m_2 + M_{U}^2) (2 + C_{0} \Delta_{\pi}) \right), \end{align}\] again using Cauchy-Schwarz. Invoking 4 supplies the bound for the full Hessian. ◻

12 suggests that \(\mathcal{L}(\mu, \pi)\) tracks the reference objective \(\mathcal{L}(\mu, \bar{\pi})\) up to additive error \(\Delta_{\pi}\). However, its optimal value is an order of magnitude closer to \(\mathcal{L}(\theta^{\star})\). We record this bound in the next Corollary.

Corollary 6 (Optimal value bound of mismatched loss). Let \(U\) be a compact neighborhood of \(\mu^\star\) contained in the local identified regime, and define \[\mathcal{L}_{\pi}^{\dagger} := \min_{\mu \in U} \mathcal{L}(\mu,\pi).\] Then there exists a neighborhood \(V \subset \intr{\Delta^{m-1}}\) of \(\pi^{\star}\) and a constant \(C_{\mathrm{floor}}> 0\) satisfying \[\label{eq:mismatched-local-floor} \mathcal{L}_{\pi}^{\dagger} - \mathcal{L}(\theta^{\star}) \leq C_{\mathrm{floor}}\Delta_{\pi}^2, \;\; \text{for all \pi \in \set{\pi \in \Delta^{n-1} \mid \widehat{\pi} \in V }}.\tag{40}\]

Proof. Recall the collapsed model loss from 5; for any \(\nu \in \mathbb{R}^{dm}\) and \(\rho \in \Delta^{m-1}\), let \[\mathcal{L}_{\mathrm{coll}}(\nu, \rho) := D_{\mathrm{KL}}\!\left(p^\star\,\|\,\sum_{\ell=1}^m \rho_{\ell}\, \cN(\nu_{\ell}, I_{d})\right).\] The function \(\rho \mapsto \mathcal{L}_{\mathrm{coll}}(\nu^{\star}, \rho)\) is minimized at \(\rho = \pi^{\star} \in \intr{\Delta^{m-1}}\). As a result, we have \[\left.\grad_{\rho}\mathcal{L}_{\mathrm{coll}}(\nu^{\star}, \rho) \right|_{\rho = \pi^{\star}} = 0. \label{eq:collapsed-weight-gradient-vanishes}\tag{41}\] Now, let \(\nu^{\star}: U \to \mathbb{R}^{dn}\) be the following map: \[\begin{align} \nu^{\star}(\mu) = \bmx{ \nu_{1}^{\star}(\mu) \\ \vdots \\ \nu_{n}^{\star}(\mu) }, \quad [\nu^{\star}(\mu)]_{i} = \nu^{\star}_{\ell}, \;\; \text{for any i \in S_{\ell}}. \end{align}\] For any \(\pi\) such that \(\norm{\widehat{\pi} - \pi^{\star}}\) is sufficiently small, we have that \[\begin{align} \mathcal{L}_{\pi}^{\dagger} - \mathcal{L}(\theta^{\star}) & = \min_{\mu \in U} \mathcal{L}(\mu, \pi) - \mathcal{L}(\theta^{\star}) \notag \\ & \leq \mathcal{L}(\nu^{\star}(\mu), \pi) - \mathcal{L}(\theta^{\star}) \notag \\ & = D_{\mathrm{KL}}\!\left(p^{\star}\,\|\,\sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \pi_{i} \mathcal{N}(\nu_{\ell}^{\star}, I_d)\right) - \mathcal{L}(\theta^{\star}) \tag{42} \\ & = \mathcal{L}_{\mathrm{coll}}(\nu^{\star}, \widehat{\pi}) - \mathcal{L}(\theta^{\star}) \notag \\ & = \underbrace{\mathcal{L}_{\mathrm{coll}}(\nu^{\star}, \pi^{\star})}_{\mathcal{L}(\theta^{\star})} + \ip{\grad_{\rho}\mathcal{L}(\nu^{\star}, \rho)|_{\rho = \pi^{\star}}, \widehat{\pi} - \pi^{\star}} + O(\norm{\widehat{\pi} - \pi^{\star}}^2) - \mathcal{L}(\theta^{\star}) \notag \\ &\lesssim \norm{\widehat{\pi} - \pi^{\star}}_1^2 \notag \\ &= \Delta_{\pi}^2, \tag{43} \end{align}\] where the last inequality follows from 41 and norm equivalence. ◻

2.0.4 Local acceleration↩︎

In this section, we prove that the second phase of 5 accelerates. As we focus on a single epoch of \(\texttt{GDPolyak}\), we drop all superscripts referencing the epoch index \(k\) for simplicity.

Setting the stage, we introduce the notation necessary to carry out the argument. We write \(\bar{\pi}\) for the reference weights associated with \(\pi\), as defined in 3, and write \(\mathcal{M}\) for the local \(C^{\infty}\) ravine of the reference objective \[\mu \mapsto \mathcal{L}(\mu, \bar{\pi}),\] which is guaranteed to exist by Corollary 4. We write \[\bar{\mu}_{\ell} := \frac{1}{\widehat{\pi}_{\ell}} \sum_{i \in S_{\ell}} \pi_{i} \mu_{i} \quad \text{and} \quad \mathsf{D}(\mu) := \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \pi_{i} \norm{\mu_{i} - \bar{\mu}_{\ell}}^2 \label{eq:group-average-dispersion}\tag{44}\] for the cluster average and dispersion from Corollary 3. Unless specified otherwise, we write \[y := P_{\mathcal{M}}(\mu), \label{eq:ravine-projection}\tag{45}\] where \(P_{\mathcal{M}}\) is guaranteed to be single-valued near \(\mathcal{M}\).

The forthcoming analysis shows that the iterates produced by applying \(\texttt{GDPolyak}\) to the weight-mismatched objective \(\mu \mapsto \mathcal{L}(\mu, \pi)\) approach a tube around the ravine \(\mathcal{M}\) at a linear rate; upon entering that tube, Polyak steps lead to a contraction up to a prescribed floor level \(O(\Delta_{\pi}^{2/3})\). Along \(\mathcal{M}\), the tangential loss \(\mathcal{L}\circ P_{\cM}\) behaves like a quartic. Consequently, for \(y\in \mathcal{M}\), the tangential gradient has scale \(\mathsf{D}(y)^{3/2}\). Specialized to our setting, the proof strategy of [34] motivates the tube condition \[\dist_{\cM}(\mu) \lesssim \mathsf{D}(y)^{3/2}.\] To formalize this, fix a proximity parameter \(\tau > 0\) and threshold \(\kappa > 0\). We define the following sets, which correspond to different phases of local convergence: \[\begin{align} \mathcal{T}_{\tau} & := \set{\mu \in \mathbb{R}^{dn} \mid \dist_{\cM}(\mu) \leq \tau \mathsf{D}(y)^{3/2}} \tag{46} \\ \mathcal{C}_{\kappa} & := \set{\mu \in \mathbb{R}^{dn} \mid \mathsf{D}(y) \leq \kappa \Delta_{\pi}^{2/3}} \tag{47} \\ \mathcal{A}_{\tau,\kappa} & :=\mathcal{T}_{\tau} \setD \mathcal{C}_{\kappa}. \tag{48} \end{align}\] The local analysis then separates into two phases:

(i) The normal phase, where \(\dist_{\cM}(\mu) \gg \mathsf{D}(y)^{3/2}\), so iterates lie outside the tube \(\mathcal{T}_{\tau}\).

(ii) The tangential phase, where \(\mathsf{D}(y) \gtrsim \max\set{\dist_{\cM}^{2/3}(\mu), \kappa \Delta_{\pi}^{2/3}}\), so iterates lie in \(\mathcal{A}_{\tau, \kappa}\).

During the normal phase, short gradient descent steps approach the tube \(\mathcal{T}_{\tau}\), whereupon Polyak steps successfully reduce the distance to \(\mu^{\star}\) along the manifold by a constant factor. The threshold \(\Delta_{\pi}\) saturates other quantities inside \(\mathcal{C}_{\kappa}\).

Before we proceed to the main proof we establish a few auxiliary results, specific to the local acceleration phase, that are frequently needed in our analysis. We will make repeated use of the fact that \(\mathsf{D}(\mu) \asymp \mathsf{D}(P_{\mathcal{M}}(\mu))\) when \(\mu \in \mathcal{T}_{\tau}\):

Lemma 7. There exists a neighborhood \(U\) of \(\mu^{\star}\) and constants \(c_1, c_2 > 0\) such that \[\label{eq:disp-y-disp-mu-comparison} c_1 \mathsf{D}(y) \leq \mathsf{D}(\mu) \leq c_2 \mathsf{D}(y), \;\; \text{for all \mu \in U \cap \mathcal{T}_{\tau}.}\tag{49}\]

Proof. The function \(\mathsf{D}(\cdot)\) is \(C^{\infty}\), thus Lipschitz on any compact set. It follows that \[\abs{\mathsf{D}(y)-\mathsf{D}(\mu)} = \abs{\mathsf{D}(P_{\mathcal{M}}(\mu)) - \mathsf{D}(\mu)} \leq C \cdot \norm{P_{\mathcal{M}}(\mu) - \mu} = C \cdot \dist_{\mathcal{M}}(\mu).\] Therefore, from the inclusion \(\mu \in \mathcal{T}_{\tau}\), it follows that \[\begin{align} \abs{\mathsf{D}(y)-\mathsf{D}(\mu)} \leq C\tau \mathsf{D}(y)^{3/2} \Rightarrow \bigl(1 - C \tau \sqrt{\mathsf{D}(y)}\bigr) \mathsf{D}(y) \leq \mathsf{D}(\mu) \leq \mathsf{D}(y) \bigl(1 + C \tau \sqrt{\mathsf{D}(y)}\bigr). \end{align}\] By shrinking \(U\) if necessary, we have \(\sqrt{\mathsf{D}(y)} \leq \tfrac{1}{2 C \tau}\), proving the claim for \(c_1 = \tfrac{1}{2}\), \(c_2 = \tfrac{3}{2}\). ◻

At the same time, we will need the following comparison that allows us to convert between the distance from \(P_{\mathcal{M}}(\mu)\) and the distance from \(\mu\) itself to \(\mu^{\star}\).

Lemma 8. There is a neighborhood \(U\) of \(\mu^{\star}\) and a constant \(C_{U} > 0\) such that \[\norm{P_{\mathcal{M}}(\mu) - \mu^{\star}} \leq \norm{\mu - \mu^{\star}} + C_{U} \norm{\mu - \mu^{\star}}^2, \quad \text{for all \mu \in U.} \label{eq:distance-conversion}\tag{50}\]

Proof. For \(\mu\) near \(\mu^{\star} \in \mathcal{M}\), the projection \(P_{\mathcal{M}}\) is \(C^{1}\). In particular, we have that \[\begin{align} y - \mu^{\star} & = P_{\mathcal{M}}(\mu) - \mu^{\star} \notag \\ & = P_{\mathcal{M}}(\mu^{\star}) - \mu^{\star} + \grad P_{\mathcal{M}}(\mu^{\star})(\mu - \mu^{\star}) + O(\norm{\mu - \mu^{\star}}^2) \notag \\ & = P_{\mathcal{T}_{\mu^{\star}}\mathcal{M}}(\mu - \mu^{\star}) + O(\norm{\mu - \mu^{\star}}^2), \label{eq:distance-along-ravine-taylor-expansion} \end{align}\tag{51}\] where the second equality follows by smoothness of the projection and the third equality follows from the fact that \(\grad P_{\mathcal{M}}(\bar{\mu}) = P_{\mathcal{T}_{\bar{\mu}} \mathcal{M}}\) for any \(\bar{\mu} \in \mathcal{M}\). Extracting the constant from the remainder term and labeling at \(C_{U}\) completes the proof. ◻

2.0.4.1 Trajectory analysis

The reference objective \(\mu \mapsto \mathcal{L}(\mu,\bar{\pi})\) is compatible with the theory developed in 2.0.2; Theorem 9 supplies local fourth-order growth, Corollary 4 verifies the hypotheses used in [34], and 6 provides a one-step contraction along the ravine for Polyak steps. We record this conclusion in the next Proposition:

Proposition 13 (Polyak step contraction for reference loss). Let \(P_{\mathcal{M}}\) denote the local projection onto \(\mathcal{M}\) on a neighborhood \(U\) of \(\mu^{\star}\) and write \[\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star}) = \underbrace{\mathcal{L}(P_{\mathcal{M}}(\mu), \bar{\pi})}_{\mathcal{L}_{T}(\mu)} + \underbrace{\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(P_{\mathcal{M}}(\mu), \bar{\pi})}_{\mathcal{L}_{N}(\mu)}. \label{eq:ref-loss-decomposition}\qquad{(3)}\] Moreover, define the reference Polyak update and “shadow” iterates \[\begin{align} \mu^{+} & := \mu - \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}} \cdot \frac{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}{\norm{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}}, \quad y := P_{\mathcal{M}}(\mu), \;\; y^{+} := P_{\mathcal{M}}(\mu^{+}). \label{eq:ref-polyak-update} \end{align}\qquad{(4)}\] By shrinking the set \(U\) if necessary, there exist numbers \(q \in (0, 1)\) and \(C > 0\) such that \[\norm{\grad \mathcal{L}_{N}(\mu)} \leq \frac{1}{100}\norm{\grad \mathcal{L}_{T}(y)} \implies \left\{ \; \begin{align} \norm{y^{+} - \mu^{\star}} & \leq q \norm{y - \mu^{\star}}, \;\; \text{and} \\ \dist_{\mathcal{M}}(\mu^+) & \leq C \norm{y - \mu^{\star}}. \end{align} \right. \label{eq:small-normal-grad-implies-contraction}\qquad{(5)}\]

Proof. The objective \(\mathcal{L}(\mu, \bar{\pi})\) admits a local solution set \(\set{\mu^{\star}}\), which is a singleton. The conclusion follows immediately by applying 6 with \(f^{\star} = \mathcal{L}(\theta^{\star}) = 0\). ◻

Naturally, 5 has no access to the reference weights \(\bar{\pi}\). Nevertheless, we will argue that the gradient used in 5 is not far from the gradient of the “reference” loss. The first ingredient is a collection of results showing that the tangent part of the loss behaves almost exactly like a quartic function inside \(\mathcal{T}_{\tau}\). In what follows, we always use \(\mathcal{L}_{T}\) and \(\mathcal{L}_{N}\) to refer to the tangent and normal parts of the reference loss, as defined in 13.

Lemma 9 (Tangent part scaling and gradient perturbation). For any sufficiently small \(\tau>0\), there exists a neighborhood \(V \subset U\) of \(\mu^{\star}\) and constants \(C \geq c > 0\) such that:

(i) For every \(y \in V \cap \mathcal{M}\), we have that \[\begin{align} c \cdot \norm{y - \mu^{\star}}^2 & \leq \mathsf{D}(y) \leq C \cdot \norm{y - \mu^{\star}}^2 \tag{52} \\ c \cdot \mathsf{D}(y)^2 & \leq \mathcal{L}_{T}(y) \leq C \cdot \mathsf{D}(y)^2 \tag{53} \\ c \cdot \mathsf{D}(y)^{\tfrac{3}{2}} & \leq \norm{\grad \mathcal{L}_{T}(y)} \leq C \cdot \mathsf{D}(y)^{\tfrac{3}{2}} \tag{54} \end{align}\]

(ii) For every \(\mu \in V \cap \mathcal{T}_{\tau}\), we have that \[\begin{align} \norm{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})} & \geq c \cdot \mathsf{D}(y)^{\tfrac{3}{2}} \tag{55} \\ \norm{\grad \mathcal{L}_{N}(\mu)} & \leq C \tau \mathsf{D}(y)^{\tfrac{3}{2}}. \tag{56} \end{align}\]

(iii) For every \(\mu \in V \cap \mathcal{A}_{\tau,\kappa}\), we have that \[\norm{\grad_{\mu} \mathcal{L}(\mu, \pi) - \grad_{\mu} \mathcal{L}(\mu, \bar{\pi})} \leq C \kappa^{-\tfrac{3}{2}} \norm{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}. \label{eq:improved-gradient-perturbation-in-annulus}\tag{57}\]

Proof. We first identify the tangent space of the reference loss ravine at \(\mu^\star\). Since \[\bar{\pi}_{i} = \pi_{i} \cdot \frac{\pi_{\ell}^{\star}}{\widehat{\pi}_{\ell}}, \;\; \text{for all i \in S_{\ell}},\] the following linear subspaces are equal: \[\begin{align} \mathcal{T} & := \set{u \in \mathbb{R}^{dn} \mid \sum_{i \in S_{\ell}} \pi_{i} u_{i} = 0, \; \text{for all \ell \in [m]}} \\ & = \set{u \in \mathbb{R}^{dn} \mid \sum_{i \in S_{\ell}} \bar{\pi}_{i} u_{i} = 0, \; \text{for all \ell \in [m]}}. \label{eq:equal-tangent-space} \end{align}\tag{58}\] By 8 4 applied to \(\mu \mapsto \mathcal{L}(\mu, \bar{\pi})\), \(\mathcal{T}\) is the tangent space of \(\mathcal{M}\) at \(\mu^{\star}\). Therefore, by 1, we deduce that \(y \in \mathcal{M}\) near \(\mu^{\star}\) can be written as \[y = \mu^{\star} + u + O(\norm{y - \mu^{\star}}^2), \;\; \text{where u \in \mathcal{T}_{\mu^{\star}} \mathcal{M}}.\] In particular, the dispersion \(\mathsf{D}(y)\) does not change up to first-order: indeed, \[\begin{align} \mathsf{D}(\mu^{\star} + u) & = \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \pi_{i} \norm[\Big]{ \mu^{\star}_{i} + u_{i} - \frac{1}{\widehat{\pi}_{\ell}} \sum_{j \in S_{\ell}} \pi_{j} (\mu^{\star}_j + u_{j}) }^2 = \sum_{\ell = 1}^{m} \sum_{i \in S_{\ell}} \pi_{i} \norm{u_{i}}^2, \end{align}\] where the second equality follows from 58 . Consequently, \[\mathsf{D}(y) = \sum_{i = 1}^{n} \pi_{i} \norm{u_{i}}^2 + O(\norm{u}^3). \label{eq:dispersion-near-mustar}\tag{59}\] Therefore, after shrinking the local neighborhood if necessary, we have \[c \cdot \norm{u}^2 \leq \mathsf{D}(y) \leq C \cdot \norm{u}^2.\] Finally, since \(\norm{y - \mu^\star} \asymp \norm{u}\), this proves 52 .

We now apply Item [item:tangent-part-p-growth] from 6 with \(p = 4\), which yields \[\begin{align} c \cdot \norm{y - \mu^{\star}}^4 & \leq \mathcal{L}_{T}(y) \leq C \cdot \norm{y - \mu^{\star}}^4, \\ c \cdot \norm{y - \mu^{\star}}^3 & \leq \norm{\grad \mathcal{L}_{T}(y)} \leq C \cdot \norm{y - \mu^{\star}}^3, \end{align}\] for all \(y \in V \cap \mathcal{M}\). Since \(\mathsf{D}(y) \asymp \norm{y - \mu^{\star}}^2\) by 52 , this proves 53 54 .

We now turn to the proof of Item [item:reference-gradient-pl-like]. In particular, we argue that the gradient of the tangent part dominates near \(\mu^{\star}\) via the decomposition furnished by 13. To that end, note that \(\mathcal{L}_{N}\) is \(C^{1}\) and vanishes along \(\mathcal{M}\). Therefore, its gradient is Lipschitz near \(\mathcal{M}\) and satisfies \[\norm{\grad \mathcal{L}_{N}(\mu)} \leq C \cdot \dist_{\mathcal{M}}(\mu) \leq C \tau \mathsf{D}(y)^{3/2}, \label{eq:normal-grad-ub}\tag{60}\] where the second inequality follows from the inclusion \(\mu \in \mathcal{T}_{\tau}\); this proves 56 .

On the other hand, 54 suggests that \[\norm{\grad \mathcal{L}_{T}(y)} \geq c \cdot \mathsf{D}(y)^{3/2}. \label{eq:tangent-grad-lb}\tag{61}\] Finally, using the tangent-normal decomposition from 13, we obtain \[\begin{align} \norm{\grad \mathcal{L}(\mu, \bar{\pi})} & \geq \norm{\grad \mathcal{L}_{T}(\mu)} - \norm{\grad \mathcal{L}_{N}(\mu)} \\ & \geq \norm{\grad \mathcal{L}_{T}(y)}(1 - C \dist_{\mathcal{M}}(\mu)) - C \tau \dist_{\mathcal{M}}(\mu) \\ & \gtrsim \norm{\grad \mathcal{L}_{T}(y)} - C' \tau \norm{\grad \mathcal{L}_{T}(y)} \\ & \gtrsim \norm{\grad \mathcal{L}_{T}(y)}, \end{align}\] where the first step follows from the reverse triangle inequality, the second inequality follows from [34] and 60 , and the last two inequalities follow from 61 and shrinking \(\tau\) if necessary. This proves 55 and Item [item:reference-gradient-pl-like].

Finally, we turn to the proof of Item [item:improved-gradient-perturbation-in-annulus]. Indeed, we have \[\begin{align} \norm{\grad_{\mu} \mathcal{L}(\mu,\pi)-\grad_{\mu} \mathcal{L}(\mu,\bar{\pi})} & \leq C_{U}^{(1)} \Delta_{\pi} \\ & \leq C_{U}^{(1)} \kappa^{-{3}/{2}} \mathsf{D}(y)^{3/2} \\ & \leq \frac{C_{U}^{(1)}}{c \cdot \kappa^{{3}/{2}}} \norm{\grad_{\mu} \mathcal{L}(\mu, \bar{\pi})}. \end{align}\] Here the first inequality follows from ?? , the second inequality follows from the inclusion \(\mu \in \mathcal{A}_{\tau, \kappa}\) and the last inequality follows from Item [item:reference-gradient-pl-like]. This proves Item [item:improved-gradient-perturbation-in-annulus]. ◻

9 (in particular, its last item) allows us to relate the denominators of the Polyak step applied to the mismatched and reference losses when \(\mu\) lies inside the annulus \(\mathcal{A}_{\tau, \kappa}\). To relate the numerators, we use a sharper perturbation bound than the estimate from 12 supplied by the next Lemma.

Lemma 10 (Perturbed loss on \(\mathcal{A}_{\tau, \kappa}\)). There exist a constant \(C > 0\) and a neighborhood \(V\) around \(\mu^{\star}\) such that for all \(\mu \in V\), the following holds: \[\begin{align} \label{eq:relative-value-absolute} \abs{\mathcal{L}(\mu, \pi) - \mathcal{L}(\mu, \bar{\pi})} \leq C \Delta_{\pi} \left( \Delta_{\pi} + \mathsf{D}(y) + \dist_{\mathcal{M}}(\mu) \right). \end{align}\tag{62}\] Consequently, when \(\mu \in \mathcal{A}_{\tau,\kappa}\), we have the improved bound: \[\begin{align} \label{eq:relative-value-relative} \abs{\mathcal{L}(\mu,\pi)-\mathcal{L}(\mu,\bar\pi)} \leq C \frac{\left(\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star}) \right)^{5/4}}{m \pi_{\min} \kappa^{3/2}}. \end{align}\tag{63}\] In particular, for fixed \(\tau\) and \(\kappa\), and after shrinking \(V\) if necessary, \[\begin{align} \label{eq:relative-value-relative-clean} \abs{\mathcal{L}(\mu,\pi)-\mathcal{L}(\mu,\bar\pi)} \leq \frac{C}{\kappa} \cdot \left(\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star})\right) \end{align}\tag{64}\] for every \(\mu\in V \cap \mathcal{A}_{\tau,\kappa}\), provided \(\mathsf{D}(y)\) is sufficiently small.

Proof. Define \(h(\mu) := \mathcal{L}(\mu, \pi) - \mathcal{L}(\mu, \bar{\pi})\); at \(\mu^{\star}\), \(h(\mu) = \mathcal{L}(\mu^{\star}, \pi)\) since the second loss term vanishes. We now analyze the growth of \(h\) near \(\mu^{\star}\). For any \(y \in \mathcal{M}\) near \(\mu^{\star}\), 1 yields \[y = \mu^{\star} + u + O(\norm{y - \mu^{\star}}^2), \;\; \text{where u \in \mathcal{T}_{\mu^{\star}}\mathcal{M}.} \label{eq:local-C2-expansion-again}\tag{65}\] Using this estimate in a second-order Taylor expansion of \(h(\mu)\), we deduce that \[\begin{align} h(y) - h(\mu^{\star}) & = \ip{\grad h(\mu^{\star}), u} + \frac{1}{2} \ip{u, \grad^2 h(\mu^{\star}), u} + O(\Delta_{\pi} \norm{y - \mu^{\star}}^2), \label{eq:function-gap-second-order} \end{align}\tag{66}\] where the last term in 66 follows from the following claim:

Claim 1. Fix \(y \in \mathcal{M}\) with the expansion 65 . Then \[\ip{\grad h(\mu^{\star}), y - \mu^{\star} - u} = O(\Delta_{\pi} \norm{y - \mu^{\star}}^2)\]

Proof. Clearly, \(\ip{\grad h(\mu^{\star}), y - \mu^{\star} - u} = O(\norm{\grad h(\mu^{\star})} \norm{y - \mu^{\star}}^2)\). Moreover, we have \[\begin{align} \norm{\grad h(\mu^{\star})} & = \norm{\grad \mathcal{L}(\mu^{\star}, \pi) - \grad \mathcal{L}(\mu^{\star}, \bar{\pi})} \\ & \leq C_{U}^{(1)} \Delta_{\pi}, \end{align}\] where the inequality follows from ?? . This completes the proof of the Claim. ◻

We now simplify the terms on the RHS of 66 . We focus on the gradient first.

Claim 2. For any \(u \in \mathcal{T}_{\mu^{\star}}\mathcal{M}\), \(\ip{\grad h(\mu^{\star}), u} = 0\).

Proof. From 4 it follows that \(\mathcal{L}(\mu^{\star}, \bar{\pi}) = 0\) with \(\mu^{\star}\) an isolated minimizer. Therefore, \(\grad h(\mu^{\star}) = \grad \mathcal{L}(\mu^{\star}, \pi)\). By 2, we have \[\begin{align} [\grad \mathcal{L}(\mu^{\star}, \pi)]_{i} & = \expec[X \sim p^{\star}]{\psi_{i}(X; \mu^{\star}, \pi)(\mu_{i}^{\star} - X)}, \\ \psi_{i}(X; \mu^{\star}, \pi) & = \frac{\pi_{i} \phi(X \mid \mu^{\star}_{i})}{\sum_{q=1}^{n} \pi_{q} \phi(X \mid \mu_{q}^{\star})} \\ & = \frac{\pi_{i} \phi(X \mid \mu^{\star}_{\ell})}{ \sum_{j = 1}^{m} \widehat{\pi}_{j} \phi(X \mid \mu_{j}^{\star}) } \\ & = \frac{\pi_{i}}{\widehat{\pi}_{\ell}} \cdot \frac{\widehat{\pi}_{\ell} \phi(X \mid \mu^{\star}_{\ell})}{ \sum_{j = 1}^{m} \widehat{\pi}_{j} \phi(X \mid \mu^{\star}_{j}) } \\ & = \pi_{i} \cdot \frac{\gamma_{\ell}(X; \mu^{\star})}{\widehat{\pi}_{\ell}}, \end{align}\] writing \(\gamma_{\ell}\) for the \(\ell^{\text{th}}\) responsibility of the collapsed model where all students in \(S_{\ell}\) have means equal to \(\mu^{\star}_{\ell}\). The preceding display shows \(\psi_{i}(X; \mu^{\star}, \pi) = \frac{\pi_i}{\pi_j} \psi_{j}(X; \mu^{\star}, \pi)\) whenever \(i, j \in S_{\ell}\). Expanding the expression \(\ip{\grad \mathcal{L}(\mu^{\star}, \pi), u}\), we obtain \[\begin{align} \ip{\grad \mathcal{L}(\mu^{\star}, \pi), u} & = \expec[X \sim p^{\star}]{ \sum_{i = 1}^{n} \psi_{i}(X; \mu^{\star}, \pi)\ip{\mu_{i}^{\star} - X, u_i} } \\ & = \expec[X \sim p^{\star}]{ \sum_{\ell = 1}^{m} \ip[\Big]{\mu^{\star}_{\ell} - X, \sum_{i \in S_{\ell}} \psi_{i}(X; \mu^{\star}, \pi) u_i} } \\ & = \expec[X \sim p^{\star}]{ \sum_{\ell = 1}^{m} \ip[\Big]{\mu^{\star}_{\ell} - X, \frac{\gamma_{\ell}(X; \mu^{\star})}{\widehat{\pi}_{\ell}} \sum_{i \in S_{\ell}} \pi_{i} u_i} } \end{align}\] Finally, by an argument identical to the one used in the proof of 9, we deduce that \(\sum_{i \in S_{\ell}} \pi_{i} u_{i} = 0\), since \(u \in \mathcal{T}_{\mu^{\star}}\mathcal{M}\). This completes the proof. ◻

With 2 at hand, we turn to the quadratic form induced by the Hessian. We have \[\begin{align} \abs{\ip{u, \grad^2 h(\mu^{\star}) u}} & = \abs{\ip{u, (\grad^2 \mathcal{L}(\mu^{\star}, \pi) - \grad^2 \mathcal{L}(\mu^{\star}, \bar{\pi})) u}} \\ & \leq \norm{u}^2 \cdot C_{U}^{(2)} \Delta_{\pi} \\ & \lesssim \norm{y - \mu^{\star}}^2 C_{U}^{(2)} \Delta_{\pi} \\ & \lesssim \mathsf{D}(y) \cdot \Delta_{\pi}, \end{align}\] where the penultimate inequality follows from the tangent-normal decomposition of \(y\) and the last inequality follows from 52 . We conclude that, for \(y \in \mathcal{M} \cap V\), where \(V\) is defined in 9, \[h(y) - h(\mu^{\star}) = O(\Delta_{\pi} \cdot \mathsf{D}(y)) \label{eq:grad-diff-on-manifold}\tag{67}\] Now, suppose that \(\mu \notin \mathcal{M}\) with \(y = P_{\mathcal{M}}(\mu)\). By the mean value theorem, we have for \(t\in[0,1]\) \[\begin{align} \abs{h(\mu) - h(y)} & = \abs{\ip{\grad h(y + t(\mu - y)), \mu - y}} \\ & \leq \norm{\grad h(y + t(\mu - y))} \cdot \dist_{\mathcal{M}}(\mu) \\ & \leq C_{U}^{(1)} \Delta_{\pi} \cdot \dist_{\mathcal{M}}(\mu), \end{align}\] where the last inequality follows from the estimate ?? . From this and 67 , we deduce \[\abs{h(\mu) - h(\mu^{\star})} \leq C \Delta_{\pi} \left(\dist_{\mathcal{M}}(\mu) + \mathsf{D}(y)\right). \label{eq:h-diff}\tag{68}\] Finally, the derivation used between 42 and 43 in 6 supplies the bound \[h(\mu^{\star}) = \mathcal{L}(\mu^{\star}, \pi) - \mathcal{L}(\theta^{\star}) \lesssim \Delta_{\pi}^2,\] from which 62 immediately follows: \[\abs{h(\mu)} \leq C\Delta_{\pi} \left(\Delta_{\pi}+\mathsf{D}(y)+\dist_{\mathcal{M}}(\mu)\right).\]

To prove 63 , recall \(\mu \in \mathcal{A}_{\tau,\kappa}\) yields \[\mathsf{D}(y) \geq \kappa \Delta_{\pi}^{2/3}, \;\; \text{and} \;\; \dist_{\mathcal{M}}(\mu) \leq \tau \mathsf{D}(y)^{3/2}.\] Plugging these into the right-hand side of 62 leads to \[\begin{align} \abs{h(\mu)} & \lesssim \kappa^{-{3}/{2}}\mathsf{D}(y)^{{5}/{2}} \left( 1 + \kappa^{-{3}/{2}}\mathsf{D}(y)^{{1}/{2}} + \tau \mathsf{D}(y)^{{1}/{2}} \right) \\ & \leq C \cdot \kappa^{-3/2} \mathsf{D}(y)^{5/2}, \end{align}\] assuming \(\mathsf{D}(y)\) is sufficiently small. From proximity to \(\mu^{\star}\), the growth bound from 4 and the bias-dispersion decomposition from 3, it follows that \[\mathsf{D}(y)^2 \lesssim \frac{1}{m \pi_{\min}} \left( \mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star}) \right) \implies \abs{h(\mu)} \lesssim C \cdot \frac{(\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star}))^{5/4}}{\kappa^{3/2}}.\] This proves 63 , from which 64 easily follows. ◻

The previous two lemmas supply the relative denominator and numerator estimates needed to compare a Polyak step on the weight-mismatched objective with a Polyak step on the reference objective inside the annulus \(\mathcal{A}_{\tau, \kappa}\). We record that comparison below.

Lemma 11 (Polyak step comparison on \(\mathcal{A}_{\tau, \kappa}\)). Define the following two quantities: \[\begin{align} \mu^{+} & := \mu - \frac{\mathcal{L}(\mu, \pi)}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} \cdot \grad \mathcal{L}(\mu, \pi) \tag{69} \\ \bar{\mu}^{+} & := \mu - \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2} \cdot \grad \mathcal{L}(\mu, \bar{\pi}). \tag{70} \end{align}\] For any sufficiently small \(\tau > 0\), and after shrinking \(V\) if necessary, there exists a constant \(C > 0\) and a threshold \(\kappa_{0} \geq 1\) such that for any \(\kappa \geq \kappa_{0}\) and \(\mu \in V \cap \mathcal{A}_{\tau, \kappa}\), the following hold: \[\begin{align} \norm{\mu^{+} - \bar{\mu}^{+}} & \leq \frac{C}{\kappa^{3/2}} \cdot \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}} \leq \frac{C}{\kappa} \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}}. \label{eq:relative-polyak-comparison-distance} \end{align}\tag{71}\]

Proof. Fix \(\mu \in V \cap \mathcal{A}_{\tau, \kappa}\) and denote \(h(\mu) := \mathcal{L}(\mu, \pi) - \mathcal{L}(\mu, \bar{\pi})\). We have \[\begin{align} \abs{h(\mu)} & \leq \frac{C}{\kappa^{3/2}} \left(\mathcal{L}(\mu, \bar{\pi}) - \mathcal{L}(\theta^{\star})\right)^{5/4}, \tag{72} \\ \norm{\grad h(\mu)} & \leq \frac{C}{\kappa^{3/2}} \norm{\grad \mathcal{L}(\mu, \bar{\pi})}, \tag{73} \end{align}\] with 72 following from 63 and 73 following from Item ([item:improved-gradient-perturbation-in-annulus]) of 9.

We now compare the Polyak steps themselves. Since \(\mathcal{L}(\theta^{\star}) = 0\), we have \[\begin{align} \norm{\mu^{+} - \bar{\mu}^{+}} & = \norm[\Big]{ \underbrace{\frac{\mathcal{L}(\mu, \pi)}{\norm{\grad \mathcal{L}(\mu, \pi)}^2}}_{\zeta_{\pi}} \cdot \grad \mathcal{L}(\mu, \pi) - \underbrace{\frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2}}_{\zeta_{\bar{\pi}}} \cdot \grad \mathcal{L}(\mu, \bar{\pi}) } \notag \\ & \leq \abs{\zeta_{\pi} - \zeta_{\bar{\pi}}} \norm{\grad \mathcal{L}(\mu, \bar{\pi})} + \zeta_{\pi} \cdot \norm{\grad h(\mu)}. \label{eq:polyak-step-difference} \end{align}\tag{74}\] We handle each term in 74 separately. First, we argue that \[\begin{align} \zeta_{\pi} \norm{\grad h(\mu)} & = \left[ \frac{h(\mu)}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} + \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} \right] \cdot \norm{\grad h(\mu)} \notag \\ & \leq \left[ \frac{C \kappa^{-3/2} \mathcal{L}(\mu, \bar{\pi})^{5/4} + \mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} \right] \cdot \norm{\grad h(\mu)} \notag \\ & \leq (1 + \epsilon) \cdot \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \pi)}^2} \cdot \frac{C}{\kappa^{3/2}} \norm{\grad \mathcal{L}(\mu, \bar{\pi})} \notag \\ & \leq \frac{(1 + \epsilon) C \kappa^{-3/2}}{(1 - C \kappa^{-3/2})^2} \cdot \zeta_{\bar{\pi}} \norm{\grad \mathcal{L}(\mu, \bar{\pi})} \notag \\ & \leq \frac{C}{\kappa^{3/2}} \cdot \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}}, \label{eq:polyak-step-diff-i} \end{align}\tag{75}\] where the first inequality follows from 72 , the second inequality follows from 73 and the fact that \(\mathcal{L}(\mu, \bar{\pi})\) dominates \(\mathcal{L}(\mu, \bar{\pi})^{5/4}\) when \(\mu\) is sufficiently close to \(\mu^{\star}\), the penultimate inequality again follows from 73 , and the last inequality follows from adjusting \(\kappa\) and \(C\) and relabeling.

Now, we bound \(\abs{\zeta_{\pi} - \zeta_{\bar{\pi}}}\). Indeed, we obtain the difference \[\begin{align} \abs{\zeta_{\pi} - \zeta_{\bar{\pi}}} & = \abs*{\frac{\mathcal{L}(\mu, \pi)}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2 (1 + O(C\kappa^{-3/2}))^2} - \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2}} \notag \\ & = \abs*{ \frac{h(\mu)}{\norm{\grad \mathcal{L}(\mu,\bar{\pi})}^2 (1 + O(C \kappa^{-3/2}))^2} - \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2} \left[ 1 - \frac{1}{(1 + O(C \kappa^{-3/2}))^2} \right] } \notag \\ & \lesssim \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}^2} \abs*{ \frac{(1 + O(C \kappa^{-3/2}))^2 - 1}{(1 + O(C \kappa^{-3/2}))^2} } \notag \\ & \leq \frac{C}{\kappa^{3/2}} \cdot \zeta_{\bar{\pi}}, \label{eq:polyak-step-diff-ii} \end{align}\tag{76}\] again using 72 and 73 , as well as adjusting \(\kappa\) and \(C\) and relabeling if necessary. Finally, we plug 75 76 into 74 to obtain the first inequality in 71 : \[\begin{align} \norm{\mu^{+} - \bar{\mu}^{+}} & \leq \frac{2C}{\kappa^{3/2}} \cdot \frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}}. \end{align}\]

We now prove the second inequality in 71 . From the tangent-normal expansion, we deduce \[\begin{align} \mathcal{L}(\mu, \bar{\pi}) & = \mathcal{L}_{T}(y) + \mathcal{L}_{N}(\mu) \lesssim \mathsf{D}(y)^2 + \dist^2_{\mathcal{M}}(\mu) \lesssim \mathsf{D}(y)^2 + \tau^2 \mathsf{D}(y)^3, \end{align}\] where the first inequality follows from Item ([item:reference-ravine-tangent-growth]) of 9 and the fact that \(\mathcal{L}_{N}\) is \(C^{\infty}\) and minimized on \(\mathcal{M}\), and the second inequality follows from \(\mu \in \mathcal{T}_{\tau}\). After shrinking \(V\) if necessary, the term \(\tau^2\mathsf{D}(y)^3\) is absorbed into \(\mathsf{D}(y)^2\). On the other hand, Item ([item:reference-gradient-pl-like]) of 9 gives \[\norm{\grad \mathcal{L}(\mu, \bar{\pi})} \gtrsim \mathsf{D}(y)^{3/2}.\] using Item ([item:reference-gradient-pl-like]) of 9. Combining the two inequalities yields \[\frac{\mathcal{L}(\mu, \bar{\pi})}{\norm{\grad \mathcal{L}(\mu, \bar{\pi})}} \lesssim \mathsf{D}(y)^{1/2} \lesssim \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}},\] where the last inequality follows from Item ([item:reference-ravine-tangent-growth]) of 9. This proves 71 , after potentially enlarging the constant \(C > 0\). ◻

Corollary 13 is applicable to iterates near the manifold \(\mathcal{M}\); however, the Polyak step may push \(\mu^{+}\) (respectively, \(\bar{\mu}^{+}\)) far from the manifold and outside the annulus \(\mathcal{A}_{\tau, \kappa}\). Our next result shows that, outside the tube \(\mathcal{T}_{\tau}\), short gradient steps on \(\mathcal{L}(\mu, \pi)\) reduce the distance \(\dist_{\mathcal{M}}(\mu)\). To do so, we leveraging the perturbative analysis in 12. First, we record a sufficient condition for re-entering the annulus \(\mathcal{A}_{\tau, \kappa}\).

Lemma 12 (Gradient descent approaches the ravine). Fix \(\mu^{(0)} := \mu\) and define \[\mu^{(j+1)}=\mu^{(j)}- \eta \grad \mathcal{L}(\mu^{(j)},\pi).\] Then, for any fixed \(\rho>0\), there exists a neighborhood \(U\) of \(\mu^\star\), a stepsize threshold \(\eta_{\mathsf{ub}}>0\), and constants \(c,C>0\) such that the following holds: if \(\eta < \eta_{\mathsf{ub}}\), \(\mu^{(j)}\in U \setD \mathcal{C}_{\kappa}^{\mathrm{split}}\) and \(\mu^{(j)}\notin\mathcal{T}_{\tau}\) for all \(j=0,...,k-1\), we have that: \[\dist_{\mathcal{M}}(\mu^{(j+1)}) \leq \left[ 1 - c \eta + \frac{C \eta}{\tau} \left(\rho + \frac{1}{\kappa^{3/2}}\right) \right] \cdot \dist_{\mathcal{M}}(\mu^{(j)}).\] Consequently, if the following inequalities hold: \[\begin{align} \label{eq:short-gd-annulus-entry-size} \frac{C}{\tau}\left(\rho+\kappa^{-3/2}\right) \leq \frac{c}{2} \quad \text{and} \quad (1-\tfrac c2\eta)^k \dist_{\mathcal{M}}(\mu^{(0)}) \leq \tau\mathsf{D}(y^{(k)})^{3/2}, \end{align}\tag{77}\] then it follows that \(\mu^{(k)} \in \mathcal{A}_{\tau, \kappa}\).

Proof. We first analyze one step of gradient descent for the reference objective. Since \(\mathcal{M}\) is a local \(C^\infty\) Morse ravine \(\mathcal{L}(\mu, \bar{\pi})\), there is a neighborhood \(U\) of \(\mu^{\star}\) on which \[\mu = y + \xi, \;\; \text{where} \;\; y = P_{\mathcal{M}}\mu, \; \xi \perp \mathcal{T}_{y}\mathcal{M} \;\; \text{and} \;\; \norm{\xi} \leq \dist_{\mathcal{M}}(\mu). \label{eq:tangent-normal-expansion}\tag{78}\] Consequently, Corollary 2, with the coefficient \(\rho>0\), shows that there exists \(c>0\) such that \[\begin{align} \label{eq:reference-ravine-normal-splitting} \norm{\xi-\eta\grad_{\mu} \mathcal{L}(\mu,\bar{\pi})} \leq (1 - c \eta) \dist_{\mathcal{M}}(\mu) + \rho \eta \cdot \dist(y, \mathcal{S}^{\star})^{3}, \end{align}\tag{79}\] for all \(\mu \in U\) and \(\eta \in (0, \eta_{\mathsf{ub}})\); the exponent \(p-1 = 3\) since \(\mathcal{L}(\mu, \bar{\pi})\) has \(4^{\text{th}}\)-order growth near \(\mu_{\star}\).

We now analyze a step of gradient descent on the mismatched objective. We obtain \[\begin{align} \dist_{\mathcal{M}}(\mu^{+}) & = \inf_{u \in \mathcal{M}} \norm{\mu^{+} - u} \notag \\ & \leq \norm{\mu^{+} - P_{\mathcal{M}} \mu} \notag \\ & = \norm{\mu - P_{\mathcal{M}}\mu - \eta \grad_{\mu} \mathcal{L}(\mu, \pi)} \notag \\ & \leq \norm{\xi - \eta \grad_{\mu} \mathcal{L}(\mu, \bar{\pi})} + \eta C_{U}^{(1)} \Delta_{\pi} \notag \\ & \leq (1 - c \eta) \dist_{\mathcal{M}}(\mu) + \rho \eta \cdot \dist(y, \mathcal{S}^{\star})^{3} + \eta C_{U}^{(1)} \Delta_{\pi}, \label{eq:ravine-normal-splitting-master-bound} \end{align}\tag{80}\] where the penultimate inequality follows from 78 and Item (ii) of 12 and the last inequality follows from 79 . It remains to show that the last two terms on the RHS are controlled by \(\mathsf{D}(y)^{3/2}\).

We focus on \(\Delta_{\pi}\) first. Since \(\mu \notin \mathcal{C}_{\kappa}\), we have \[\Delta_{\pi}^{2/3} \leq \frac{1}{\kappa} \mathsf{D}(y) \quad\Longrightarrow\quad \eta C_{U}^{(1)} \Delta_{\pi} \leq \eta C_{U}^{(1)}\kappa^{-3/2}\mathsf{D}(y)^{3/2}. \label{eq:delta-pi-residual-dominated}\tag{81}\] At the same time, Item ([item:reference-ravine-tangent-growth]) of 9 shows that \[\dist(y,\mathcal{S}^\star)^3 \leq C\mathsf{D}(y)^{3/2}.\] Plugging 81 and the preceding inequality into 80 , and enlarging \(C\) if necessary, we obtain \[\dist_{\mathcal{M}}(\mu^+) \leq (1 - c \eta)\dist_{\mathcal{M}}(\mu) + C\eta(\rho+\kappa^{-3/2})\mathsf{D}(y)^{3/2}. \label{eq:ravine-normal-splitting-master-bound-simplified}\tag{82}\] Now write \(y^{(j)} = P_{\mathcal{M}}(\mu^{(j)})\) and suppose that \(\mu^{(0)}, \dots, \mu^{(k-1)} \notin \mathcal{T}_{\tau}\). This means \[\mathsf{D}(y^{(j)})^{3} \leq \frac{\dist_{\mathcal{M}}^2(\mu^{(j)})}{\tau^2}.\] Plugging this back into 82 , we obtain the one-step improvement \[\dist_{\mathcal{M}}(\mu^{(j+1)}) \leq \left[ 1 - c \eta + \frac{C \eta}{\tau} \left(\rho + \frac{1}{\kappa^{3/2}}\right) \right] \cdot \dist_{\mathcal{M}}(\mu^{(j)}).\] By the first condition in 77 , the last term inside the contraction factor is less than \(\tfrac{c}{2}\). Therefore, \[\dist_{\mathcal{M}}(\mu^{(j+1)}) \le (1-\tfrac c2\eta) \dist_{\mathcal{M}}(\mu^{(j)}).\] Applying the preceding estimate successively for \(j=0,\dots,k-1\), we obtain \[\begin{align} \dist_{\mathcal{M}}(\mu^{(k)}) & \leq (1-\tfrac c2\eta)^k\dist_{\mathcal{M}}(\mu^{(0)}). \end{align}\] By the second condition in 77 , \[\dist_{\mathcal{M}}(\mu^{(k)}) \le \tau\mathsf{D}(y^{(k)})^{3/2}.\] We conclude that \(\mu^{(k)}\in\mathcal{T}_\tau\), whence \(\mu^{(k)} \in \mathcal{A}_{\tau, \kappa}\) as \(\mu^{(k)} \in \mathcal{C}_{\kappa}\) by assumption. ◻

Theorem 14 (Contraction or convergence up to tolerance). Define the Polyak step \[\mu^+:= \mu-\frac{\mathcal{L}(\mu,\pi)-\mathcal{L}(\theta^\star)}{\norm{\grad_{\mu} \mathcal{L}(\mu,\pi)}^2} \grad_{\mu} \mathcal{L}(\mu, \pi).\] For any sufficiently small \(\tau > 0\), there is a neighborhood \(W \subset V\) of \(\mu^\star\), a constant \(C > 0\) and a threshold \(\kappa_{0}\ge 1\) such that exactly one of the following holds for every \(\kappa\ge \kappa_{0}\) and every \(\mu\in W \cap \mathcal{A}_{\tau,\kappa}\) (provided \(\Delta_{\pi}\) is sufficiently small):

  • either we have \(\mu^{+} \in \mathcal{C}_{\kappa}\); or,

  • the following contraction holds: \[\label{eq:tangential-annulus-contraction-or-core} \norm{P_{\mathcal{M}}(\mu^{+}) - \mu^{\star}} \leq \left(q + \frac{C}{\kappa}\right) \cdot \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}}.\tag{83}\]

In particular, after enlarging \(\kappa_{0}\) if necessary, we have \(q + \tfrac{C}{\kappa} < 1\).

Proof. Fix \(\kappa\ge \kappa_{0}\), \(\mu\in W\cap \mathcal{A}_{\tau,\kappa}\), and \(y:=P_{\mathcal{M}}(\mu),\) and suppose that \(\mu \notin \mathcal{C}_{\kappa}.\)

We first verify the antecedent condition in ?? . Since \(\mu\in \mathcal{A}_{\tau,\kappa}\subset \mathcal{T}_\tau\), we have \[\dist_{\mathcal{M}}(\mu)\le \tau \mathsf{D}(y)^{3/2}.\] Moreover, 56 combined with 54 shows \[\norm{\grad \mathcal{L}_N(\mu)} \lesssim \dist_{\mathcal{M}}(\mu) \leq C\tau \mathsf{D}(y)^{3/2} \lesssim \tau \norm{\grad \mathcal{L}_{T}(y)} \leq \frac{1}{100} \norm{\grad \mathcal{L}_{T}(y)},\] after shrinking \(\tau\) if necessary. We have the following chain of inequalities: \[\begin{align} \norm{P_{\mathcal{M}}(\mu^+) - \mu^{\star}} & \leq \norm{P_{\mathcal{M}}(\bar{\mu}^+) - \mu^{\star}} + \norm{P_{\mathcal{M}}(\mu^{+}) - P_{\mathcal{M}}(\bar{\mu}^+)} \\ & \leq q \cdot \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}} + C \norm{\mu^{+} - \bar{\mu}^{+}} \\ & \leq \left(q + \frac{C}{\kappa}\right) \norm{P_{\mathcal{M}}(\mu) - \mu^{\star}}, \end{align}\] where the second inequality follows from 13 and local Lipschitz continuity of \(P_{\mathcal{M}}\) and the last inequality follows from 11 and relabeling. Enlarging \(\kappa_{0}\) if necessary gives the desired contraction. ◻

Theorem 14 suggests that Polyak steps either contract the distance to \(\mu^{\star}\) along the ravine or enter the set \(\mathcal{C}_{\kappa}\), whereupon the algorithm makes no further progress. However, a Polyak step may land outside the annulus \(\mathcal{A}_{\tau, \kappa}\); our next result shows that gradient descent steps either restore proximity to the manifold without undoing the progress achieved by the Polyak step, or land inside \(\mathcal{C}_{\kappa}\) themselves.

Corollary 7 (Distance contraction after \(\texttt{GDPolyak}\) epochs). Fix \(\tau>0\) sufficiently small. After possibly shrinking the neighborhood \(W\subset V\) from 14, there exist constants \(q_{\mathrm{amb}}\in(0,1)\), \(\eta_{\mathrm{ub}}>0\), \(\kappa_0\ge1\), and \(\delta_\pi>0\) such that the following implication holds: Let \(\kappa\ge\kappa_0\), \(0<\eta<\eta_{\mathrm{ub}}\), and \(\mu\in W\cap\mathcal{A}_{\tau,\kappa}\), and assume \(\Delta_\pi\le\delta_\pi\). Let \[\mu^{(0)} := \mu- \frac{\mathcal{L}(\mu,\pi)-\mathcal{L}(\theta^\star)}{\norm{\grad_\mu\mathcal{L}(\mu,\pi)}^2} \grad_\mu\mathcal{L}(\mu,\pi),\] followed by gradient steps \(\mu^{(j+1)} = \mu^{(j)}-\eta\grad_\mu\mathcal{L}(\mu^{(j)},\pi)\), for \(j \geq 0\). Moreover, define \[K:= \min\set{ j\ge0: \mu^{(j)}\in\mathcal{T}_\tau\cup\mathcal{C}_\kappa}.\] If \(\mu^{(j)}\in W\) for all \(j=0,\dots,K\), then one of the following holds:

  • \(\mu^{(K)}\in\mathcal{C}_\kappa\); or

  • \(\norm{\mu^{(K)} - \mu^{\star}} \le q_{\mathrm{amb}} \norm{\mu - \mu^{\star}}.\)

Proof. Let \(y^{(j)}:=P_{\mathcal{M}}(\mu^{(j)})\), \(y := P_{\mathcal{M}}(\mu)\), and \(r:=\norm{y-\mu^\star}\); moreover, assume \(\mu^{(0)} \notin \mathcal{C}_{\kappa}\) (since otherwise the first alternative holds trivially). By 14, we have \[\label{eq:epoch-polyak-projected-contraction} \norm{P_{\mathcal{M}}(\mu^{(0)})-\mu^\star} \le \left(q+\frac{C}{\kappa}\right) \norm{y - \mu^{\star}}.\tag{84}\] After possibly enlarging \(C\), we have the inequality \[\label{eq:epoch-polyak-offshoot-bound} \dist_{\mathcal{M}}(\mu^{(0)}) \le \dist_{\mathcal{M}}(\bar\mu^{(0)}) + \norm{\mu^{(0)}-\bar\mu^{(0)}} \le \left(C + \frac{C}{\kappa}\right) \norm{y - \mu^{\star}} \leq C \norm{y - \mu^{\star}},\tag{85}\] where \(\bar{\mu}^{(0)}\) denotes the corresponding reference Polyak step, the second inequality follows from ?? applied to the reference Polyak step and 71 , and the last inequality uses \(\kappa\ge 1\).

If \(\mu^{(K)}\in\mathcal{C}_\kappa\), then the first alternative holds; henceforth, let \(\mu^{(K)}\notin\mathcal{C}_\kappa\). By definition of \(K\), this implies that \(\mu^{(K)} \in \mathcal{T}_{\tau} \setminus \mathcal{C}_{\kappa} = \mathcal{A}_{\tau, \kappa}\). It remains to show that gradient descent retains the progress made by the Polyak step towards the solution.

Claim 3. For every \(\varepsilon>0\), after shrinking \(W\) and enlarging \(\kappa_0\) if necessary, \[\label{eq:short-gd-projected-drift-claim} \norm{y^{(K)}-\mu^\star} \le \norm{y^{(0)}-\mu^\star} + \varepsilon \norm{y - \mu^{\star}}.\tag{86}\]

Proof. All occurrences of \(o_W(1)\) below are uniform over the iterates and tend to zero as the neighborhood \(W\) shrinks to \(\mu^\star\). Fix \(j<K\). Since \(P_{\mathcal{M}}\) is \(C^2\) locally, a Taylor expansion gives \[\begin{align} y^{(j+1)} & = P_{\mathcal{M}}(\mu^{(j)} - \eta \grad_{\mu} \mathcal{L}(\mu, \pi)) \\ & = P_{\mathcal{M}}(\mu^{(j)}) - \eta \grad P_{\mathcal{M}}(\mu) \grad_{\mu} \mathcal{L}(\mu^{(j)}, \pi) + O(\eta^2 \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \pi)}^2) \end{align}\] We focus on the first-order term above. In particular, we have \[\begin{align} & \grad P_{\mathcal{M}}(\mu^{(j)}) \grad \mathcal{L}(\mu^{(j)}, \pi) \\ & = \grad \mathcal{L}_{T}(y^{(j)}) + \grad P_{\mathcal{M}}(\mu^{(j)}) \grad \mathcal{L}(\mu^{(j)},\bar{\pi}) - \grad \mathcal{L}_{T}(y^{(j)}) + \grad P_{\mathcal{M}}(\mu^{(j)})(\grad \mathcal{L}(\mu^{(j)}, \pi) - \grad \mathcal{L}(\mu^{(j)}, \bar{\pi})) \\ & = \grad \mathcal{L}_{T}(y^{(j)}) + \grad P_{\mathcal{M}}(\mu^{(j)}) \grad \mathcal{L}(\mu^{(j)},\bar{\pi}) - \grad \mathcal{L}_{T}(y^{(j)}) + O(\Delta_{\pi}) \\ & = \grad \mathcal{L}_{T}(y^{(j)}) + o_{W}(1) \cdot \dist_{\mathcal{M}}(\mu^{(j)}) + O(\Delta_{\pi}), \end{align}\] where the penultimate equality follows from 12 and the last equality follows from Item (i) of [34]. Since \(\mu^{(j)}\notin\mathcal{C}_\kappa\), \(\Delta_\pi\le\kappa^{-3/2}\mathsf{D}(y^{(j)})^{3/2}\), and since \(\mu^{(j)}\notin\mathcal{T}_\tau\), \(\mathsf{D}(y^{(j)})^{3/2}\le\tau^{-1}\dist_{\mathcal{M}}(\mu^{(j)})\). Therefore, \[\grad P_{\mathcal{M}}(\mu^{(j)}) \grad \mathcal{L}(\mu^{(j)}, \pi) = \grad \mathcal{L}_{T}(y^{(j)}) + \left( o_{W}(1) + \frac{C \kappa^{-3/2}}{\tau}\right) \dist_{\mathcal{M}}(\mu^{(j)}).\] At the same time, the second-order remainder term satisfies \[\begin{align} \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \pi)} & \leq \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \pi) - \grad_{\mu} \mathcal{L}(\mu^{(j)}, \bar{\pi})} + \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \bar{\pi}) - \grad_{\mu} \mathcal{L}(\mu^{\star}, \bar{\pi})} \\ & \lesssim \Delta_{\pi} + \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \bar{\pi})} \\ & \leq \left( \tfrac{\mathsf{D}(y^{(j)})}{\kappa} \right)^{3/2} + \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \bar{\pi})} \\ & \leq \frac{\dist_{\mathcal{M}}(\mu^{(j)})}{\tau \kappa^{3/2}} + \norm{\grad_{\mu} \mathcal{L}(\mu^{(j)}, \bar{\pi})} \\ & \lesssim \frac{\dist_{\mathcal{M}}(\mu^{(j)})}{\tau \kappa^{3/2}} + o_{W}(1) \norm{\grad \mathcal{L}_{T}(\mu^{(j)})} + \dist_{\mathcal{M}}(\mu^{(j)}) \\ & \lesssim \frac{\dist_{\mathcal{M}}(\mu^{(j)})}{\tau \kappa^{3/2}} + o_{W}(1) \norm{\grad \mathcal{L}_{T}(y^{(j)})} + \dist_{\mathcal{M}}(\mu^{(j)}) \\ & \lesssim \frac{\dist_{\mathcal{M}}(\mu^{(j)})}{\tau \kappa^{3/2}} + o_{W}(1) \mathsf{D}(y)^{3/2} + \dist_{\mathcal{M}}(\mu^{(j)}) \\ & \lesssim \dist_{\mathcal{M}}(\mu^{(j)}), \end{align}\] where the second inequality follows from 12, the third inequality follows from \(\mu^{(j)} \notin \mathcal{C}_{\kappa}\), the fourth inequality follows from \(\mu^{(j)} \notin \mathcal{T}_{\tau}\), the fifth inequality follows from [34], the sixth inequality follows from local smoothness of \(\mathcal{L}_{T}\), the penultimate inequality follows from 9, and the last inequality follows from the fact that \(\mu^{(j)} \notin \mathcal{T}_{\tau}\). Putting everything together, \[\eta^2\norm{\grad_\mu\mathcal{L}(\mu^{(j)},\pi)}^2 \leq \eta^2 \dist_{\mathcal{M}}^2(\mu^{(j)}) \leq \eta^2 \norm{\mu^{(j)} - \mu^{\star}} \dist_{\mathcal{M}}(\mu) \leq \eta^2 o_W(1)\dist_{\mathcal{M}}(\mu^{(j)}),\] Absorbing the remainder into the first order term, we have \[y^{(j+1)} = y^{(j)} - \eta\grad\mathcal{L}_T(y^{(j)}) + \eta \left( o_{W}(1) + \frac{C \kappa^{-3/2}}{\tau} \right) O(\dist_{\mathcal{M}}(\mu^{(j)})).\] Therefore, we obtain the progress bound \[\begin{align} \norm{y^{(j+1)}-\mu^\star} & \le \norm{y^{(j)}-\eta\grad\mathcal{L}_T(y^{(j)})-\mu^\star} + \eta\left(o_{W}(1) + \frac{C \kappa^{-3/2}}{\tau}\right) \dist_{\mathcal{M}}(\mu^{(j)}) \notag \\ & \le \norm{y^{(j)}-\mu^\star} + \eta \left( o_W(1)+\frac{C}{\tau}\kappa^{-3/2} \right) \dist_{\mathcal{M}}(\mu^{(j)}), \label{eq:short-gd-progress-bound} \end{align}\tag{87}\] where the second inequality follows from [34].

Next, since \(\mu^{(j)}\notin\mathcal{T}_\tau\) and \(\mu^{(j)}\notin\mathcal{C}_\kappa\), the proof of 12 gives \[\begin{align} \dist_{\mathcal{M}}(\mu^{(j+1)}) & \le (1-c\eta)\dist_{\mathcal{M}}(\mu^{(j)}) + C\eta(\rho+\kappa^{-3/2})\mathsf{D}(y^{(j)})^{3/2} \notag \\ & \le \left[ 1-c\eta+\frac{C\eta}{\tau}(\rho+\kappa^{-3/2}) \right] \dist_{\mathcal{M}}(\mu^{(j)}) \notag \\ & \le (1-\tfrac c2\eta)\dist_{\mathcal{M}}(\mu^{(j)}), \label{eq:manifold-distance-contraction} \end{align}\tag{88}\] where the second inequality follows from the inclusion \(\mu^{(j)}\notin\mathcal{T}_\tau\) and the last inequality follows from choosing \(\rho\) and \(\kappa_0\) sufficiently small and sufficiently large, respectively, so that they satisfy \[\frac{C}{\tau}(\rho+\kappa^{-3/2})\le \frac{c}{2}.\] Iterating the inequality in 88 from \(j = 0\) to an arbitrary \(k < K\), we obtain \[\dist_{\mathcal{M}}(\mu^{(k)}) \le (1-\tfrac c2\eta)^k\dist_{\mathcal{M}}(\mu^{(0)}) \implies \eta\sum_{j=0}^{K-1}\dist_{\mathcal{M}}(\mu^{(j)}) \le \frac{2}{c}\dist_{\mathcal{M}}(\mu^{(0)}), \label{eq:manifold-distance-geometric-series}\tag{89}\] where the last inequality follows from the geometric series sum formula. Telescoping 87 , \[\begin{align} \norm{y^{(K)}-\mu^\star} & \le \norm{y^{(0)}-\mu^\star} + \eta \left( o_W(1)+\frac{C}{\tau}\kappa^{-3/2} \right) \sum_{j=0}^{K-1}\dist_{\mathcal{M}}(\mu^{(j)}) \\ & \le \norm{y^{(0)}-\mu^\star} + \frac{2}{c} \left( o_W(1)+\tau^{-1}\kappa^{-3/2} \right) \dist_{\mathcal{M}}(\mu^{(0)}) \\ & \le \norm{y^{(0)}-\mu^\star} + C \left( o_W(1)+\tau^{-1}\kappa^{-3/2} \right) \norm{y - \mu^{\star}}, \end{align}\] where the penultimate inequality follows from 89 and the last inequality follows from 85 and relabeling \(C\). Finally, we shrink \(W\) and enlarge \(\kappa_0\) so that \[C\left(o_W(1)+\tau^{-1}\kappa^{-3/2}\right)\le \varepsilon.\] This proves 86 . ◻

We now prove the contraction estimate. Combining 86 with 84 , we obtain \[\norm{P_{\mathcal{M}}(\mu^{(K)})-\mu^\star} \le \left(q+\frac{C}{\kappa}+\varepsilon\right) \norm{P_{\mathcal{M}}(\mu)-\mu^\star}.\] Choosing \(\varepsilon > 0\) sufficiently small and \(\kappa_0\) sufficiently large so that \[q+\frac{C}{\kappa}+\varepsilon =: q' <1 \qquad \text{for all }\kappa\ge\kappa_0,\] we obtain a contraction towards \(\mu^{\star}\) along the manifold for \(\mu^{(K)}\): \[\norm{P_{\mathcal{M}}(\mu^{(K)})-\mu^\star} \le q' \norm{P_{\mathcal{M}}(\mu)-\mu^\star}. \label{eq:almost-ambient-contraction}\tag{90}\] Finally, since \(\mu^{(K)}\in\mathcal{T}_\tau\) by definition of the hitting time \(K\), we have \[\dist_{\mathcal{M}}(\mu^{(K)}) \le \tau \mathsf{D}^{3/2}(y^{(K)}) \lesssim \tau \norm{y^{(K)} - \mu^{\star}}^{3}, \label{eq:last-iterate-distance-from-M}\tag{91}\] where the second inequality follows from Item [item:reference-ravine-tangent-growth] of 9. Consequently, \[\begin{align} \norm{\mu^{(K)} - \mu^{\star}} & \leq \norm{y^{(K)} - \mu^{\star}} + \dist_{\mathcal{M}}(\mu^{(K)}) \\ & \leq (1 + C \tau \norm{y^{(K)} - \mu^{\star}}^2) \norm{y^{(K)} - \mu^{\star}} \\ & \leq (1 + \varepsilon') \cdot q' \cdot \norm{y - \mu^{\star}} \\ &\leq (1 + \varepsilon') \cdot q' \cdot \big[ 1 + C_{W} \norm{\mu - \mu^{\star}} \big] \cdot \norm{\mu - \mu^{\star}}, \end{align}\] where the first inequality follows from the triangle inequality, the second inequality follows from 91 , the third inequality follows from 90 , and the last inequality follows from 8. We label \(q_{\mathrm{amb}} = (1 + \varepsilon') q' \cdot \big[1 + C_{W} \norm{\mu - \mu^{\star}}\big] < 1\) by suitably shrinking \(W\) if necessary. ◻

The reader may notice that 7 contains the inclusion \(\mu^{(j)} \in W\) as an explicit condition. Our final result shows that we can choose nested neighborhoods \(W_{\text{in}} \subset W_{\text{out}} \subset W\) such that every iterate remains in \(W_{\text{out}}\).

Lemma 13 (Gradient EM iterates remain close to \(\mu^{\star}\)). There exists a constant \(\lambda_{\mathsf{ub}} \in (0, 1)\) such that, for all \(\lambda < \lambda_{\mathsf{ub}}\), the following holds in the setting of 7: if \(\mu \in (\lambda W) \cap \mathcal{A}_{\tau, \kappa}\), then all iterates \(\mu^{(j)} \in W\) for \(j \in \set{1, \dots, K}\). In particular, \(\mu^{(K)} \in \lambda W\) itself.

Proof. Let \(W_{\text{out}} \equiv W\) and \(\tau_{W}\) denote the following stopping time: \[\tau_{W} := \inf\set{k \in \mathbb{N} \mid \mu^{(k)} \notin W_{\text{out}} },\] and suppose that \(\tau_{W} < K < \infty\), where \(K\) is the stopping time defined in 7. By definition, \(\mu^{(0)}, \dots, \mu^{(\tau_W - 1)} \in W_{\mathrm{out}}\). For the iterate \(\mu^{(\tau_W)}\) itself, we have \[\begin{align} \norm{\mu^{(\tau_W)} - \mu^{\star}} &\leq \norm{P_{\mathcal{M}}(\mu^{(\tau_W)}) - \mu^{\star}} + \dist_{\mathcal{M}}(\mu^{(\tau_W)}) \\ &\leq \norm{y^{(\tau_W)} - \mu^{\star}} + \left(1 - \frac{c \eta}{2}\right)^{(\tau_W)} \dist_{\mathcal{M}}(\mu^{(0)}) \\ &\leq \norm{y^{(0)} - \mu^{\star}} + \dist_{\mathcal{M}}(\mu^{(0)}) + \varepsilon \norm{y - \mu^{\star}} \\ &\leq (1 + \varepsilon) \norm{y - \mu^{\star}} + \dist_{\mathcal{M}}(\mu^{(0)}) \\ &\leq (1 + \varepsilon + C) \norm{y - \mu^{\star}} \\ &\leq (1 + \varepsilon + C) \left[1 + C_{W} \norm{\mu - \mu^{\star}} \right]\norm{\mu - \mu^{\star}} \end{align}\] where the second inequality follows from 12, the third inequality holds for any \(\varepsilon > 0\) by suitably shrinking \(W\) (following the proof of 3), the fourth inequality follows from 14, the penultimate inequality follows from 85 , and the last inequality follows from 8. By suitably shrinking \(W\) and defining \(W_{\text{in}} = (1 + \varepsilon + C)^{-1} W_{\text{out}} \subset W\), we arrive at a contradiction; therefore, \(\mu^{(j)} \in W_{\text{out}}\) for all \(j \leq K\). ◻

References↩︎

[1]
A. P. Dempster, N. M. Laird, and Donald B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39 (1): 1–38, 1977.
[2]
C. F. Jeff Wu. On the convergence properties of the EM algorithm. The Annals of Statistics, 11 (1): 95–103, 1983.
[3]
Richard A Redner and Homer F Walker. . SIAM review, 26 (2): 195–239, 1984.
[4]
Chi Jin, Yuchen Zhang, Martin J. Wainwright, Sivaraman Balakrishnan, and Michael I. Jordan. Local maxima in the likelihood of gaussian mixture models: Structural results and algorithmic consequences. In Advances in Neural Information Processing Systems, 2016.
[5]
Weihang Xu, Maryam Fazel, and Simon S Du. Toward global convergence of gradient em for over-parameterized gaussian mixture models. Advances in Neural Information Processing Systems, 37: 10770–10800, 2024.
[6]
Mo Zhou, Weihang Xu, Maryam Fazel, and Simon S. Du. Global convergence of gradient EM for over-parameterized gaussian mixtures. arXiv preprint arXiv:2506.06584, 2025. URL https://arxiv.org/abs/2506.06584.
[7]
Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin J Wainwright, Michael I Jordan, and Bin Yu. Singularity, misspecification and the convergence rate of EM. The Annals of Statistics, 48 (6): 3161–3182, 2020.
[8]
Stanislaw Łojasiewicz. A topological property of real analytic subsets. Coll. du CNRS, Les équations aux dérivées partielles, 117 (87-89): 2, 1963.
[9]
Boris Teodorovich Polyak. Gradient methods for minimizing functionals. Zhurnal vychislitel’noi matematiki i matematicheskoi fiziki, 3 (4): 643–653, 1963.
[10]
Hamed Karimi, Julie Nutini, and Mark Schmidt. Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition. In Joint European conference on machine learning and knowledge discovery in databases, pages 795–811. Springer, 2016.
[11]
Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu. Statistical guarantees for the em algorithm: From population to sample-based analysis. The Annals of Statistics, 45 (1), 2017. ISSN 0090-5364. .
[12]
Ji Xu, Daniel Hsu, and Arian Maleki. Global analysis of expectation maximization for mixtures of two gaussians. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NeurIPS’16, page 2684–2692, Red Hook, NY, USA, 2016. Curran Associates Inc. ISBN 9781510838819.
[13]
Constantinos Daskalakis, Christos Tzamos, and Manolis Zampetakis. Ten steps of em suffice for mixtures of two gaussians. In Conference on Learning Theory, pages 704–710. PMLR, 2017.
[14]
Bowei Yan, Mingzhang Yin, and Purnamrita Sarkar. Convergence of gradient em on multi-component mixture of gaussians. In I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 30. Curran Associates, Inc., 2017.
[15]
Ruofei Zhao, Yuanzhi Li, and Yuekai Sun. Statistical convergence of the em algorithm on gaussian mixture models. Electronic Journal of Statistics, 14 (1), January 2020. ISSN 1935-7524. .
[16]
Jeongyeol Kwon and Constantine Caramanis. . In Jacob Abernethy and Shivani Agarwal, editors, Proceedings of Thirty Third Conference on Learning Theory, volume 125 of Proceedings of Machine Learning Research, pages 2425–2487. PMLR, 09–12 Jul 2020. URL https://proceedings.mlr.press/v125/kwon20a.html.
[17]
Nimrod Segol and Boaz Nadler. Improved convergence guarantees for learning gaussian mixture models by EM and gradient EM. Electronic Journal of Statistics, 15 (2), January 2021. ISSN 1935-7524. .
[18]
Peter L. Bartlett, Philip M. Long, Gábor Lugosi, and Alexander Tsigler. Benign overfitting in linear regression. Proceedings of the National Academy of Sciences, 117 (48): 30063–30070, 2020. .
[19]
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal. Reconciling modern machine learning practice and the bias-variance trade-off. Proceedings of the National Academy of Sciences, 116 (32), 2019.
[20]
Mikhail Belkin, Daniel Hsu, and Ji Xu. Two models of double descent for weak features. Proceedings of the National Academy of Sciences, 117 (51): 32153–32160, 2020. .
[21]
Weihang Xu and Simon S. Du. Over-parameterization exponentially slows down gradient descent for learning a single neuron. In Gergely Neu and Lorenzo Rosasco, editors, Proceedings of the Thirty Sixth Conference on Learning Theory, volume 195 of Proceedings of Machine Learning Research, pages 1155–1198. PMLR, 2023.
[22]
Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin Wainwright, Michael Jordan, and Bin Yu. Sharp analysis of expectation-maximization for weakly identifiable models. In Silvia Chiappa and Roberto Calandra, editors, Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, pages 1866–1876. PMLR, 26–28 Aug 2020. URL https://proceedings.mlr.press/v108/dwivedi20a.html.
[23]
Nhat Ho and XuanLong Nguyen. On strong identifiability and convergence rates of parameter estimation in finite mixtures. Electronic Journal of Statistics, 10 (1), January 2016. ISSN 1935-7524. .
[24]
Judith Rousseau and Kerrie Mengersen. Asymptotic behaviour of the posterior distribution in overfitted mixture models. Journal of the Royal Statistical Society: Series B, 73 (5): 689–710, 2011.
[25]
Stephen J Wright. Identifiable surfaces in constrained optimization. SIAM Journal on Control and Optimization, 31 (4): 1063–1079, 1993.
[26]
Adrian S Lewis. Active sets, nonsmoothness, and sensitivity. SIAM Journal on Optimization, 13 (3): 702–725, 2002.
[27]
Claude Lemaréchal, François Oustry, and Claudia Sagastizábal. . Transactions of the American Mathematical Society, 352 (2): 711–729, 2000. ISSN 00029947. URL http://www.jstor.org/stable/118061.
[28]
Damek Davis, Dmitriy Drusvyatskiy, and Liwei Jiang. Asymptotic normality and optimality in nonsmooth stochastic approximation. The Annals of Statistics, 52 (4): 1485–1508, 2024.
[29]
Damek Davis, Dmitriy Drusvyatskiy, and Liwei Jiang. Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization. Foundations of Computational Mathematics, 26 (2): 779–861, January 2025. ISSN 1615-3383. .
[30]
Robert Mifflin and Claudia Sagastizábal. Proximal points are on the fast track. Journal of Convex Analysis, 9 (2): 563–580, 2002.
[31]
Warren L Hare and Adrian S Lewis. Identifying active constraints via partial smoothness and prox-regularity. Journal of Convex Analysis, 11 (2): 251–266, 2004.
[32]
D. Drusvyatskiy and A. S. Lewis. Optimality, identifiability, and sensitivity. Mathematical Programming, 147 (1-2): 467–498, November 2013. ISSN 1436-4646. .
[33]
Adrian S Lewis and Stephen J Wright. A proximal method for composite minimization. Mathematical Programming, 158 (1): 501–546, 2016.
[34]
Damek Davis, Dmitriy Drusvyatskiy, and Liwei Jiang. Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth. Mathematical Programming, pages 1–66, 2025.
[35]
Yudong Chen, Dogyoon Song, Xumei Xi, and Yuqian Zhang. Local minima structures in gaussian mixture models. IEEE Transactions on Information Theory, 70 (6): 4218–4257, 2024.
[36]
Boris Teodorovich Polyak. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9 (3): 14–29, 1969.
[37]
Solomon Kullback. Information theory and statistics. Courier Corporation, 1997.
[38]
Thomas J Rothenberg. Identification in parametric models. Econometrica: Journal of the Econometric Society, pages 577–591, 1971.
[39]
Henry Teicher. Identifiability of finite mixtures. The Annals of Mathematical Statistics, 34 (4): 1265–1269, December 1963. ISSN 0003-4851. .