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

72144216288 · Jun 202019922001200920172026
48 results for switching dynamics

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.

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.

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 ↗

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.

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 ↗

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.

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.

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.

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.

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 ↗

PCGS-TF uses a Transformer to adaptively control expert switching in non-stationary environments.

problem Static regret is insufficient for strictly online prediction in non-stationary settings.
method Policy-Controlled Generalized Share (PCGS) with a Transformer as an update controller.
result PCGS-TF achieves the lowest dynamic regret in non-stationary families and expert pools.

Optimal switching regret for all segmentations in online convex optimisation.

problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.

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.

New algorithm tackles non-stationary combinatorial semi-bandit problems with optimal regret bounds.

problem Non-stationary combinatorial semi-bandit problems in switching and dynamic environments.
method Developed algorithms for both switching and dynamic cases, achieving nearly optimal regret bounds.
result Achieved nearly optimal regret bounds in both switching and dynamic cases.

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.

The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…

2014-11-17abs ↗pdf ↗

Study optimal investment and reinsurance for insurance companies in a dynamic market model.

problem Optimal investment and reinsurance strategies for insurance companies in a regime-switching market model.
method Forward dynamic exponential utility, value function construction, proportional reinsurance optimization.
result Characterization of optimal investment strategy and proportional reinsurance level.

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.

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.

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.

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.

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.

This paper proposes a multi-scale Markov-Switching GARCH model for EUR/USD volatility.

problem Non-stationary financial volatility requires models that capture changing market conditions across multiple timescales.
method Triple-timeframe Markov-Switching GARCH (MS-GARCH) framework with AR(1)-MS-GARCH models and TVTP for short horizons.
result The proposed model produces statistically distinct regimes and superior volatility forecasting performance.

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.

ADVISOR dynamically balances imitation and reinforcement learning to overcome the imitation gap.

problem The gap between imitation learning and reinforcement learning when teaching agents have privileged information.
method Adaptive Insubordination (ADVISOR) dynamically weights imitation and reward-based reinforcement learning losses.
result On-the-fly switching with ADVISOR outperforms pure imitation, pure reinforcement learning, and their combinations.

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.

Optimized portfolio management with dynamic market regimes using RL and OC learning.

problem Mean-Variance portfolio optimization in a regime-switching market.
method Reinforcement learning (RL) with Orthogonality Condition (OC) learning for regime-switching market dynamics.
result OC learning outperforms TD learning in simulated and real market scenarios, leading to better portfolio performance.

Near-logarithmic regret per switch achieved for mixable/exp-concave losses.

problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.

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 ↗

New framework optimizes deep learning training by deferring large batch sizes to late stages.

problem Optimizing batch size scheduling for deep learning training efficiency.
method Introduced the functional scaling law (FSL) framework to analyze and optimize batch size scheduling.
result Large batch sizes can be deferred to late training stages without sacrificing performance.

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 ↗

Study optimal portfolios in a non-Markovian regime-switching model with random time horizon.

problem Optimal portfolio selection in a market with non-Markovian regime-switching and random time horizon.
method Formulated as a constrained stochastic linear-quadratic optimal control problem, derived closed-form expressions for optimal portfolios and efficient frontier.
result Closed-form expressions for optimal portfolios and efficient frontier derived under non-Markovian regime-switching and random time horizon.