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

Trend · papers per month

3957901,1851,580 · Jun 202019922001200920172026
48 results for Continuous Dynamical Model

ACSSM models irregular time series with continuous dynamics.

problem Modeling irregular time series data.
method ACSSM uses a multi-marginal Doob's h-transform and variational inference with stochastic optimal control.
result ACSSM outperforms in tasks like classification, regression, interpolation, and extrapolation.

Bayesian Federated Learning improves model reliability in dynamic environments.

problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.

New method uses dynamic programming for meta continual learning.

problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.

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.

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.

Neural dynamical systems are dynamical systems that are described at least in part by neural networks. The class of continuous-time neural dynamical systems must, however, be numerically integrated for simulation and learning. Here, we present a compact neural circuit for two common numerical integrators: the explicit …

2019-11-23abs ↗pdf ↗

NCDSSM models irregularly sampled time series with improved imputation and forecasting.

problem Accurate modeling of irregularly sampled time series with missing observations.
method Neural Continuous-Discrete State Space Model (NCDSSM) with amortized inference for auxiliary variables and flexible dynamic state parameterizations.
result Improved imputation and forecasting performance on multiple benchmark datasets.

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.

CLPF models continuous time-series data with improved representational power and variational approximations.

problem Fitting continuous time-series data with existing models faces challenges in representational power and variational quality.
method CLPF uses a time-dependent normalizing flow driven by a stochastic differential equation to decode continuous latent processes into continuous observables. Maximum likelihood optimization is achieved through a novel variational posterior process.
result CLPF outperforms state-of-the-art baselines on synthetic and real-world time-series data.

This paper considers the computational power of constant size, dynamic Bayesian networks. Although discrete dynamic Bayesian networks are no more powerful than hidden Markov models, dynamic Bayesian networks with continuous random variables and discrete children of continuous parents are capable of performing Turing-co…

2016-03-19abs ↗pdf ↗

CT-OT Flow estimates continuous-time dynamics from discrete snapshots.

problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.

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.

Working in a continuous time setting, we extend to the general case of dynamic risk measures continuous from above the characterization of time consistency in terms of ``cocycle condition'' of the minimal penalty function. We prove also the supermartingale property for general time consistent dynamic risk measures. Whe…

2006-07-08abs ↗pdf ↗

Topic models are probabilistic models for discovering topical themes in collections of documents. In real world applications, these models provide us with the means of organizing what would otherwise be unstructured collections. They can help us cluster a huge collection into different topics or find a subset of the co…

2013-02-28abs ↗pdf ↗

Dynamic memory prevents forgetting in continuous learning of medical images.

problem Catastrophic forgetting in machine learning models over time due to domain shifts.
method Dynamic memory to store and replay diverse training data subsets.
result Dynamic memory mitigates forgetting without knowing when shifts occur.

We model how Lipschitz continuity changes during neural network training.

problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.

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.

Model proposes neural network for continuous time dynamics with inductive biases.

problem Training neural networks for small datasets with nonlinear dynamics.
method Inductive biases on decay rates and frequencies using Koopman operator theory.
result Higher forecasting performance with single short training sequence.

Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.

problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.

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.

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.

New method prevents forgetting in LLMs by dynamically identifying task-specific subspaces.

problem Catastrophic forgetting in continual learning of LLMs.
method Adaptive Singular Value Decomposition (SVD) for constrained full fine-tuning.
result Achieves state-of-the-art results in continual learning benchmarks.

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…

2013-01-23abs ↗pdf ↗

This paper introduces a new neural ODE model for continuous-time sequence generation.

problem Representing and predicting continuous-time sequences with high accuracy.
method A neural emission model and neural ODE define the latent state evolution, with an Energy-based model for prior distribution.
result The model outperforms existing methods in various tasks, including long-horizon predictions.

Neural GDEs improve graph prediction by blending discrete structures and differential equations.

problem Dynamic graph prediction challenges in irregularly sampled data.
method Continuous-depth graph neural networks (GNNs) with Neural GDEs.
result Neural GDEs enhance performance across various applications.

A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.

problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.

A new method for CT-DCEGs simplifies inference for asymmetric processes.

problem Inference in asymmetric state space problems with continuous time evolution.
method An extension of CEG propagation for CT-DCEGs, employing junction tree inference.
result CT-DCEGs are preferred over DBNs and continuous time BNs for asymmetric processes.

This paper tackles online reinforcement learning for unseen tasks with unknown boundaries.

problem Real-world tasks violate assumptions of task distributions, independence, and clear task delineations.
method A mixture of Gaussian Processes models different dynamics, and a transition prior handles temporal dependencies.
result The approach reliably handles task distribution shifts and outperforms alternatives in non-stationary tasks.

POSL predicts dynamic convection volumes in hemodiafiltration patients.

problem Continuous, personalised predictions in personalised medicine.
method Adapted POSL to dynamically predict convection volumes using combinations of parametric regressions and machine learning.
result POSL outperformed candidate learners in predicting convection volumes with lower errors and better calibration.

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

In many fields observations are performed irregularly along time, due to either measurement limitations or lack of a constant immanent rate. While discrete-time Markov models (as Dynamic Bayesian Networks) introduce either inefficient computation or an information loss to reasoning about such processes, continuous-time…

2012-03-15abs ↗pdf ↗