Papers › Probabilistic Decomposed Linear Dynamical Systems for Robust Discovery of Latent...

Probabilistic Decomposed Linear Dynamical Systems for Robust Discovery of Latent Neural Dynamics

29 Aug 2024arXiv:2408.16862archive 2025-07-28

Yenho Chen, Noga Mudrik, Kyle A. Johnsen, Sankaraleengam Alagapan, Adam S. Charles, Christopher J. Rozell

Time-varying linear state-space models are powerful tools for obtaining mathematically interpretable representations of neural signals. For example, switching and decomposed models describe complex systems using latent variables that evolve according to simple locally linear dynamics. However, existing methods for latent variable estimation are not robust to dynamical noise and system nonlinearity due to noise-sensitive inference procedures and limited model formulations. This can lead to inconsistent results on signals with similar dynamics, limiting the model's ability to provide scientific insight. In this work, we address these limitations and propose a probabilistic approach to latent variable estimation in decomposed models that improves robustness against dynamical noise. Additionally, we introduce an extended latent dynamics model to improve robustness against system nonlinearities. We evaluate our approach on several synthetic dynamical systems, including an empirically-derived brain-computer interface experiment, and demonstrate more accurate latent variable inference in nonlinear systems with diverse noise conditions. Furthermore, we apply our method to a real-world clinical neurophysiology dataset, illustrating the ability to identify interpretable and coherent structure where previous models cannot.

PaperPDFCodeCode Syntology ranMethod as code

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 17 code samples harvested from 1 repository linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 5 unverified. Where Syntology's instrument failed: 9 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 17 samples from 1 repository, 12 ran (3 with no instrument failure; 9 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 between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

siplab-gt/probabilistic-decomposed-linear-dynamical-systems officialSyntology: 17 samples, 12 ran (9 instrument-failed) · 5 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

17 samples harvested: 12 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · violated contract
9ran · our draft was wrong
1ran
5unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from siplab-gt/probabilistic-decomposed-linear-dynamical-systems. “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.

