We lifted 2 functions out of this paper's own repositories and ran 2 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 |
|---|---|---|
| sheqi/GP-RNN_UAI2019 | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| ar1_cell | Ran | sheqi/GP-RNN_UAI2019/funs.py code served (permissive licence) · get_code("50f8905f73b392d4") |
| normal_cell | Ran | sheqi/GP-RNN_UAI2019/funs.py code served (permissive licence) · get_code("242c42e6b16229d5") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Latent dynamics discovery is challenging in extracting complex dynamics from high-dimensional noisy neural data. Many dimensionality reduction methods have been widely adopted to extract low-dimensional, smooth and time-evolving latent trajectories. However, simple state transition structures, linear embedding assumptions, or inflexible inference networks impede the accurate recovery of dynamic portraits. In this paper, we propose a novel latent dynamic model that is capable of capturing nonlinear, non-Markovian, long short-term time-dependent dynamics via recurrent neural networks and tackling complex nonlinear embedding via non-parametric Gaussian process. Due to the complexity and intractability of the model and its inference, we also provide a powerful inference network with bi-directional long short-term memory networks that encode both past and future information into posterior distributions. In the experiment, we show that our model outperforms other state-of-the-art methods in reconstructing insightful latent dynamics from both simulated and experimental neural datasets with either Gaussian or Poisson observations, especially in the low-sample scenario. Our codes and additional materials are available at https://github.com/sheqi/GP-RNN_UAI2019.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1907.00650")
get_code_for_paper("1907.00650")
have("1907.00650")
Connect an agent — have() is free.