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,657 papers · 148 categories

Trend · papers per month

4769521,4281,904 · Jun 202019922001200920172026
48 results for structured state space models

Divides state space into regions with identical term structure shapes.

problem Classifying term structure shapes in the two-factor Vasicek model.
method Using envelopes and winding numbers to divide and classify the state space.
result Nearly complete classification of parameter space regarding term structure shapes.

Generalizes bits back coding for time-series models with latent Markov structures.

problem Efficiently compressing time-series data with latent Markov structures.
method Extends bits back coding to time-series models with latent Markov structures, including HMMs and LGSSMs.
result Effective for small scale models, promising for larger scale settings like video compression.

A new method learns complex dynamical systems from data efficiently.

problem Learning complex dynamical systems from large-scale data efficiently.
method Low-rank structured variational autoencoding framework for nonlinear Gaussian state-space models.
result Consistently demonstrates better predictive capabilities compared to other models.

Stanza models complex time series with balance between traditional and deep learning approaches.

problem Capturing long-term structure in non-stationary time series.
method Nonlinear, non-stationary state space model.
result Achieves forecasting accuracy competitive with deep LSTMs, especially for multi-step ahead forecasting.

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.

State-space systems generate probabilistic dependencies between inputs and outputs.

problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.

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.

Gaussian state space models have been used for decades as generative models of sequential data. They admit an intuitive probabilistic interpretation, have a simple functional form, and enjoy widespread adoption. We introduce a unified algorithm to efficiently learn a broad class of linear and non-linear state space mod…

2016-09-30abs ↗pdf ↗

Method infers causal structure from system behaviors using RKHS and kernel εε-machines.

problem Discovering causal structure in systems with varying external and measurement noise.
method Combines causal states and RKHS for efficient representation and inference of causal structure.
result Robustly estimates causal structure in high-dimensional data with varying noise.

How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural generative model. The c…

2016-05-24abs ↗pdf ↗

The method approximates stationary distributions of Markov models by truncating irrelevant states.

problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.

New model preserves symmetry in multivariate time series, improving performance.

problem Implicit ordering in MTS models violates inherent exchangeability.
method Permutation-equivariant 2D state space model with canonical architecture.
result Eliminates sequential dependency chains and simplifies stability analysis.

ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.

problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

We propose a new method for learning the structure of convolutional neural networks (CNNs) that is more efficient than recent state-of-the-art methods based on reinforcement learning and evolutionary algorithms. Our approach uses a sequential model-based optimization (SMBO) strategy, in which we search for structures i…

2017-12-02abs ↗pdf ↗

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

New method improves deep learning model robustness and accuracy for long sequences.

problem Challenges in learning long-range sequence tasks using state-space models.
method Proposes a perturb-then-diagonalize (PTD) methodology to address ill-posed diagonalization problems in SSMs.
result Demonstrates improved robustness and accuracy of S5-PTD model on Long-Range Arena benchmark.

The Gaussian process state space model (GPSSM) is a non-linear dynamical system, where unknown transition and/or measurement mappings are described by GPs. Most research in GPSSMs has focussed on the state estimation problem, i.e., computing a posterior of the latent state given the model. However, the key challenge in…

2017-05-30abs ↗pdf ↗

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a seque…

2012-08-06abs ↗pdf ↗

Paper introduces untangling number to quantify 3-periodic tangle complexity.

problem Quantifying the complexity of 3-periodic tangles in biological, chemical, and physical systems.
method Introduces untangling number, a measure of minimum distance to ground state through diagrammatic operations.
result For infinite open curves, generic ground states are crystallographic rod packings.

Algorithm estimates human decision-making in high-dimensional states with finite-time guarantees.

problem Estimating optimal policies and measures of fit in dynamic decision models with high-dimensional state spaces.
method Single-loop estimation algorithm with stochastic gradient steps for reward maximization.
result Algorithm converges to a stationary solution with finite-time guarantees and approximates maximum likelihood sublinearly.

A new method for estimating uncertainty in deep neural networks.

problem Challenges in uncertainty estimation in deep neural networks, especially with increased complexity.
method Decompose tasks into representation learning and state space model for uncertainty estimation.
result The proposed method can estimate predictive distributions on top of existing neural networks.

We introduce a variational approach to learning and inference of temporally hierarchical structure and representation for sequential data. We propose the Variational Temporal Abstraction (VTA), a hierarchical recurrent state space model that can infer the latent temporal structure and thus perform the stochastic state …

2019-10-02abs ↗pdf ↗

Leveraging an equivalence property in the state-space of a Markov Decision Process (MDP) has been investigated in several studies. This paper studies equivalence structure in the reinforcement learning (RL) setup, where transition distributions are no longer assumed to be known. We present a notion of similarity betwee…

2019-10-09abs ↗pdf ↗

It is known that knot homologies admit a physical description as spaces of open BPS states. We study operators and algebras acting on these spaces. This leads to a very rich story, which involves wall crossing phenomena, algebras of closed BPS states acting on spaces of open BPS states, and deformations of Landau-Ginzb…

2011-11-30abs ↗pdf ↗

Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…

2013-02-13abs ↗pdf ↗

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

A toy model shows how locality can emerge in the universe's Hamiltonian and initial state.

problem Understanding the emergence of locality in the universe's Hamiltonian and initial state.
method A loss functional is minimized by gradient descent to find a tensor product structure.
result Local structure emerges in the universe's Hamiltonian and initial state through spontaneous symmetry breaking.

A new method for state estimation on complex networks.

problem Reconstructing latent dynamics from multivariate time-series on topological cell complexes.
method Topology-aware state space framework derived from stochastic partial differential equations, with state evolution following heat-like topological diffusion.
result The proposed method successfully recovers latent states and topological structures in real-world networks.