Timezone: »

 
Spotlight
HiPPO: Recurrent Memory with Optimal Polynomial Projections
Albert Gu · Tri Dao · Stefano Ermon · Atri Rudra · Christopher Ré

Wed Dec 09 07:50 AM -- 08:00 AM (PST) @ Orals & Spotlights: Continual/Meta/Misc Learning
in Orals & Spotlights Track 16: Continual/Meta/Misc Learning »

A central problem in learning from sequential data is representing cumulative history in an incremental fashion as more data is processed. We introduce a general framework (HiPPO) for the online compression of continuous signals and discrete time series by projection onto polynomial bases. Given a measure that specifies the importance of each time step in the past, HiPPO produces an optimal solution to a natural online function approximation problem. As special cases, our framework yields a short derivation of the recent Legendre Memory Unit (LMU) from first principles, and generalizes the ubiquitous gating mechanism of recurrent neural networks such as GRUs. This formal framework yields a new memory update mechanism (HiPPO-LegS) that scales through time to remember all history, avoiding priors on the timescale. HiPPO-LegS enjoys the theoretical benefits of timescale robustness, fast updates, and bounded gradients. By incorporating the memory dynamics into recurrent neural networks, HiPPO RNNs can empirically capture complex temporal dependencies. On the benchmark permuted MNIST dataset, HiPPO-LegS sets a new state-of-the-art accuracy of 98.3%. Finally, on a novel trajectory classification task testing robustness to out-of-distribution timescales and missing data, HiPPO-LegS outperforms RNN and neural ODE baselines by 25-40% accuracy.

Author Information

Albert Gu (Stanford)
Tri Dao (Stanford University)
Stefano Ermon (Stanford)
Atri Rudra (University at Buffalo, SUNY)
Christopher Ré (Stanford)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors