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.

169,051 papers · 148 categories

Trend · papers per month

4048071,2111,614 · Jun 202019922001200920172026
48 results for dynamic model construction

This work argues for the importance of objects in model-based reinforcement learning.

problem Dynamic construction of models in real-world problems.
method Identifies requirements for overcoming limitations in connectionist models.
result Objects are essential for dynamic model construction in reinforcement learning.

Dynamic portfolio strategy using generative model with attention mechanism.

problem Dynamic modeling of multivariate stock returns with tail-side properties.
method Dynamic generative factor model using Attention-GRU network for dynamic learning and forecasting.
result The proposed model leads to wiser investments with higher reward-risk ratios and lower tail risks.

A new dynamic attention model improves vehicle routing problem solutions.

problem Vehicle routing problems (VRP) are NP-hard and challenging to solve.
method Dynamic attention model with a dynamic encoder-decoder architecture.
result The model outperforms previous methods and shows good generalization.

DynAE improves deep clustering by dynamically shifting from reconstruction to centroid construction.

problem Lack of clear cost functions in unsupervised learning for capturing variations and similarities.
method Dynamic Autoencoder (DynAE) that gradually eliminates reconstruction in favor of centroid construction.
result DynAE achieves state-of-the-art results in deep clustering compared to other methods.

A machine learning framework simulates complex multibody dynamics systems.

problem Simulating complex multibody dynamics systems accurately and efficiently.
method Employing deep neural networks to generate a data-driven meta-model of multibody systems.
result The meta-model accurately predicts motion data of multibody systems without solving equations of motion.

Method learns dynamics of slow variables from stochastic data.

problem Modeling unknown multiscale stochastic systems with limited data.
method Data-driven approach to learn effective dynamics from bursts of observation data.
result Generative model accurately captures effective dynamics of slow variables.

Develops an oblique projection technique to approximate a foliation for non-normal dynamics.

problem Modeling dynamics far from a primary Spectral Submanifold (SSM) in non-normal systems.
method Oblique projection technique based on experimental data.
result Approximates a stable invariant foliation for non-normal dynamics efficiently.

A machine learning model captures non-Newtonian fluid dynamics from molecular details.

problem Creating accurate non-Newtonian fluid models from molecular data.
method Developed a machine learning framework that maps micro-scale polymer configurations to macro-scale fluid dynamics, preserving molecular fidelity.
result The deep non-Newtonian model (DeePN2^2) accurately predicts fluid behavior without empirical closures.

SRVs improve MSMs for Trp-cage miniprotein, revealing new folding states.

problem Constructing high-resolution MSMs for complex protein dynamics.
method Employing SRVs as feature set for MSM construction, leveraging slowest modes identified by SRVs.
result SRV-MSMs reveal new folding states and faster convergence.

New CGMD model predicts non-equilibrium processes better than existing methods.

problem Inconsistency in conditional distribution of unresolved variables.
method Time-lagged independent component analysis to minimize entropy contribution of unresolved variables.
result The model's generalization ability for non-equilibrium processes is significantly improved.

We describe DyNet, a toolkit for implementing neural network models based on dynamic declaration of network structure. In the static declaration strategy that is used in toolkits like Theano, CNTK, and TensorFlow, the user first defines a computation graph (a symbolic representation of the computation), and then exampl…

2017-01-15abs ↗pdf ↗

We analyze an exhaustive data-set of new-cars monthly sales. The set refers to 10 years of Spanish sales of more than 6500 different car model configurations and a total of 10M sold cars, from January 2007 to January 2017. We find that for those model configurations with a monthly market-share higher than 0.1% the sale…

2017-05-09abs ↗pdf ↗

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.

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.

A Dynamic Chain Event Graph (DCEG) provides a rich tree-based framework for modelling a dynamic process with highly asymmetric developments. An N Time-Slice DCEG (NT-DCEG) is a useful subclass of the DCEG class that exhibits a specific type of periodicity in its supporting tree graph and embodies a time-homogeneity ass…

2018-10-22abs ↗pdf ↗

Study dynamic Pareto-optimal allocations in multi-period economies with time-consistent risk measures.

problem Optimal allocation in multi-period pure-exchange economies with stochastic endowments and time-consistent risk measures.
method Introduced dynamic Pareto-optimal allocation processes and derived recursive and comonotone improvement theorems.
result Dynamic Pareto-optimal allocation processes can be constructed recursively and are comonotone.

The paper develops scalable Bayesian models for dynamic covariance matrices using Gaussian processes.

problem Modeling dynamic and heteroskedastic covariance matrices for multivariate time series.
method Gradient-based variational inference for Wishart and inverse Wishart processes, with modifications for scalability and factoring.
result The modified models can scale to high-dimensional covariance matrices and outperform multivariate GARCH in covariance forecasting.

This work introduces a new method for coupling base and target densities in generative models.

problem Generating samples from complex target distributions using simple base distributions.
method Developed a framework of stochastic interpolants with data-dependent couplings.
result Constructing dynamical transport maps that serve as conditional generative models.

This paper develops efficient surrogate models for optimization of complex dynamical systems.

problem Computational expense in solving complex dynamical systems through numerical simulation.
method Combination of proper orthogonal decomposition and radial basis functions for constructing low-dimensional surrogate models.
result Surrogate models reduce computational time for optimization problems while maintaining accuracy.

dynoGP uses deep Gaussian processes for dynamic system identification.

problem System identification for complex dynamical systems.
method Interconnecting linear dynamic GPs and static GPs to model dynamic and static nonlinearities.
result Demonstrates effectiveness of the approach using both simulated and real-world data.

We introduce the Attentive Unsupervised Text (W)riter (AUTR), which is a word level generative model for natural language. It uses a recurrent neural network with a dynamic attention and canvas memory mechanism to iteratively construct sentences. By viewing the state of the memory at intermediate stages and where the m…

2018-06-13abs ↗pdf ↗

A nonparametric Bayesian sparse graph linear dynamical system (SGLDS) is proposed to model sequentially observed multivariate data. SGLDS uses the Bernoulli-Poisson link together with a gamma process to generate an infinite dimensional sparse random graph to model state transitions. Depending on the sparsity pattern of…

2018-02-21abs ↗pdf ↗

A new flow-based Bayesian filter tackles high-dimensional nonlinear stochastic systems.

problem Bayesian filtering for high-dimensional nonlinear systems is challenging due to non-Gaussian distributions and computational limitations.
method Integrates normalizing flows to construct a latent linear state-space model with efficient density estimation and sampling.
result Demonstrates superior accuracy and efficiency in numerical experiments.

A new clustering method for vector time series using autoregressive dynamics.

problem Clustering of vector time series based on their dynamics is challenging.
method System identification approach using mixture autoregressive models.
result Developed a computationally manageable algorithm k-LMVAR for clustering vector time series.

This paper considers portfolio construction in a dynamic setting. We specify a loss function comprised of utility and complexity components with an unknown tradeoff parameter. We develop a novel regret-based criterion for selecting the tradeoff parameter to construct optimal sparse portfolios over time.

2017-06-30abs ↗pdf ↗

Data-driven model reduction captures non-Markovian dynamics using Koopman and Mori-Zwanzig formalisms.

problem Modeling complex, non-Markovian dynamics efficiently and understanding their underlying mechanisms.
method Formulates data-driven model reduction within Koopman and Mori-Zwanzig formalisms, deriving NARMAX models from dynamical systems.
result Shows how data-driven methods can represent non-Markovian dynamics using Koopman and Mori-Zwanzig formalisms.

Optimized DMD for fast atmospheric chemistry forecasting.

problem Forecasting global atmospheric chemistry dynamics efficiently.
method Optimized Dynamic Mode Decomposition (DMD) for reduced order modeling.
result Significant improvement in computational speed and interpretability.

Efficiently constructs sparse ROMs for high-dimensional data using causation entropy.

problem Creating effective reduced-order models for high-dimensional dynamical data.
method Uses causation entropy to identify important terms and construct ROMs with varying sparsity.
result Demonstrates the effectiveness of causation entropy in constructing sparse ROMs for chaotic systems with skewed statistics.

Introduces GFC for learning complex dynamical systems with geometric constraints.

problem Challenges in accurately modeling and predicting complex dynamical systems with geometric constraints.
method Geometric Contact Flows (GFC) using Riemannian and Contact geometry as inductive biases.
result Ensemble of contactomorphisms adapt the latent contact Hamiltonian model to target dynamics while preserving desirable properties.

Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits \textit{non-canonical} Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of th…

2016-07-10abs ↗pdf ↗

sFML learns stochastic dynamical systems from data.

problem Learning unknown stochastic dynamical systems from measurement data.
method sFML extends FML for deterministic systems, using a stochastic flow map composed of deterministic and stochastic sub-maps.
result sFML constructs a stochastic evolution model approximating unknown stochastic systems.