Only the newest diagonal uses C3(4) = 0.993072. The historical block is frozen.
Sequential frozen-weight ORLS-SVDD
From un to α, iteration by iteration
Historical weights stay frozen while each arriving observation is optimized to convergence.
Recompute all dual coefficients from the current inverse; their entries always sum to one.
u3 → α iteration ledger
u₁, u₂ and their C values remain fixed.
| k | u3(k) | C3(k) | H33(k) | s3(k) | α(k) | z3(k) | u3(k+1) |
|---|---|---|---|---|---|---|---|
| 0 | -1.000000 | 1.000000 | 1.500000 | 1.330144 | (0.372340, 0.276596, 0.351064) | 0.017730 | -0.993732 |
| 1 | -0.993732 | 0.993732 | 1.503154 | 1.333297 | (0.372576, 0.277007, 0.350417) | 0.018557 | -0.993136 |
| 2 | -0.993136 | 0.993136 | 1.503456 | 1.333599 | (0.372598, 0.277047, 0.350355) | 0.018636 | -0.993078 |
| 3 | -0.993078 | 0.993078 | 1.503485 | 1.333629 | (0.372600, 0.277050, 0.350349) | 0.018644 | -0.993072 |
| 4 | -0.993072 | 0.993072 | 1.503488 | 1.333632 | (0.372600, 0.277051, 0.350349) | 0.018645 | -0.993071✓ |
Selected state
What changed when x3 arrived?
Current values follow the selected ledger row. “Before arrival” means the converged state after x2. “Previous iteration” means inner step k−1.
This inverse produces the selected row’s complete α vector.
Stored state after x2
This is the frozen upper-left block carried into the x3 calculation.
Compare H with the previous inner iteration
H33(4) − H33(3)
Restricted HQ optimization
What happens inside one arrival step
The superscript k is the inner iteration. The subscript n identifies the newly arriving observation.
Initialize the new weight
Earlier auxiliary variables are already part of the stored online state.
Convert weight to regularization
Here Cβν = 1, so the numerical value of Cn is simply −un.
Border the frozen system
The upper-left historical block Hn−1 is unchanged by design.
Update the inverse
With an = Hn−1−1δn, this scalar Schur complement determines the full block inverse.
Recompute all dual coefficients
Although only the new robust weight changes, every component of α responds to the new inverse. The equality constraint remains e⊤α = 1.
Close the feedback loop
Continue only while |un(k+1)−un(k)| ≥ 10⁻⁶.
Historical robust state
- u₁,…,un−1
- C₁,…,Cn−1
- The upper-left block Hn−1
New-point coupled state
- un(k) and Cn(k)
- Hn(k) and its inverse
- All αi(k), R², and zn(k)
Converged state
The final matrices after adding x₄
The three-point matrix is retained as the exact upper-left block. Only the fourth row, column, and adaptive diagonal are introduced.
Compare with the frozen three-point state
Numerical verification
The recursion returns the same sequential state
All comparisons use unrounded values. Differences at approximately 10⁻¹⁶ are ordinary floating-point roundoff.
Maximum H₄⁻¹ difference
Online block addition versus a four-point fit built with the identical frozen-history sequence.
Original H₃⁻¹ restored
Adding and then removing the newest point returns the previous sequential state.
Retained-state inverse
The downdate agrees with direct inversion on x₂,x₃,x₄ using their stored historical weights.