Taylor-Structured Online Adapter
Implementation & benchmark of arXiv:2609.03348 — Taylor-Informed Indirect Adaptive Predictive Control Using Jacobian-Frozen Affine Predictors
Source paper: Taylor-Informed Indirect Adaptive Predictive Control Using Jacobian-Frozen Affine Predictors arXiv:2609.03348 ⓘ · analyzed Sep 4, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Attach a small, online-adapted Taylor-polynomial residual model to a neural dynamics model instead of adapting all network weights. Construct the dictionary from the local Taylor structure, remove monomials forbidden by known joint-odd symmetry, and update its coefficients with recursive least squares. This yields fast adaptation with an interpretable parameter count and a direct test of whether the assumed symmetry is valid.
Formulas
Mathematical statement
Let $z=(x,u)$ be the concatenated state-input vector and let $\varphi_D^{\mathrm{FE}}(z)$ contain retained monomials through total degree $D$ selected from the forward-Euler/Taylor structure. The identified map is $\widehat{F}_{D,k}(z)=\widehat{\Theta}_{D,k}^{\top}\varphi_D^{\mathrm{FE}}(z)$, where $\widehat{\Theta}_{D,k}$ contains one coefficient vector per output dimension. For a measured transition $(z_k,x_{k+1})$, matrix RLS uses gain $K_k$, covariance $P_k$, forgetting factor $0<\lambda\le1$, and coefficient residual $e_k$. Joint-odd symmetry retains monomials with odd total degree and removes even-total-degree monomials; additional forward-Euler pruning removes interactions absent from the known local vector field.
Implementation notes
Use this as a lightweight adaptation head on a pretrained neural state-space or world model. Freeze the base network $h_\theta(z)$ and predict $x_{k+1}=h_\theta(z_k)+R_k^T\varphi_D^{\mathrm{FE}}(z_k)$, where $R_k$ is updated online by RLS; alternatively let the polynomial head replace the final transition layer. Build the monomial list once, remove even-total-degree monomials only when the environment has verified joint-odd symmetry, and apply forward-Euler pruning only when the corresponding interaction is physically absent. Pseudocode: initialize $R=0$, $P=\alpha I$; at each transition compute $\varphi_k$, residual $e_k=x_{k+1}-h_\theta(z_k)-R^T\varphi_k$, gain $K_k=P\varphi_k/(\lambda+\varphi_k^TP\varphi_k)$, update $R\leftarrow R+e_kK_k^T$, and update $P\leftarrow\lambda^{-1}(P-K_k\varphi_k^TP)$. The paper provides the Taylor-informed reduced dictionary and online RLS; the neural residual-head construction is the transfer. Compute covariance from $P$ and damp or reject updates when $\varphi_k^TP\varphi_k$ is excessively large. The first cheap experiment is a regime-shifted Lorenz-63 or nonlinear-pendulum dataset: pretrain on one parameter range, shift the parameter online, and compare full fine-tuning, unstructured polynomial RLS, and the symmetry/pruned adapter. The prediction is that, when symmetry is correct, even-degree coefficient estimates remain statistically indistinguishable from zero and the reduced adapter reaches a target one-step error with fewer samples. After a regime shift, adaptation error should decrease approximately geometrically at a rate controlled by the forgetting factor $\lambda$ until reaching a persistent-excitation noise floor.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.