Papers › eXponential FAmily Dynamical Systems (XFADS): Large-scale nonlinear Gaussian...

eXponential FAmily Dynamical Systems (XFADS): Large-scale nonlinear Gaussian state-space modeling

3 Mar 2024arXiv:2403.01371archive 2025-07-28

Matthew Dowling, Yuan Zhao, Il Memming Park

State-space graphical models and the variational autoencoder framework provide a principled apparatus for learning dynamical systems from data. State-of-the-art probabilistic approaches are often able to scale to large problems at the cost of flexibility of the variational posterior or expressivity of the dynamics model. However, those consolidations can be detrimental if the ultimate goal is to learn a generative model capable of explaining the spatiotemporal structure of the data and making accurate forecasts. We introduce a low-rank structured variational autoencoding framework for nonlinear Gaussian state-space graphical models capable of capturing dense covariance structures that are important for learning dynamical systems with predictive capabilities. Our inference algorithm exploits the covariance structures that arise naturally from sample based approximate Gaussian message passing and low-rank amortized posterior updates -- effectively performing approximate variational smoothing with time complexity scaling linearly in the state dimensionality. In comparisons with other deep state-space model architectures our approach consistently demonstrates the ability to learn a more predictive generative model. Furthermore, when applied to neural physiological recordings, our approach is able to learn a dynamical system capable of forecasting population spiking and behavioral correlates from a small portion of single trials.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 14 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 14 samples from 1 repository, 8 ran (4 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

catniplab/xfads officialmentioned on GitHubpytorchMITSyntology: 14 samples, 8 ran (4 instrument-failed) · 6 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
4ran · our draft was wrong
3ran
6unverified

Licence: 1 of the 14 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from catniplab/xfads. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

catniplab/xfads official repository 14 samples, 8 ran (4 instrument-failed) · 6 unverified
bmv xfads/linalg_utils.py ran fingerprinted MIT (permissive) · 66fab7e673f1a01c · report fixture: signature A:Tensor/3/float, x:Tensor/2/float · returned Tensor · level recorded 2026-09-24
bop xfads/linalg_utils.py ran fingerprinted MIT (permissive) · 5d15ccc22a9c48ab · report fixture: signature x1:Tensor/2/float, x2:Tensor/2/float · returned Tensor · level recorded 2026-09-24
build_gru_dynamics_function xfads/utils.py ran MIT (permissive) · b35422bc6fba813f · report fixture: signature dim_input:int/0/int, dim_hidden:int/0/int, d_type:dtype/0/?, device:str/0/str, use_layer_norm:bool/0/bool · returned DynamicsGRU · level recorded 2026-09-24
estimate_poisson_rate_bias xfads/prob_utils.py ran · our draft was wrong MIT (permissive) · 3d034c33d26e2408 · report fixture: signature y:Tensor/3/float, time_delta:float/0/float · returned Tensor · level recorded 2026-09-24
memory_cleanup xfads/decorators.py ran · our draft was wrong MIT (permissive) · 204798d70e07dfc6 · report fixture: signature func:callable/0/? · returned function · level recorded 2026-09-24
show_memory_stats xfads/decorators.py ran · our draft was wrong MIT (permissive) · f113aa7c337f472a · report fixture: signature func:callable/0/? · returned function · level recorded 2026-09-24
softplus_inv xfads/utils.py ran · honoured contract fingerprinted MIT (permissive) · 61afa93ae14d2d28 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-24
triangular_inverse xfads/linalg_utils.py ran · our draft was wrong fingerprinted MIT (permissive) · 47f1e66bbd89dca4 · report fixture: signature A:Tensor/2/float, upper:bool/0/bool · returned Tensor · level recorded 2026-09-24
animate_reaching_evolution xfads/plot_utils.py unverified MIT (permissive) · c17790ba37349e87 · report
animate_reaching_evolution_mo xfads/plot_utils.py unverified MIT (permissive) · 137195894580df0c · report
apply_memory_cleanup xfads/decorators.py unverified MIT (permissive) · 52b222b6a45a0eed · report
bits_per_spike xfads/prob_utils.py unverified MIT (permissive) here; the stored copy is pointer only · e44e57b951a765b2 · report
plot_single_trial_reaching_latents xfads/plot_utils.py unverified MIT (permissive) · aeb58bd43522d4b8 · report
spike_resample_fn xfads/utils.py unverified MIT (permissive) · ad5739732afb4b50 · report

Tasks

Variational Inference

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Variational Inference

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections