Pith. sign in

REVIEW 1 cited by

Tree-Structured Recurrent Switching Linear Dynamical Systems for Multi-Scale Modeling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.12386 v6 pith:VWOSOT5O submitted 2018-11-29 stat.ML cs.LG

classification stat.MLcs.LG
keywords dynamicssystemsdynamicallinearmodelingmodelsnonlinearaccurate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many real-world systems studied are governed by complex, nonlinear dynamics. By modeling these dynamics, we can gain insight into how these systems work, make predictions about how they will behave, and develop strategies for controlling them. While there are many methods for modeling nonlinear dynamical systems, existing techniques face a trade off between offering interpretable descriptions and making accurate predictions. Here, we develop a class of models that aims to achieve both simultaneously, smoothly interpolating between simple descriptions and more complex, yet also more accurate models. Our probabilistic model achieves this multi-scale property through a hierarchy of locally linear dynamics that jointly approximate global nonlinear dynamics. We call it the tree-structured recurrent switching linear dynamical system. To fit this model, we present a fully-Bayesian sampling procedure using Polya-Gamma data augmentation to allow for fast and conjugate Gibbs sampling. Through a variety of synthetic and real examples, we show how these models outperform existing methods in both interpretability and predictive capability.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory

    cs.LG 2025-02 conditional novelty 6.0 of 10

    ReMeDe Trees are hard, axis-aligned decision trees with a learned internal memory, trained by backpropagation through time, achieving perfect accuracy on synthetic delayed-sign and sign-memory tasks.

Pith tools