Temporal-difference (TD) networks are a class of predictive state representations that use well-established TD methods to learn models of partially observable dynamical systems. Previous research with TD networks has dealt only with dynamical systems with finite sets of observations and actions. We present an algorithm…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Continuous Dynamical Systems”
Neural circuits integrate continuous dynamics efficiently.
problem Efficiently integrating continuous neural dynamics for simulation and learning.
method Compact neural circuits for Runge-Kutta and Adams-Bashforth-Moulton methods.
result Equivalence of neural and numerical integration for polynomial systems.
Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.
problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.
Develops interpretable model for latent stochastic systems from noisy data.
problem Learning interpretable models of latent stochastic dynamical systems from noisy data.
method Semi-parametric model using Gaussian process for drift, inference of latent paths with sparse variational description.
result Flexible nonparametric model of dynamics with interpretable portraits.
ContinuousNet generalizes ResNets to continuous dynamical systems.
problem ResNets fail to be meaningful dynamical integrators.
method Embedding continuous dynamical systems into higher-order numerical integration schemes (Runge Kutta).
result ContinuousNet exhibits invariance to discrete time step sizes and numerical integration schemes.
Bayesian algorithm stabilizes unknown continuous-time systems from unstable data.
problem Learning and stabilizing unknown continuous-time systems with uncertain dynamics.
method Bayesian learning algorithm that learns from unstable data to stabilize the system in finite time.
result The algorithm stabilizes unknown continuous-time stochastic linear systems effectively after a short time period.
Proposes exact inference for continuous-time Gaussian process dynamics.
problem Inexact inference methods for continuous-time Gaussian process dynamics are impractical for irregularly-sampled data.
method Uses higher-order numerical integrators to discretize dynamics with arbitrary accuracy and proposes multistep and Taylor integrators for exact inference.
result Demonstrates accurate representation of continuous-time systems through exact GP inference.
Paper proposes learning system dynamics from irregularly-sampled partial observations.
problem Capturing dynamics of multi-agent systems with irregular and partial observations.
method LG-ODE, a latent ordinary differential equation model using graph neural networks and neuralODE.
result Demonstrates effectiveness on motion capture, spring system, and charged particle datasets.
Deep learning networks are approximated using dynamical systems theory.
problem Understanding the approximation capabilities of deep learning networks.
method Modeling deep residual networks as continuous-time dynamical systems and using approximation theories in .
result Established general sufficient conditions for universal approximation of deep residual networks.
As energy markets begin clearing at sub-hourly rates, their interaction with load control systems becomes a potentially important consideration. A simple model for the control of thermal systems using market-based power distribution strategies is proposed, with particular attention to the behavior and dynamics of elect…
Researchers dissect Neural ODEs to understand their dynamics.
problem Understanding the inner workings of Neural ODEs.
method Developing continuous-depth formulation to clarify design choices.
result Clarified the influence of design choices on Neural ODE dynamics.
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.
DyNODE uses neural ODEs to model system dynamics in continuous control tasks.
problem Modeling the dynamics of systems in continuous control tasks.
method Neural Ordinary Differential Equations (ODEs) combined with actor-critic RL.
result DyNODE outperforms standard neural networks in sample efficiency and predictive performance.
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.
New LTC RNNs can approximate any continuous system with fewer units.
problem Approximating continuous dynamical systems with neural networks.
method Introducing LTC RNNs with variable time-constant synaptic transmission.
result LTC RNNs can approximate any -dimensional continuous dynamical system.
GRUs exhibit diverse dynamical behaviors but cannot mimic continuous attractors.
problem Understanding and predicting the dynamics of GRUs for neural data.
method Continuous time dynamical systems analysis of GRU networks.
result GRUs can represent stable limit cycles, multi-stable dynamics, and homoclinic bifurcations but not continuous attractors.
Single network with segmented training prevents forgetting in dynamic systems.
problem Catastrophic forgetting in continual learning for dynamic systems.
method Single Net with Progressive Segmented Training (PST). Model parameters are divided into frozen and secondary groups.
result Achieves state-of-the-art accuracy in single-head evaluation on CIFAR-10 and CIFAR-100 datasets.
FHRN uses continuous-time dynamics to stabilize reentrant neural computation.
problem Stabilizing reentrant neural computation.
method Formulated as a continuous-time neural-ODE system, revealing norm-regulated reentry.
result Achieves stable oscillatory trajectories through population-level gain modulation.
Study optimal control in unknown nonlinear systems with near-optimal regret bound.
problem Sequential control in unknown, nonlinear dynamical systems.
method LC^3 algorithm, based on information theory.
result Near-optimal regret bound for episodic settings.
Graph neural networks learn PDEs from sparse, irregular data.
problem Learning PDEs from irregularly spaced data.
method Continuous-time differential model with graph neural networks for arbitrary discretizations.
result Efficient inference with continuous-time adjoint method.
VSDN models sporadic time series with neural SDEs.
problem Modeling irregular and sparse time series data.
method Variational Bayesian method and neural SDEs.
result VSDNs outperform state-of-the-art models in prediction and interpolation.
Continuity of earthquake flow map transfers Teichmüller dynamics results.
problem Transfer results from Teichmüller dynamics to earthquake flow.
method Analyze continuity of earthquake flow map and its inverse.
result Transfer results from Teichmüller dynamics to earthquake flow.
Many real-valued stochastic time-series are locally linear (Gassian), but globally non-linear. For example, the trajectory of a human hand gesture can be viewed as a linear dynamic system driven by a nonlinear dynamic system that represents muscle actions. We present a mixed-state dynamic graphical model in which a hid…
Study on estimating unstable open-loop matrices from state trajectories.
problem System identification for stochastic continuous-time dynamics.
method Employing randomized control inputs to estimate unstable open-loop matrix.
result Estimation error decays with trajectory length, signal-to-noise ratio, and excitability.
Model financial default cascades on sparse graphs via hitting times.
problem Capturing systemic risk in large, sparsely-connected financial networks.
method Dynamic particle systems with hitting times and convergence theory.
result Characterization of default time distribution in tree-like networks.
Recommender system improves with temporal representations.
problem Improving interpretability and performance in recommender systems.
method Incorporates temporal representations via recurrent point process in continuous time.
result Characterizes effects of perception, interest, and seasonal changes on reviews.
The paper introduces new tests for global controllability in hybrid systems.
problem Global controllability in hybrid systems with discrete events.
method Geometric formulation of hybrid systems and analysis of jump points.
result Hybrid systems can be globally controllable even if continuous systems are not.
The study analyzes momentum-based optimization algorithms from dynamical systems perspective.
problem Understanding convergence rates of momentum-based optimization algorithms.
method Exploits dynamical systems, control theory, and symplectic perspectives to analyze convergence rates.
result Provides closed-form expressions relating algorithm parameters to convergence rates.
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.
Faster policy learning via continuous-time gradients.
problem Efficiently estimating policy gradients for continuous-time systems.
method Approximating continuous-time gradients directly, using adaptive discretization.
result More efficient policy gradient estimator leads to faster learning.
We study the density estimation problem with observations generated by certain dynamical systems that admit a unique underlying invariant Lebesgue density. Observations drawn from dynamical systems are not independent and moreover, usual mixing concepts may not be appropriate for measuring the dependence among these ob…
This paper develops nudging algorithms using learned surrogates for state estimation in dynamical systems.
problem Estimating the state of a dynamical system from partial observations when dynamics are unknown or expensive to simulate.
method Unified finite-dimensional analysis of nudging algorithms employing learned surrogate models of the dynamics.
result Nudging algorithms with surrogate models retain exponential convergence up to an explicit error floor.
Extends Neural ODEs to model discrete changes in continuous systems.
problem Lack of explicit termination time in existing Neural ODE formulations.
method Introduces neural event functions to implicitly define termination criteria.
result Models discrete changes in continuous systems without prior knowledge.
New analysis shows FM learns underlying dynamical structure, not just trajectory replay.
problem Understanding whether flow matching models learn transferable dynamical structure or merely replay trajectories.
method Derived velocity field implied by FM objective, characterized as a continuous-time dynamical system.
result FM models can be seen as parametric surrogates of nonparametric solutions, providing strong probabilistic forecasts.
Study connects bank default models using dynamic contagion.
problem Understanding default contagion in heterogeneous interbank systems.
method Proposes a dynamic default contagion model with endogenous early defaults for a finite set of banks, reformulating as a stochastic particle system.
result Existence of clearing systems and continuity of the system response for the mean-field problem.
This paper contains a summary of mathematical researches of stochastic properties of the long time behavior of a continuously observed (and interactively controlled) quantum--field top. Applications to interactively controlled stochastic computer-graphic dynamical systems are also discussed.
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…
Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic dynamical systems provide many examples of subriemannian geometries defined by non-smooth (namely, Hölder continuous) distributions. These distributions are of great significance for the behavior of the parent dynami…
Novel algorithm for optimal control of nonlinear systems.
problem Optimal control of nonlinear stochastic dynamical systems with unknown dynamics.
method Decoupled data-based approach combining open-loop and closed-loop control.
result Performance of D2C algorithm is approximately optimal and significantly reduces training time.
In this paper we propose a process of lagrangian reduction and reconstruction for nonholonomic discrete mechanical systems where the action of a continuous symmetry group makes the configuration space a principal bundle. The result of the reduction process is a discrete dynamical system that we call the discrete reduce…
We solve a continuous-time game-theoretic problem for Kihlstrom-Mirman preferences.
problem Dynamic inconsistency in preferences due to multiattribute utility theory.
method Formalized an equilibrium control theory for continuous-time Markov processes.
result Equilibrium strategy and value function as solution to extended HJB system.
Unified framework for blending ML and mechanistic models in dynamical systems.
problem Learning dynamical systems from noisy, partially observed data.
method A unifying framework that combines mechanistic and machine learning approaches.
result Proves that hybrid models can learn memory-dependent model error.
A Gaussian Process Ordinary Differential Equation framework for large continuous dynamical systems
problem Forecasting complex dynamical systems
method Kernel autonomous ODE approach based on Gaussian Processes and Quadratic Order Model Reduction
result Full model outperforms ROM methods in terms of accuracy or computational costs
dynestyx: A library for probabilistic programming of dynamical systems
problem integrating state-space models into probabilistic programming languages
method a unified interface for specifying priors and performing inference
result principled uncertainty quantification for state and parameters
Efficiently infers switching nonlinear systems with collapsed amortized variational inference.
problem Inference in switching nonlinear dynamical systems with discrete latent variables.
method Learn an inference network as a proposal for continuous latent variables, performing exact marginalization of discrete variables.
result Successfully segments time series data into meaningful regimes using piece-wise nonlinear dynamics.
The abstract applies waist inequality to dynamical systems and entropy.
problem Understanding the relationship between waist inequality and dynamical systems.
method Applying waist inequality to entropy and mean dimension of dynamical systems.
result Maps between dynamical systems have positive conditional metric mean dimension under certain conditions.
Paper develops a consistent algorithm for learning graph structure from continuous-time stochastic differential equations.
problem Learning structure from continuous-time stochastic differential equations.
method Score-based structure learning using Neural Ordinary Differential Equations with adaptive regularization.
result The method consistently recovers directed graphs of local independencies in systems of stochastic differential equations.
Edge computing tackles dynamic data in IIoT with incremental learning.
problem Latency and bandwidth limitations in IoT devices.
method Incremental learning applied to edge-computing systems for continual learning.
result Reduces catastrophic forgetting and provides efficient real-time quality control.