Task-Targeted Spectral Excitation for Dynamics Learning
Implementation & benchmark of arXiv:2607.21280 — When Persistency is not Exciting in Data-Driven Predictive Control
Source paper: When Persistency is not Exciting in Data-Driven Predictive Control arXiv:2607.21280 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
When training a neural state-space model, SSM, or recurrent world model from trajectories, constrain the data-generation policy or augmentation process to satisfy both a Hankel-rank condition and a task-weighted frequency-coverage condition. The rank condition prevents unidentifiable dynamics, while the frequency condition concentrates samples at frequencies that affect the target prediction horizon, tracking objective, or closed-loop controller instead of merely producing broadband-looking data.
Formulas
Mathematical statement
For an input trajectory u_t ∈ R^{n_u}, define the depth-L Hankel matrix H_L(u) whose columns are [u_k^T,...,u_{k+L-1}^T]^T. Algebraic excitation requires rank(H_L(u)) = L n_u, or a numerically robust version σ_min(H_L(u)) ≥ ε_rank. Let U(e^{jω}) and Y(e^{jω}) be finite-length discrete Fourier transforms of input and output trajectories, and define W_ρ(e^{jω}) = [e^{-jωρ},...,e^{-jω}]^T. The paper's behavioral construction gives X(e^{jω}) = C_u(W_ρ(e^{jω}) ⊗ U(e^{jω})) + C_y(W_ρ(e^{jω}) ⊗ Y(e^{jω})), where X is the state spectrum and C_u,C_y are deterministic reconstruction matrices. For a neural predictor, replace unknown state sensitivity by an empirical task sensitivity q(ω) obtained by perturbing Fourier bins and measuring prediction-loss or closed-loop-loss change. Define spectral coverage E(ω)=|U(e^{jω})|^2+λ_y|Y(e^{jω})|^2 and require both σ_min(H_L(u))≥ε_rank and ∫q(ω)E(ω)dω≥ε_task. The mechanism predicts failure when rank is high but task-weighted spectral energy is low.
Implementation notes
1. Integration point: use this during data collection for a neural state-space model, recurrent world model, or nonlinear SSM, rather than as an ordinary minibatch loss. Begin with a controllable simulator such as a damped oscillator, CartPole, or MuJoCo pendulum. Generate trajectories using a nominal policy plus an additive colored excitation generator. 2. Pseudocode: collect a trajectory; construct H_L(u) and compute its smallest singular value; compute FFTs U and Y; estimate q(ω) by adding a small sinusoid at each of K frequency bins to validation rollouts and measuring the increase in H-step prediction loss or closed-loop tracking loss; update excitation amplitudes using E_k ← |U_k|²+λ_y|Y_k|² and a_k ← a_k+αq_k/(E_k+δ); inverse FFT the updated spectrum, clip actions to valid bounds, and accept the dataset only if σ_min(H_L(u))≥ε_rank and Σ_kq_kE_k≥ε_task. 3. Computed from the paper: the Hankel rank test, delayed Fourier representation, and the distinction between rank excitation and frequency-relevant excitation. Estimated empirically: q(ω), output spectra, thresholds, and the neural predictor. 4. First cheap experiment: identify a two-dimensional damped oscillator with a GRU or S4-style SSM from 50 trajectories, comparing white noise, rank-only colored noise, and proposed rank-plus-task excitation. Evaluate 50-step prediction and reference tracking. The quantitative prediction is that rank-only data can have σ_min(H_L(u)) above ε_rank but low Σ_kq_kE_k and poor performance; adding energy to high-q bins should reduce task loss. Plot performance against S_task and test whether the failure transition occurs near S_task=ε_task, with a stronger correlation between S_task and test error than between Hankel rank and test error.
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.