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

69139208277 · Jun 202019922001200920182026
48 results for flocking dynamics

New method learns fractional order of PDEs from flocking particle simulations.

problem Deriving effective nonlocal influence functions from discrete agent-based models.
method Agent-based model, fractional PDEs, Gaussian process regression, Bayesian optimization.
result Learned Euler equations accurately predict flocking behavior.

The goal of this paper is to study organized flocking behavior and systemic risk in heterogeneous mean-field interacting diffusions. We illustrate in a number of case studies the effect of heterogeneity in the behavior of systemic risk in the system, i.e., the risk that several agents default simultaneously as a result…

2016-07-28abs ↗pdf ↗

Estimates interaction laws from agent trajectories without assuming their form.

problem Inferring interaction laws from observational data in complex systems.
method Non-parametric statistical learning approach from trajectory data.
result Effectiveness demonstrated in various disciplines, including physics, opinion dynamics, and biology.

Transformers approximate mean-field dynamics of indistinguishable particles.

problem Approximating the dynamics of indistinguishable particles in complex systems.
method Using transformers to model the mean-field dynamics of interacting particle systems.
result Theoretical bounds on the distance between true and transformer-obtained mean-field dynamics.

Graph neural networks learn decentralized controllers from data.

problem Finding optimal decentralized controllers for autonomous agents is challenging.
method Adapting graph neural networks to handle delayed communications and ensure scalability and transferability.
result Graph neural networks can learn decentralized controllers from data, addressing the scalability and practical implementation issues of centralized controllers.

Model assesses systemic risk in crude oil and gasoline futures markets.

problem Systemic risk in high-frequency crude oil and gasoline futures markets.
method Hawkes flocking model examining endogeneity and interactivity.
result Significantly higher endogenous systemic risk in WTI crude oil compared to gasoline, with gasoline having a higher influence on WTI.

The paper proposes a GP-based method for discovering second-order particle dynamics models.

problem Discovering a general second-order particle-based model for agent interactions.
method Gaussian Process-based approach integrating two independent GP priors on latent interaction kernels.
result The method learns effective nonlinear dynamics representations from small data sets.

Enhances particle filters with neural augmentation for multi-sub-state tracking.

problem Particle filters struggle with complex or approximated models and low latency requirements.
method Learning Flock (LF) uses a neural network to correct particle weights based on sub-particle relationships.
result LF improves performance, robustness, and latency in radar multi-target tracking.

A networked learning method for correlated data outperforms federated learning in precision.

problem Estimating models from correlated data distributed across a network.
method Local linear model estimation with network regularization and information exchange.
result The weighted ensemble average estimate converges faster and more precisely than federated learning.

New method learns population dynamics from snapshots, outperforming existing models.

problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.

JAX MD enables differentiable physics simulations for molecular dynamics.

problem Performing efficient and differentiable physics simulations for molecular dynamics.
method Differentiable physics simulation environments, interaction potentials, neural networks, flexible primitives.
result Differentiable physics simulations can be used for meta-optimization and scaling to large particle systems.

We propose a simple model of the banking system incorporating a game feature where the evolution of monetary reserve is modeled as a system of coupled Feller diffusions. The Markov Nash equilibrium generated through minimizing the linear quadratic cost subject to Cox-Ingersoll-Ross type processes creates liquidity and …

2016-11-21abs ↗pdf ↗

New method for online learning in interacting particle systems.

problem Parameter estimation in stochastic interacting particle systems.
method Stochastic approximation of gradient of asymptotic log likelihood using continuous observations.
result Convergence to stationary points of asymptotic log-likelihood under suitable assumptions.

Wide and Deep GNN learns from distributed graphs and retrain online.

problem Decentralized graph support changes over time, causing mismatch between training and testing graphs.
method Wide and Deep GNN architecture with distributed online learning.
result Convergence guarantees for online retraining of the wide part of the GNN.

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.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

DOODL learns shared spectral dynamics across related dynamical systems.

problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…

2013-12-04abs ↗pdf ↗

Develops a new framework to understand MCMC dynamics as flows on Wasserstein space.

problem Lack of understanding general MCMC dynamics in terms of flows on Wasserstein space.
method Introduces novel concepts to recognize MCMC dynamics as fiber-gradient Hamiltonian flows on Wasserstein space.
result Enables ParVI simulation of MCMC dynamics, enriching ParVI family with more efficient dynamics.

Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.

problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.

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.

Reinforcement learning would enjoy better success on real-world problems if domain knowledge could be imparted to the algorithm by the modelers. Most problems have both hidden state and unknown dynamics. Partially observable Markov decision processes (POMDPs) allow for the modeling of both. Unfortunately, they do not p…

2012-12-12abs ↗pdf ↗

We consider trivializations of second iterated bundles of a Lie group that preserve lifted group structures. With such a trivialization, we elaborate Hamiltonian dynamics on cotangent, Lagrangian dynamics on tangent bundles and, both Hamiltonian and Lagrangian dynamics on Tulczyjew's symplectic space which is tangent o…

2015-03-23abs ↗pdf ↗

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Framework infers Langevin dynamics from stochastic observations of latent systems.

problem Inferring non-stationary Langevin dynamics from indirect stochastic observations.
method Non-parametric framework explicitly modeling stochastic observation process and non-stationary latent dynamics.
result Correct inference of non-stationary dynamics requires accounting for non-equilibrium states and observation duration.

The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.

problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.

NDS learns dynamical models with prior knowledge, improving accuracy and efficiency.

problem Learning accurate dynamical models with limited data and varying dynamics.
method Neural Dynamical Systems (NDS) integrates prior knowledge in ODEs with neural networks to estimate parameters and predict states.
result NDS achieves higher accuracy and uses fewer samples compared to other methods.

Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.

problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.

Paper analyzes dynamic deviation measures and risk-sharing solutions.

problem Optimal risk-sharing solutions for dynamic deviation measures.
method Dynamic inf-convolution problem involving transformed dynamic deviation measures.
result The only dynamic deviation measure that is law invariant and recursive is variance.