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

206411617822 · Jun 202019922001200920172026
48 results for switching linear dynamical systems

This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.

problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.

Many natural systems, such as neurons firing in the brain or basketball teams traversing a court, give rise to time series data with complex, nonlinear dynamics. We can gain insight into these systems by decomposing the data into segments that are each explained by simpler dynamic units. Building on switching linear dy…

2016-10-26abs ↗pdf ↗

Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector autoregressive (VAR) process. Our Bayesian nonparametric approach utilizes a hiera…

2010-03-19abs ↗pdf ↗

Proposes a new model for better speech segmentation.

problem Improving speech segmentation accuracy.
method Integrates recurrent explicit duration variables into rSLDS and uses Pólya-gamma augmentation for inference.
result Demonstrates improved segmentation on various datasets.

Breaks down complex nonlinear dynamics into simpler components.

problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.

Develops a method to model neural dynamics with flexible yet interpretable latent states.

problem Capturing complex nonlinear dynamics in neural time series while maintaining interpretability.
method Gaussian Process Switching Linear Dynamical System (gpSLDS) that balances expressiveness and interpretability.
result Favorable performance in comparison to rSLDS on synthetic and real neuroscience data.

Bayesian method clusters time series with varying dynamics.

problem Modeling and clustering time series with unknown number of clusters and dynamics.
method Hierarchical Dirichlet process and Gaussian process for modeling time series patterns and variations.
result Efficiently clusters time series with varying dynamics without unnecessary proliferation of clusters.

We introduce a machine learning approach for extracting fine-grained representations of protein evolution from molecular dynamics datasets. Metastable switching linear dynamical systems extend standard switching models with a physically-inspired stability constraint. This constraint enables the learning of nuanced repr…

2016-10-05abs ↗pdf ↗

SALT models combine ARHMM and SLDS for efficient, interpretable time-series analysis.

problem Efficient modeling of systems with time-varying dynamics and long-range dependencies.
method Switching autoregressive low-rank tensor models parameterized with a low-rank factorization.
result SALT models provide a balance of interpretability and efficiency, outperforming ARHMMs and SLDSs.

Researchers develop a method to control nonlinear systems with Koopman operator regression.

problem Controlling nonlinear systems with finite action spaces.
method Koopman operator regression for dynamics estimation and model predictive control for control.
result The method yields a linear switching predictive model for control.

New algorithm learns switching dynamics from multiple neural signals.

problem Learning accurate switching dynamical system models from multimodal neural data.
method Unsupervised learning algorithm for multiscale switching dynamical system models.
result Switching multiscale dynamical system models outperform single-scale models in behavior decoding.

ITF improves DSR but inflates curvature, while marginal likelihood reduces it, affecting QoIs.

problem Curvature mismatch between teacher forcing and marginal likelihood in chaotic dynamical systems.
method Comparing objective-induced curvatures of ITF and marginal likelihood in a probabilistic switching augmentation of AL-RNNs.
result Curvature inflation by ITF and reduction by marginal likelihood affect dynamical quantities of interest.

System identification of complex and nonlinear systems is a central problem for model predictive control and model-based reinforcement learning. Despite their complexity, such systems can often be approximated well by a set of linear dynamical systems if broken into appropriate subsequences. This mechanism not only hel…

2019-05-29abs ↗pdf ↗

Latent force models (LFMs) are hybrid models combining mechanistic principles with non-parametric components. In this article, we shall show how LFMs can be equivalently formulated and solved using the state variable approach. We shall also show how the Gaussian process prior used in LFMs can be equivalently formulated…

2012-02-14abs ↗pdf ↗

dLDS models neural dynamics as sparse combinations of simpler components.

problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.

This work addresses identifiability in sequential data with switching dynamics, introducing a new estimator.

problem Identifiability of sequential data with regime-switching dynamics under flexible assumptions.
method Introduces ΩΩSDS, a flow-based estimator for exact likelihood optimization.
result Demonstrates improved disentanglement and more accurate forecasting compared to VAE-based estimators.

Framework models multiscale dynamics with Bayesian learning for regime changes.

problem Analyzing complex interactions between fast and slow processes.
method Hierarchical state-space modeling with Sequential Monte Carlo.
result Bayesian approach accurately tracks state transitions and identifies switching dynamics.

Study identifies and validates a method for system identification of Markov jump linear systems.

problem System identification for autonomous Markov jump linear systems with complete state observations.
method Proposes switched least squares method for identification and derives rates of convergence.
result Data-independent rate of convergence is O(log(T)/T)\mathcal{O}\big(\sqrt{\log(T)/T} \big), showing strong consistency.

Improved robust latent variable estimation for neural dynamics.

problem Inconsistent results due to noise and nonlinearity in existing models.
method Probabilistic approach to latent variable estimation in decomposed models.
result More accurate latent variable inference in nonlinear systems with diverse noise conditions.

New algorithm for continuous-time switching systems using variational inference.

problem Inference in time-series data with continuous-time switching systems.
method Developed a variational inference algorithm combining Gaussian process approximation and posterior inference for Markov jump processes.
result Bayesian latent state estimates and point estimates of unknown parameters for arbitrary points on the real axis.

