Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for Continuous SSMs

HiPPO-Prophecy models can learn dynamical systems without fine-tuning.

problem Learning dynamical systems in context without fine-tuning parameters.
method Introduced a novel weight construction for SSMs that approximates derivatives of input signals.
result Discrete SSMs can predict the next state of any dynamical system after observing previous states.

State space models (SSMs) are a flexible approach to modeling complex time series. However, inference in SSMs is often computationally prohibitive for long time series. Stochastic gradient MCMC (SGMCMC) is a popular method for scalable Bayesian inference for large independent data. Unfortunately when applied to depende…

2018-10-22abs ↗pdf ↗

Study stability of selective SSMs with discontinuous gating.

problem Challenges in stability analysis of selective SSMs with discontinuous gating.
method Passivity and Input-to-State Stability (ISS) analysis of continuous-time selective SSMs.
result Derivation of sufficient conditions for global ISS with respect to the port input.

SSMs combined with neural networks match Transformers in dynamic token selection.

problem Understanding the capabilities of SSMs in dynamic token selection.
method Exploring SSMs combined with fully connected neural networks.
result SSMs combined with nonlinear layers can efficiently solve challenging tasks and estimate functions.

The paper provides a theoretical justification for using stable SSM blocks in deep sequential models.

problem Developing generalization bounds for deep sequential models with varying sequence lengths.
method Using Rademacher contraction and stability constraints, the paper derives a PAC bound that is independent of sequence length.
result The derived PAC bound decreases as the stability of SSM blocks increases, providing theoretical justification for their use.

KalMamba improves RL efficiency with probabilistic SSMs.

problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.

State-space models (SSMs) provide a flexible framework for modelling time-series data. Consequently, SSMs are ubiquitously applied in areas such as engineering, econometrics and epidemiology. In this paper we provide a fast approach for approximate Bayesian inference in SSMs using the tools of deep learning and variati…

2018-11-20abs ↗pdf ↗

HOPE improves SSMs for long-memory tasks with robust initialization and training.

problem Improving state-space models for long-memory tasks with robust initialization and training.
method Developed a new parameterization scheme called HOPE using Hankel operators and Markov parameters.
result HOPE improves SSMs' performance on Long-Range Arena tasks and demonstrates non-decaying memory.

This work studies learning dynamics in SSMs, linking them to deep linear networks.

problem Lack of theoretical understanding of SSMs, especially in deep state spaces.
method Analyzes learning dynamics of linear SSMs, focusing on frequency domain, and establishes links to deep linear networks.
result Analytical solutions for SSM learning dynamics under mild assumptions, linking to deep linear networks.

State space models (SSMs) provide a flexible framework for modeling complex time series via a latent stochastic process. Inference for nonlinear, non-Gaussian SSMs is often tackled with particle methods that do not scale well to long time series. The challenge is two-fold: not only do computations scale linearly with t…

2019-01-29abs ↗pdf ↗

Develops an oblique projection technique to approximate a foliation for non-normal dynamics.

problem Modeling dynamics far from a primary Spectral Submanifold (SSM) in non-normal systems.
method Oblique projection technique based on experimental data.
result Approximates a stable invariant foliation for non-normal dynamics efficiently.

State-space models (SSMs) are a highly expressive model class for learning patterns in time series data and for system identification. Deterministic versions of SSMs (e.g. LSTMs) proved extremely successful in modeling complex time series data. Fully probabilistic SSMs, however, are often found hard to train, even for …

2018-01-31abs ↗pdf ↗

Real-world dynamical systems often consist of multiple stochastic subsystems that interact with each other. Modeling and forecasting the behavior of such dynamics are generally not easy, due to the inherent hardness in understanding the complicated interactions and evolutions of their constituents. This paper introduce…

2020-01-13abs ↗pdf ↗

SSMs can be poisoned with clean labels, leading to generalization failure.

problem The implicit bias of SSMs can be manipulated by including special training examples with clean labels.
method Formal proof and empirical demonstration of the phenomenon.
result SSMs can fail to generalize even with clean labels, due to the inclusion of special training examples.

A new method for analyzing high-dimensional time-series data using deep neural networks.