siplab-gt/probabilistic-decomposed-linear-dynamical-systems official repository 17 samples, 12 ran (9 instrument-failed) · 5 unverified
LoessInference pdLDS/pdLDS.py ran MIT (permissive) · 86139453c8bce202 · report fixture: signature y:Tensor/2/float, S:int/0/int · returned tuple · level recorded 2026-09-24
convertfastSBL pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · 598a3a7e7d9b2fb8 · report fixture: signature fastOutput:tuple/1/ndarray · returned tuple · level recorded 2026-09-22
ensure_input_torch_tensor pdLDS/pdLDS.py ran · violated contract MIT (permissive) · 94722e3dceeec582 · report fixture: signature Y:list/1/Tensor · returned list · level recorded 2026-09-22
group_consecutive_ixs pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · 55cff33b42930a46 · report fixture: signature x:Tensor/2/int · returned Tensor · level recorded 2026-09-22
impute_c_dynamics pdLDS/pdLDS.py ran · our draft was wrong fingerprinted MIT (permissive) · 0b43c6eccccd0b14 · report fixture: signature c_filt:Tensor/2/float, basis:Tensor/2/float, impute_val:Tensor/2/float, thresh:float/0/float · returned Tensor · level recorded 2026-09-22
kalman_filter pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · 8a99d76652f912b3 · report fixture: signature y:Tensor/2/float, F:Tensor/3/float, C:Tensor/2/float, x0:Tensor/1/float, Sy:Tensor/2/float, Sx:Tensor/2/float, S0:Tensor/2/float · returned tuple · level recorded 2026-09-22
obs_ll pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · c1cbd3502f9d2ead · report fixture: signature y:Tensor/2/float, x:Tensor/2/float, C:Tensor/2/float, S:Tensor/2/float · returned Tensor · level recorded 2026-09-22
rts_smoother pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · 92c9475a50e20ad1 · report fixture: signature x_filt:Tensor/2/float, x_pred:Tensor/2/float, p_filt:Tensor/3/float, p_pred:Tensor/3/float, F:Tensor/3/float, KT:Tensor/2/float, C:Tensor/2/float · returned tuple · level recorded 2026-09-22
sma pdLDS/pdLDS.py ran · our draft was wrong fingerprinted MIT (permissive) · 0476ab0d65525fd9 · report fixture: signature x:Tensor/2/float, w:int/0/int · returned Tensor · level recorded 2026-09-22
smooth_support_acrosschannels pdLDS/pdLDS.py ran · our draft was wrong MIT (permissive) · 407c1b04ee600304 · report fixture: signature support:Tensor/2/int, w:int/0/int, rate_threshold:float/0/float · returned Tensor · level recorded 2026-09-22
smooth_support_channelwise pdLDS/pdLDS.py ran · our draft was wrong fingerprinted MIT (permissive) · ba7dfc3867f3a4d3 · report fixture: signature support:Tensor/2/float, w:int/0/int · returned Tensor · level recorded 2026-09-22
tricube_weight pdLDS/pdLDS.py ran · violated contract fingerprinted MIT (permissive) · 50c52f6414793099 · report fixture: signature d:Tensor/1/float · returned Tensor · level recorded 2026-09-22
dyn_ll pdLDS/pdLDS.py unverified MIT (permissive) · d0c08ec91757149b · report
fastSBLDFInference pdLDS/pdLDS.py unverified MIT (permissive) · 5952c498911b256b · report
pdLDS pdLDS/pdLDS.py unverified MIT (permissive) · 482a9f52a775403c · report
solve_segmented_restricted_lstsq pdLDS/pdLDS.py unverified MIT (permissive) · 30ef48202e7b5f62 · report
sparseSmoother_opt pdLDS/pdLDS.py unverified MIT (permissive) · f9eedbd7372c4ccf · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Probabilistic Decomposed Linear Dynamical Systems (graph method: Probabilistic Decomposed Linear Dynamical Systems). 17 bricks; individually on a fixture: 12 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 5 unverified. The assembly has not been run end-to-end.

  1. pdLDS entry · level 0 · unverified · 482a9f52a775403c
  2. LoessInference helper · level 1 · ran · 86139453c8bce202
  3. convertfastSBL helper · level 1 · ran · our draft was wrong · 598a3a7e7d9b2fb8
  4. dyn_ll helper · level 0 · unverified · d0c08ec91757149b
  5. ensure_input_torch_tensor helper · level 1 · ran · violated contract · 94722e3dceeec582
  6. fastSBLDFInference helper · level 0 · unverified · 5952c498911b256b
  7. impute_c_dynamics model · level 1 · ran · our draft was wrong · 0b43c6eccccd0b14
  8. kalman_filter helper · level 1 · ran · our draft was wrong · 8a99d76652f912b3
  9. obs_ll helper · level 1 · ran · our draft was wrong · c1cbd3502f9d2ead
  10. rts_smoother helper · level 1 · ran · our draft was wrong · 92c9475a50e20ad1
  11. sma helper · level 1 · ran · our draft was wrong · 0476ab0d65525fd9
  12. smooth_support_acrosschannels helper · level 1 · ran · our draft was wrong · 407c1b04ee600304
  13. smooth_support_channelwise helper · level 1 · ran · our draft was wrong · ba7dfc3867f3a4d3
  14. solve_segmented_restricted_lstsq model · level 0 · unverified · 30ef48202e7b5f62
  15. sparseSmoother_opt helper · level 0 · unverified · f9eedbd7372c4ccf
  16. tricube_weight helper · level 1 · ran · violated contract · 50c52f6414793099
  17. group_consecutive_ixs helper · level 1 · ran · our draft was wrong · 55cff33b42930a46

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2408.16862") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Brain Computer InterfaceState Space Models

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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