← All parts of this equation

Equation 12 · Part 14 · The Hardest Unsolved Problems in Small and On-Device AI

Starting index or lower bound: i

L(θ)=Lnew(θ)+λ∑iFi(θi−θi∗)2,\mathcal{L}(\theta) = \mathcal{L}_{\mathrm{new}}(\theta) + \lambda \sum_{i} F_i\left(\theta_i - \theta_i^{*}\right)^2,
ii

What this part means

This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.

Its job in the formula

i appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.

The passage around this formula

…a per-parameter importance weight — commonly the diagonal of the Fisher information, FiF_i — from the old task, and adds it to the new loss: L(θ)=Lnew(θ)+λ∑iFi(θi−θi∗)2\mathcal{L}(\theta) = \mathcal{L}_{\mathrm{new}}(\theta) + \lambda \sum_{i} F_i\left(\theta_i - \theta_i^{*}\right)^2. where θi∗\theta_i^{*} is the old optimum for parameter i and λ\lambda sets how strongly the old task is protected. This equation exposes the actual trade rather than resolving it: raising λ\lambda protects old knowledge at the direct expense of how much the new update is allowed to change the model, and there is no value of λ\lambda that removes the trade…

Read this part in the article →

Learn the underlying idea

Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.

Open the illustrated sums and products: repeat an operation over an index guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.