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

Trend · papers per month

4248491,2731,697 · Jun 202019922001200920172026
48 results for dynamic model order reduction

Review and compare model order reduction methods for process engineering.

problem Creating computationally efficient yet accurate models for real-time applications.
method Nonlinear model order reduction methods, including general-purpose and tailored approaches for chemical processes.
result Comparison of eight model order reduction methods applied to an air separation process model.

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 ↗

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

A new method uses neural networks to improve POD-Galerkin models for complex systems.

problem Improving computational efficiency and accuracy in solving non-linear high-dimensional systems.
method Deep learning-based closure modeling using neural networks to approximate POD-Galerkin operators.
result The CD-ROM approach produces more accurate and stable models for complex systems.

A mathematical model describes deforming manifolds with precise vectors and fields.

problem Modeling and describing the deformation of complex manifolds in practical applications.
method Proposes a modified differential dynamic model with constraints on spatial and temporal continuity, presenting deforming vector and field.
result Demonstrates the effectiveness of an autonomous deforming field in data dimension reduction tasks.

We introduce a data-driven order reduction method for nonlinear control systems, drawing on recent progress in machine learning and statistical dimensionality reduction. The method rests on the assumption that the nonlinear system behaves linearly when lifted into a high (or infinite) dimensional feature space where ba…

2011-08-14abs ↗pdf ↗

Generative framework learns effective, lower-dimensional models from high-dimensional data.

problem Predicting long-term behavior of complex, multiscale systems with limited data.
method Physics-aware probabilistic model order reduction with latent variables.
result Guaranteed long-term stability and predictive accuracy in multiscale physical systems.

We analyze two reduction methods for nonholonomic systems that are invariant under the action of a Lie group on the configuration space. Our approach for obtaining the reduced equations is entirely based on the observation that the dynamics can be represented by a second-order differential equations vector field and th…

2011-01-13abs ↗pdf ↗

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.

The paper analyzes variance reduction in stochastic gradient Langevin dynamics.

problem Reducing the variance of stochastic gradient estimators in Langevin dynamics.
method Central limit theorem and Poisson equation analysis for variance characterization.
result Anti-symmetric perturbations can reduce the variance of non-reversible Langevin dynamics.

Unified product Lie groups and their quotient spaces are analyzed for dynamics.

problem Analyzing dynamics over homogeneous spaces using Lie group theory.
method Reduction and extension of Lie group structures to quotient spaces, formulation of Euler-Lagrange, Hamilton, and Euler-Poincaré equations.
result Unified product Lie groups and their quotient spaces provide a framework for formulating dynamics equations.

iLED framework offers interpretable dynamics for multiscale systems.

problem Modeling high-dimensional multiscale systems is challenging.
method Interpretable Learning Effective Dynamics (iLED) framework based on Mori-Zwanzig and Koopman operator theory.
result Comparable accuracy to state-of-the-art approaches with added interpretability.

This work learns models for population dynamics using variational methods and higher-order quadrature.

problem Modeling population dynamics of physical systems with stochastic and mean-field effects.
method Variational problem to infer gradient fields, combining Monte Carlo sampling with higher-order quadrature rules.
result Accurate prediction of population dynamics over a wide range of parameters.

A new geometric method approximates slow invariant manifolds without explicit time-scale separation.

problem Approximating slow invariant manifolds in systems with multiple time-scales.
method Geodesic Stretching and Flow Curvature methods translated into tensorial constructions of Riemannian geometry.
result The method approximates normally attracting invariant manifolds without requiring explicit time-scale separation.

New method finds efficient low-rank neural networks during training.

problem High memory and computational demands of neural networks.
method Restricts weight matrices to a low-rank manifold and updates low-rank factors.
result Significantly reduced time and memory resources required for training and evaluation.

We investigate the statistical properties of the EBS order book for the EUR/USD and USD/JPY currency pairs and the impact of a ten-fold tick size reduction on its dynamics. A large fraction of limit orders are still placed right at or halfway between the old allowed prices. This generates price barriers where the best …

2013-07-20abs ↗pdf ↗

The paper calculates sensitivities for financial derivatives using path weighting methods.

problem Computing sensitivities for path-dependent financial derivatives with high variance and degeneracy issues.
method Proposes explicit path weighting formula, variance reduction adjustment, and covariance inflation technique.
result Effective methods to address high variance and degeneracy in sensitivities computation.

WeldNet reduces complex dynamics to simpler, manageable segments.

problem Complex, high-dimensional time-dependent datasets from physical processes are costly to simulate.
method Windowed Encoders for Learning Dynamics, splitting time domain into windows for nonlinear dimension reduction and propagator training.
result WeldNet captures nonlinear latent structures and dynamics, outperforming existing methods.

