RESYNC: Residual Latent-State Synchronization for Deadline-Bound Streaming Inference
Abstract
Predicting every observation in a high-rate stream requires a model to finish before the next arrival. A large model may offer better predictions but miss that deadline. We propose RESYNC: the large model runs asynchronously, while a fast path updates its latest exact but stale latent state using the observations received since and applies its unchanged prediction head. The updater learns from the frozen model's representations without task labels. Across one real and two synthetic streams and five architecture families, RESYNC beats the best compact or distilled alternative with a paired 95% interval above zero in all twelve dataset-architecture pairs with a material teacher advantage at anchor ages of 4-12 observations, and in eleven pairs at older tested ages up to 32. The share of the teacher's gain preserved remains complete on the real stream but is lower and generally declines with anchor age on the synthetic streams. In live replay with 1 ms arrivals, the synchronous large models cannot deliver any predictions on time while RESYNC serves at least 99.4% of arrivals within the interval, with 0.35-0.62 ms median latency on one CPU thread: around the same speed as or faster than the compact model, and 7.9-17.7 faster than synchronous large-model inference. RESYNC targets settings with background compute available but a strict per-observation response deadline.
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.