We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| alexzhou907/ls4 | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| binary_ce_loss | Ran | alexzhou907/ls4/models/ls4.py code served (permissive licence) · get_code("9d3689d8de6ef9b4") |
| multiclass_ce_loss | Ran | alexzhou907/ls4/models/ls4.py code served (permissive licence) · get_code("ae3fee05e3584b35") |
| setup_optimizer | Ran | alexzhou907/ls4/train_monash.py code served (permissive licence) · get_code("aab83273893c15bf") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Methods based on ordinary differential equations (ODEs) are widely used to build generative models of time-series. In addition to high computational overhead due to explicitly computing hidden states recurrence, existing ODE-based models fall short in learning sequence data with sharp transitions - common in many real-world systems - due to numerical challenges during optimization. In this work, we propose LS4, a generative model for sequences with latent variables evolving according to a state space ODE to increase modeling capacity. Inspired by recent deep state space models (S4), we achieve speedups by leveraging a convolutional representation of LS4 which bypasses the explicit evaluation of hidden states. We show that LS4 significantly outperforms previous continuous-time generative models in terms of marginal distribution, classification, and prediction scores on real-world datasets in the Monash Forecasting Repository, and is capable of modeling highly stochastic data with sharp temporal transitions. LS4 sets state-of-the-art for continuous-time latent generative models, with significant improvement of mean squared error and tighter variational lower bounds on irregularly-sampled datasets, while also being x100 faster than other baselines on long sequences.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2212.12749")
get_code_for_paper("2212.12749")
have("2212.12749")
Connect an agent — have() is free.