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

Trend · papers per month

85170254339 · Jun 202019922001200920172026
48 results for universal dynamics

Survey on computational models in dynamical systems, including new universality concepts.

problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.

Universal online optimization for dynamic environments using uniclass prediction.

problem Online optimization in changing environments with dynamic regret.
method Reduces dynamic online optimization to uniclass prediction problem, allowing control over dynamic regret bounds.
result First paper with state-of-the-art dynamic regret guarantees for general convex cost functions.

A universal collection of 4 invariants improves neural network accuracy for molecular dynamics.

problem Improving accuracy of neural networks in molecular dynamics.
method Developed a universal collection of 4 smooth scalar invariants on M(3) x M(3) and evaluated their effectiveness in a PONITA neural network architecture.
result Using a universal collection of invariants significantly improves neural network accuracy.

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

Universal approximation for ODENet and ResNet with a single activation function.

problem Approximating complex dynamical systems with limited vector fields.
method Examined ODENet and ResNet with vector fields composed of a single activation function and affine mapping.
result ODENet and ResNet with restricted vector fields can uniformly approximate those with general vector fields.

Transfer learning improves chaotic dynamics predictions with less data.

problem Efficiently predicting chaotic dynamics with limited data.
method Transfer learning for nonlinear dynamics, optimizing transfer rate and leveraging small-scale turbulence universality.
result Significantly more accurate inference of chaotic dynamics achieved.

Study proves deep narrow RNNs can approximate any function, with minimum width independent of data length.

problem Proving universality of deep narrow RNNs with bounded widths.
method Analyzing RNNs as dynamical systems, proving universality for deep narrow structures with specific widths.
result Minimum width for universality of deep narrow RNNs is independent of data length.

We present a relatively detailed analysis of the persistence probability distributions in financial dynamics. Compared with the auto-correlation function, the persistence probability distributions describe dynamic correlations non-local in time. Universal and non-universal behaviors of the German DAX and Shanghai Index…

2005-11-23abs ↗pdf ↗

Study confirms financial bubbles' common patterns in isolated markets.

problem Testing universal dynamics of financial bubbles in isolated markets.
method Log-Periodic Power Law Singularity (LPPLS) model analysis of two major bubble episodes.
result Tehran Stock Exchange shows clear LPPLS hallmarks, supporting bubble universality.

A new model uses Toeplitz matrices to analyze time-series data transitions.

problem Analyzing transitions in time-series data from nonautonomous systems.
method Deep Koopman-layered models with learnable Toeplitz matrices, leveraging Toeplitz matrices' universal property.
result The model demonstrates universality and generalization, outperforming existing methods.

Deep neural networks near edge of chaos show universal scaling laws.

problem Understanding the behavior of deep neural networks near critical points.
method Analogy to absorbing phase transitions in statistical mechanics, deterministic propagation dynamics, mean-field and directed percolation universality classes.
result Deep neural networks exhibit universal scaling laws near the edge of chaos.

Volatility dynamics of wavelet - filtered stock price time series is studied. Using the universal thresholding method of wavelet filtering and a principle of minimal linear autocorrelation of noise component we find that the quantitative characteristics of volatility dynamics of denoised series are noticeably different…

2006-12-18abs ↗pdf ↗

Gradient descent dynamics in nonconvex models explained with universality.

problem Understanding long-time behavior of nonconvex gradient descent.
method Developed a state evolution system for tracking gradient descent iterates.
result Gradient descent iterates are approximately independent of data and strongly incoherent with feature vectors.

Proposes a new neural network architecture combining MLP and basis functions.

problem Function approximation and operator learning in scientific machine learning.
method Combines robust MLP inner functions with flexible basis functions outer functions.
result KKAN outperforms MLPs and KANs in function approximation and operator learning tasks.

New proof shows incremental flow models are essential for universal generation.

problem Understanding the universality of flow-based models in generating natural maps.
method Topological-dynamical argument and algebraic properties of flows.
result Incremental generation is necessary and sufficient for universal flow-based generation.

Enhances RSCNs with hybrid regularization for nonlinear dynamics.

problem Modeling nonlinear dynamic systems with uncertainties.
method Recurrent stochastic configuration networks with hybrid regularization.
result The method outperforms other models in nonlinear system identification and industrial tasks.

URT layer improves few-shot image classification across diverse domains.

problem Few-shot image classification in multi-domain settings.
method Meta-learns to dynamically re-weight and compose domain-specific representations.
result Sets new state-of-the-art on Meta-Dataset.

A new machine-learned CG model predicts protein structures efficiently.

problem Developing a universal, computationally efficient protein simulation model.
method Combining deep learning with all-atom protein simulations to create a transferable CG force field.
result The model predicts protein structures, intermediates, and fluctuations efficiently.

DeepRSCN models nonlinear systems using stochastic configurations.

problem Modeling nonlinear dynamic systems efficiently.
method Incrementally constructed deep reservoir computing framework with random parameters and online weight updates.
result DeepRSCN outperforms single-layer networks in efficiency, learning, and generalization.

A ML model accurately replicates chaotic dynamics across various parameters.

problem Replicating chaotic characteristics of non-linear dynamics using machine learning.
method A ML model trained to predict one-step-ahead states from historic states captures bifurcation diagrams and Lyapunov exponents universally.
result Variational quantum circuit outperforms classical models in reproducing long-term chaotic characteristics.

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

Echo state networks with random weights can approximate any continuous system.

problem Approximating continuous dynamical systems using echo state networks.
method Randomly generated internal weights and a sampling procedure for activation functions.
result Echo state networks with random weights can approximate any continuous casual time-invariant operators with high probability.

Neural networks with learned biases can approximate any function.

problem Whether neural networks with only learned biases can approximate any continuous function.
method Theoretical and numerical analysis of random weights and learned biases in neural networks.
result Feedforward and recurrent neural networks with random weights can approximate any continuous function and dynamical systems.

We build on the dynamical systems approach to deep learning, where deep residual networks are idealized as continuous-time dynamical systems, from the approximation perspective. In particular, we establish general sufficient conditions for universal approximation using continuous-time deep residual networks, which can …

2019-12-22abs ↗pdf ↗

Machine learning (ML) and artificial intelligence (AI) algorithms are now being used to automate the discovery of physics principles and governing equations from measurement data alone. However, positing a universal physical law from data is challenging without simultaneously proposing an accompanying discrepancy model…

2019-06-19abs ↗pdf ↗

For Finsler metrics (no reversibility assumed) on closed orientable surfaces of genus greater than one, we study the dynamics of minimal rays and minimal geodesics in the universal cover. We prove in particular, that for almost all asymptotic directions the minimal rays with these directions laminate the universal cove…

2014-04-02abs ↗pdf ↗

Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to explain the macroscopic properties of these systems and to provide a foundation for statistical inferences and predictions. It is of interest to…

2019-04-06abs ↗pdf ↗