LatentTrack: Sequential Weight Generation via Latent Filtering
Omer Haq
TL;DR
LatentTrack (LT) treats online probabilistic prediction under nonstationary dynamics as a filter over predictive functions rather than observations. A low-dimensional latent state $z_t$ evolves to generate predictor weights $\theta_t$ via a hypernetwork, with online amortized inference yielding a predict--generate--update cycle and constant-time test-time updates. LT supports both structured and unstructured latent dynamics through a streaming ELBO bound, and uses Monte Carlo mixtures over latent trajectories to form calibrated predictive distributions with fixed per-step cost. Evaluations on long-horizon climate data show that LT achieves lower $\text{NLL}$ and $\text{MSE}$ and better calibration than stateful and static baselines, illustrating that function-space adaptation can be more robust to distribution shift than traditional latent-state modeling.
Abstract
We introduce LatentTrack (LT), a sequential neural architecture for online probabilistic prediction under nonstationary dynamics. LT performs causal Bayesian filtering in a low-dimensional latent space and uses a lightweight hypernetwork to generate predictive model parameters at each time step, enabling constant-time online adaptation without per-step gradient updates. At each time step, a learned latent model predicts the next latent distribution, which is updated via amortized inference using new observations, yielding a predict--generate--update filtering framework in function space. The formulation supports both structured (Markovian) and unstructured latent dynamics within a unified objective, while Monte Carlo inference over latent trajectories produces calibrated predictive mixtures with fixed per-step cost. Evaluated on long-horizon online regression using the Jena Climate benchmark, LT consistently achieves lower negative log-likelihood and mean squared error than stateful sequential and static uncertainty-aware baselines, with competitive calibration, demonstrating that latent-conditioned function evolution is an effective alternative to traditional latent-state modeling under distribution shift.