Develops a new model to predict training dynamics of large language models.

problem Lack of mechanistic understanding of training dynamics in large language models.
method A first-principles reduced-order model of training dynamics, predicting group-size invariance and stability thresholds.
result Closed-form model predicts training dynamics with high accuracy and provides new diagnostics.

In this paper we consider an alternative approach to "un-reduction". This is the process where one associates to a Lagrangian system on a manifold a dynamical system on a principal bundle over that manifold, in such a way that solutions project. We show that, when written in terms of second-order ordinary differential …

2016-06-24abs ↗pdf ↗

DGNet solves complex dynamical systems with neural networks and constraints.

problem Real-time accurate solutions for large-scale complex systems.
method Model-constrained discontinuous Galerkin Network (DGNet) for compressible Euler equations.
result DGNet achieves out-of-distribution generalization and improved stability.

New method learns low-dimensional models for systems with non-polynomial terms.

problem Modeling systems with non-polynomial nonlinear terms that are spatially local and given in analytic form.
method Non-intrusive model reduction method that learns operators for linear and polynomially nonlinear dynamics via a least-squares problem incorporating given non-polynomial terms.
result Comparable accuracy to intrusive methods that require full knowledge of governing equations.

Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.

problem Efficiently modeling systems with time-varying inputs and varying complexity.
method Combines VAEs for dimensionality reduction and Neural ODEs for dynamics, using variational parameters to adaptively learn.
result Balanced Neural ODEs (B-NODE) efficiently approximate Koopman operator without predefined dimensionality.

Survey of recent developments in symmetric reductions and controls for Hamiltonian systems.

problem Understanding the internal relationships of geometric structures and controls in Hamiltonian systems with symmetry.
method Survey and introduction of recent developments in controlled Hamiltonian systems with symmetry.
result Reveals the relationships between geometric structures, nonholonomic constraints, dynamical vector fields, and controls.

We learn higher-order Markov random fields from evolving data, bypassing computational barriers.

problem Learning graphical models from temporally correlated samples, especially with noisy data.
method Using the trajectory data from Glauber dynamics, we develop an algorithm to recover the graph and parameters efficiently.
result We demonstrate efficient learning of higher-order Markov random fields from trajectory data, overcoming computational hardness.

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.

Batch Thompson Sampling reduces exploration-exploitation trade-off in online decision making.

problem Balancing exploration and exploitation in online decision making.
method Introducing a batch Thompson Sampling framework for stochastic multi-arm bandit and linear contextual bandit problems.
result Achieves asymptotic regret bound with O(logT)O(\log T) batch queries, significantly reducing interactions.

Paper tackles dynamic pricing in a geometrically decaying environment, achieving better occupancy with lower rates.

problem Minimizing expected loss in a dynamically changing environment with decisions dependent on the data distribution.
method Introduces algorithms for information and loss function settings, using repeated decision deployment to allow mixing of the environment.
result Iteration complexity matches first and zero order stochastic gradient methods up to logarithmic factors.

We propose an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared t…

2018-07-09abs ↗pdf ↗

Decentralized optimization on dynamic manifolds with improved regret bound.

problem Optimizing on nonstationary Riemannian manifolds in decentralized systems.
method Decentralized projected Riemannian gradient descent with weighted Frechet mean consensus.
result Achieved dynamic regret bound of O(T(1+PT)/(1σ2(W))){\cal O}(\sqrt{T(1+P_T)}/\sqrt{(1-σ_2(W))}).

Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.

problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.

A new DDR framework learns low-dimensional data representations using dynamical systems.

problem Learning efficient low-dimensional data representations.
method DDR framework based on nonlinear dynamical systems, using linear combinations of functions and regularization.
result DDR method outperforms other methods on synthetic and real datasets.

Efficiently simulates slow dynamics of high-dimensional stochastic systems.

problem Simulating high-dimensional stochastic systems with slow dynamics and fast modes.
method Designs an algorithm to estimate an invariant manifold and its dynamics, averaging out fast modes.
result Efficient simulator of effective dynamics on low-dimensional invariant manifold.

Symmetry reduction of Painlevé IV to Flaschka-Newell Painlevé II

problem Isomonodromic deformation problem associated with rank-two meromorphic connections
method Symmetry Ψ(λ)=σ1Ψ(λ)σ1Ψ(-λ)= σ_1 Ψ(λ) σ_1
result Induced isomonodromic dynamics coincides with Flaschka-Newell Painlevé II hierarchy