problem Challenges in modeling high-dimensional time-series data with explicit state and observation processes.
method Deep Direct Discriminative Decoders (D4) for high-dimensional observation processes.
result D4 outperforms traditional SSMs and RNNs in various time-series data applications.

A new method for online VI in SSMs using asymptotic contrast.

problem Lack of functionality for streaming data in standard VI methods for SSMs.
method Propose maximising an IWAE-type variational lower bound on the asymptotic contrast function using stochastic approximation.
result OSIWAE allows for online learning of model parameters and latent states.

SSMs have a built-in bias towards low-frequency components, which can be adjusted.

problem Frequency bias in SSMs affects their performance on long-range sequences.
method Proposed two mechanisms to tune frequency bias: scaling initialization or applying a Sobolev-norm-based filter.
result Tuning frequency bias improves SSMs' performance on long-range sequence learning tasks.

D-LinOSS models learn to dissipate energy, improving performance on long-range tasks.

problem Representational limitations of LinOSS models in long-range reasoning.
method Introducing Damped Linear Oscillatory State-Space models (D-LinOSS) that learn to dissipate latent state energy on arbitrary time scales.
result D-LinOSS consistently outperforms previous LinOSS methods on long-range learning tasks, achieving faster convergence and reducing hyperparameter search space.

One of the key challenges in identifying nonlinear and possibly non-Gaussian state space models (SSMs) is the intractability of estimating the system state. Sequential Monte Carlo (SMC) methods, such as the particle filter (introduced more than two decades ago), provide numerical solutions to the nonlinear state estima…

2015-03-20abs ↗pdf ↗

This paper analyzes EM algorithm for softmax mixture models in high dimensions.

problem Modeling heterogeneous populations choosing from multiple attributes.
method Comprehensive analysis of the EM algorithm for softmax mixture models (SMMs), proving identifiability and convergence.
result EM algorithm recovers mixture atoms at near-parametric rate under suitable initialization.

Online method for state estimation and parameter learning in SSMs.

problem State estimation and parameter learning in state-space models.
method Stochastic gradient optimization of variational lower bound, using backward decompositions and Bellman recursions.
result Ability to operate online without revisiting historic observations.

Study combines VaR and ES forecasts using MCS to improve risk predictions.

problem Combining VaR and ES forecasts to improve risk predictions under uncertainty.
method Employed Model Confidence Set (MCS) methodology to identify best-performing models and combine their forecasts.
result Proposed combined predictors are robust and pass standard backtests.

Particle Metropolis-Hastings enables Bayesian parameter inference in general nonlinear state space models (SSMs). However, in many implementations a random walk proposal is used and this can result in poor mixing if not tuned correctly using tedious pilot runs. Therefore, we consider a new proposal inspired by quasi-Ne…

2015-02-12abs ↗pdf ↗

The reconstruction of an object's shape or surface from a set of 3D points plays an important role in medical image analysis, e.g. in anatomy reconstruction from tomographic measurements or in the process of aligning intra-operative navigation and preoperative planning data. In such scenarios, one usually has to deal w…

2016-02-26abs ↗pdf ↗

This paper examines how skip connections prevent rank collapse in sequence models.

problem Rank collapse in sequence models, leading to reduced expressivity and training instabilities.
method Analytical and ablation studies of lambda-skip connections in SSMs.
result A sufficient condition to prevent rank collapse across various architectures.

Study improves ECG analysis accuracy using state space models, self-supervised learning, and patient metadata.

problem Improving quantitative accuracy of ECG analysis using deep learning.
method Explored state space models, self-supervised learning, and patient metadata integration.
result Improved ECG analysis accuracy through these components, no significant advantage from higher sampling rates or longer input sizes.

Structured state space models improve ECG classification and reveal new insights.

problem Improving ECG analysis through deep learning.
method Applying structured state space models to capture long-term dependencies in ECG data.
result SSMs lead to significant improvements in ECG classification over current state-of-the-art.

New BED method handles online inference for partially observed dynamical systems.

problem Optimizing data collection for partially observable, partially online dynamical systems.
method Derived estimators of expected information gain and its gradient for SSMs, using nested particle filters.
result Successfully handles both partial observability and online inference in realistic models.