New algorithm minimizes cumulative loss in dynamic linear bandits without prior knowledge of comparator switches.

problem Minimizing cumulative loss in dynamic linear bandits with unknown number of switches.
method Combining several bandit algorithms to adapt to unknown number of switches without prior knowledge.
result First algorithm achieving optimal regret guarantee of O(d(1+ST)T)\mathcal{O}\big(\sqrt{d(1+S_T) T}\big) up to poly-logarithmic terms.

Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.

problem Detecting change-points and estimating parameters in nonlinear dynamical systems with regime transitions.
method Residual-loss anomaly analysis of physics-informed neural networks, two-stage strategy.
result The method outperforms traditional approaches in change-point localization and parameter estimation accuracy.

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch provide a subclass of linear involutions. We call such linear involutions non-classical interval exchanges. They are related to measured foliations on orienta…

2009-06-14abs ↗pdf ↗

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.

problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and 2\ell_2-norm switching costs, with spectral regret analysis.
result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.

New method forecasts time series with changing variances.

problem Real-world processes with changing variances cannot be captured by classical models.
method State-space model with Markov switching variances, using online learning and expert aggregation.
result Proposed method outperforms traditional expert aggregation and is robust to misspecification.

Estimates hybrid dynamical systems with polynomial expansions and Markovian switching.

problem Identifying hybrid dynamical systems with nonlinear autoregressive exogenous (NARX) components and Markovian switching.
method Probabilistic framework using Expectation Maximization for parameter estimation, including submodel coefficients, hidden state values, and transition probabilities. Disentangles mode classification and NARX regression tasks. Uses soft-labels and coordinate descent approach for parameter fitting.
result Demonstrated on a SMNARX problem with three nonlinear sub-models, achieving parsimonious models through l1-norm bridge estimation and hard-thresholding.

OMGD algorithm optimizes online convex optimization with switching costs and delayed gradients.

problem Optimizing online convex optimization with switching costs and delayed gradients.
method Proposed an online multiple gradient descent (OMGD) algorithm for quadratic and linear switching costs.
result OMGD achieves optimal dynamic regret in the limited information setting.

Paper presents an efficient algorithm for linear MDP with low switching cost.

problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K} ight)$ and near-optimal switching cost of $O\left(d H\log K ight)$.

The paper solves a complex control problem with stochastic elements and switching conditions.

problem Non-homogeneous stochastic LQ control with regime switching and random coefficients.
method Explicit optimal control and value obtained through two systems of backward stochastic differential equations (BSDEs). Existence and uniqueness of solutions proved using BMO martingales and contraction mapping method.
result Explicit optimal state feedback control and optimal value derived for the problem.

In this paper, we investigate the non-stationary combinatorial semi-bandit problem, both in the switching case and in the dynamic case. In the general case where (a) the reward function is non-linear, (b) arms may be probabilistically triggered, and (c) only approximate offline oracle exists \cite{wang2017improving}, o…

2020-02-10abs ↗pdf ↗

Investigates optimal portfolio selection with regime-switching-induced stock price shocks.

problem Mean-variance portfolio selection with regime-switching and stock price jumps.
method Modeling regime-switching and stock price jumps, deriving optimal portfolio strategy and efficient frontier using ODEs.
result Added complexity due to regime-switching-induced stock price shocks, leading to nonlinear ODEs.

Model learns collective and individual dynamics in time series data.

problem Lack of models capturing system-level collective behavior in individual time series.
method Hierarchical switching-state model with latent system-level and entity-level Markov chains.
result Model improves interpretability and forecasting accuracy compared to larger models.

Paper derives analytical formulas for NLD-CEV moments with regime switching.

problem Analytical tractability of NLD-CEV models under stochastic regimes.
method Hybrid system approach using Feynman-Kac formula for solving interconnected PDEs.
result Exact closed-form expressions for fractional-order conditional moments.

Defines hybrid systems on principal bundles and studies impact effects.

problem Understanding impact effects in hybrid mechanical systems.
method Defines hybrid systems on principal bundles, studies underlying geometry, and finds conditions for impact preservation.
result Conditions for preservation of both exterior and interior impacts by mechanical connections.

This paper studies the optimal VIX futures trading problems under a regime-switching model. We consider the VIX as mean reversion dynamics with dependence on the regime that switches among a finite number of states. For the trading strategies, we analyze the timings and sequences of the investor's market participation,…

2016-05-25abs ↗pdf ↗

DSARF models complex spatio-temporal data with deep switching auto-regressive factors.

problem Forecasting complex spatio-temporal data with recurring patterns.
method Deep switching auto-regressive factorization (DSARF) with stochastic variational inference.
result DSARF outperforms state-of-the-art methods in long- and short-term prediction accuracy.

Combines dynamic programming and neural networks for optimal portfolio execution in regime-switching markets.

problem Optimal execution in a market with multiple regimes and non-linear impact costs.
method Four-step numerical framework: approximated orthogonal portfolios, dynamic program for schedule, neural network optimization.
result Neural network optimized strategy outperforms traditional methods in both CRRA and mean-variance objectives.