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

Trend · papers per month

58117175233 · May 202619922001200920172026
48 results for chaos control

Combines Gaussian processes and polynomial chaos for stochastic control.

problem Uncertainties in dynamic models lead to performance issues in predictive control.
method Combines Gaussian processes with polynomial chaos expansions to estimate probability distributions of nonlinear functions.
result Demonstrates accurate approximation and closed-loop performance in stochastic nonlinear model predictive control.

In this paper we calibrate chaotic models for interest rates to market data using a polynomial-exponential parametrization for the chaos coefficients. We identify a subclass of one-variable models that allow us to introduce complexity from higher order chaos in a controlled way while retaining considerable analytic tra…

2011-06-13abs ↗pdf ↗

Sparse Polynomial Chaos expansions improve accuracy and efficiency in simulations.

problem Challenges in computational efficiency and accuracy for Polynomial Chaos modeling.
method Sparse Bayesian learning using Variational Relevance Vector Machines.
result Sparse Polynomial Chaos expansions achieve comparable performance to compressive sensing with fewer data points.

Neural network outperforms traditional methods in chaotic dynamics classification.

problem Classifying chaotic and regular dynamics of the Chirikov standard map.
method Trained a convolutional neural network on finite-length trajectories compared to traditional Lyapunov exponent computation.
result Neural network outperforms traditional methods for short periods, converging faster and more robustly.

Develops a framework for analyzing neural networks and ODE models using control theory.

problem Analyzing deep neural networks and neural ODE models trained with stochastic gradient algorithms.
method Identifies connections between control theory, deep learning, and statistical sampling; derives Pontryagin's optimality principle and Mean-Field Langevin dynamics.
result Derives explicit convergence rates and provides quantitive bounds on generalization error, showing dimension-independent rates.

Herding defines a deterministic dynamical system at the edge of chaos. It generates a sequence of model states and parameters by alternating parameter perturbations with state maximizations, where the sequence of states can be interpreted as "samples" from an associated MRF model. Herding differs from maximum likelihoo…

2016-02-09abs ↗pdf ↗

The resilience of low-degree Rademacher chaos is studied, providing probabilistic lower bounds.

problem Understanding how much a Rademacher chaos can withstand adversarial sign-flips without significant probability changes.
method Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree.
result Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree, especially meaningful for constant degree.

The paper discusses the main ideas of the chaos theory and presents mainly the importance of the nonlinearities in the mathematical models. Chaos and order are apparently two opposite terms. The fact that in chaos can be found a certain precise symmetry (Feigenbaum numbers) is even more surprising. As an illustration o…

2010-01-20abs ↗pdf ↗

Study on spin random fields using chaos decomposition for cosmic microwave background modeling.

problem Modeling polarization of Cosmic Microwave Background using spin random fields.
method Explicit Wiener-Itô chaos decomposition of area measures of level sets.
result Reveals a clear difference between high frequency regime and zero spin case.

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

Study shows uniform-time chaos propagation in mean field Langevin dynamics.

problem Understanding the convergence of marginal distributions in mean field dynamics.
method Assumed functional convexity of energy, used LpL^p-convergence and Wasserstein metrics.
result Uniform-in-time propagation of chaos proved in both L2L^2-Wasserstein and relative entropy.

NeuralChaos efficiently approximates complex stochastic processes.

problem Representing and computing square-integrable predictable processes over time.
method Introduces NeuralChaos, a neural operator architecture for Rd\mathbb{R}^{d}-valued predictable processes.
result NeuralChaos achieves best NN-term chaoslet approximation rates and is dense in HT2(Rd)\mathcal{H}^2_T(\mathbb{R}^{d}).

The paper introduces invariants to describe period-doubling routes to chaos in dynamical systems.

problem Understanding the dynamics of period-doubling routes to chaos in complex systems.
method Introducing three topological invariants to describe the topology of period-doubling routes to chaos.
result Ascribed symbolic dynamics to perturbations of the Shilnikov homoclinic scenario and dynamics of the Henon map.

Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.

problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.

Researchers use quantum chaos and RMT to analyze turbulence, revealing unique scaling laws.

problem Understanding the statistical structure and scaling laws of turbulence.
method Applied tools from quantum chaos and Random Matrix Theory to analyze turbulence datasets.
result Turbulence Gram matrices exhibit power-law scalings distinct from classical chaos and random data.

Neural networks can model chaos efficiently by becoming geometrically chaotic.

problem Lack of theoretical understanding of how neural networks learn chaos.
method Employed a geometric perspective to show neural networks can model chaotic dynamics.
result Neural networks can reconstruct strange attractors and accurately predict local divergence rates.

Neural networks solve SPDEs using Wiener chaos expansion.

problem Solving stochastic partial differential equations (SPDEs) numerically.
method Using neural networks in the truncated Wiener chaos expansion.
result Approximation rates for learning SPDE solutions with noise.

The paper models asset prices using Wiener chaos expansions for efficient calibration to implied volatility surfaces.

problem Calibrating to implied volatility surfaces using flexible martingale models.
method Constructing an over-parameterized martingale model based on Wiener chaos expansions and conditional expectations.
result The method enables fast calibration to implied volatility surfaces and demonstrates flexibility through numerical experiments.

The Financial Chaos Index models stock market volatility across three regimes based on mutual price fluctuations.

problem Capturing regime-dependent volatility in stock markets.
method Developed a regime-switching framework using the Financial Chaos Index (FCIX) and elastic net regression.
result Identified three market regimes: low-chaos, intermediate-chaos, and high-chaos, each with distinct volatility characteristics.

A new neural network model uses polynomial chaos theory to improve neural signal processing.

problem Redundant neural signal representation in DANNs.
method Employing arbitrary polynomial chaos theory to construct orthonormal representations in DANNs.
result Improves neural signal processing by reducing redundancy and enhancing orthogonality.

Paper develops a new framework for analyzing certainty equivalents and dynamic risk premia using Malliavin calculus and Wiener chaos analysis.

problem Limitations of Arrow-Pratt approximation for arbitrary sequences of vanishing risks.
method Develops a new framework based on Malliavin calculus and Wiener chaos analysis, combining Itô calculus, the Clark--Ocone representation, and the Wiener chaos decomposition.
result Establishes a unified framework linking expected utility theory, stochastic analysis, and Wiener chaos expansions, revealing higher-order certainty equivalents and dynamic risk premia.

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorith…

2018-01-06abs ↗pdf ↗

Chaos and nonlinear economic dynamics are addressed for a quantum coupled map lattice model of an artificial economy, with quantized supply and demand equilibrium conditions. The measure theoretic properties and the patterns that emerge in both the economic business volume dynamics' diagrams as well as in the quantum m…

2012-02-29abs ↗pdf ↗

Gradient-enhanced GSA uses Poincaré chaos expansions for accurate sensitivity analysis.

problem Accurately estimating Sobol' indices with limited data.
method Integrates sparse, gradient-enhanced regression with Poincaré chaos expansions for derivative-based sensitivity analysis.
result Accurately estimated Sobol' indices using limited data.

A new stochastic algorithm approximates optimal distributions without requiring propagation of chaos.

problem Optimizing functionals over probability distributions using finite particle systems.
method Virtual particle stochastic approximation, viewed as a form of stochastic gradient descent in the Wasserstein space.
result The algorithm's output converges to the optimal distribution and produces i.i.d. samples.

Novel CMG framework improves financial sentiment forecasting.

problem Challenges in short-term sentiment forecasting of financial OHLC data.
method Integrates chaos theory, Markov chains, and Gaussian processes with transformer models.
result Consistently outperforms traditional models in accuracy and efficiency.

The paper models ATM cash withdrawal chaos and forecasts using deep learning.

problem Forecasting ATM cash withdrawals in an Indian bank.
method Chaos modeling of ATM cash withdrawal time series, deep learning methods (ARIMA, RF, SVR, MLP, GMDH, GRNN, LSTM, 1D CNN).
result Deep learning models show similar performance to random forest in forecasting ATM cash withdrawals.

Thermalizer stabilizes autoregressive models for long-term predictions in chaotic systems.

problem Long-term predictions in chaotic spatiotemporal systems are unreliable due to trajectory divergence.
method Diffusion models are used to implicitly estimate the score of an invariant measure, which stabilizes autoregressive emulators by applying denoising during inference.
result Thermalization extends the time horizon of stable predictions by an order of magnitude in chaotic systems.

The Wiener chaos approach to interest rate modelling arises from the observation that the pricing kernel admits a representation in terms of the conditional variance of a square-integrable random variable, which in turn admits a chaos expansion. When the expansion coefficients factorise into multiple copies of a single…

2014-03-13abs ↗pdf ↗

This paper proposes a new method to optimize portfolio allocation with transaction costs using Wiener chaos expansion.

problem Optimizing portfolio allocation with transaction costs in multi-period settings.
method Wiener chaos expansion approach to represent and solve the optimization problem.
result The proposed method finds an optimal strategy for portfolio allocation with transaction costs.

A deterministic system of coupled maps is proposed as a model for economic activity among interacting agents. The values of the maps represent the wealth of the agents. The dynamics of the system is controlled by two parameters. One parameter expresses the growth capacity of the agents and the other describes the local…

2007-01-09abs ↗pdf ↗

Framework for robust control in cooperative systems with uncertain common noise.

problem Optimizing collective behavior of agents in the presence of uncertain common noise.
method Proposes a robust mean-field control framework and proves existence of optimal controls.
result Existence of optimal open-loop controls linked to a lifted robust Markov decision problem.

The study examines the chaos of fractional Brownian fields as Hurst parameter approaches zero.

problem Understanding the chaos of fractional Brownian fields as their Hurst parameter tends to zero.
method Defining normalizing kernels and using Berestycki's ``good points'' approach to derive the limiting measure of multiplicative chaos.
result The limiting measure of multiplicative chaos converges to a log-correlated Gaussian field as the Hurst parameter approaches zero.

New method learns chaotic dynamics from single noisy trajectory.

problem Chaos in complex systems is hard to model accurately with machine learning.
method Adversarial optimal transport objectives to learn summary statistics and emulator from single noisy data.
result Emulators trained with proposed objectives have significantly improved long-term statistical fidelity.

The paper models star dynamics using Ricci flow and Perelman entropy, revealing chaotic behavior.

problem Modeling chaotic positional dynamics of stars in celestial systems.
method Discrete dynamical systems, Ricci flow, Perelman entropy, Lyapunov exponents, bifurcation analysis.
result Entropy increases exponentially, indicating challenging long-term star position prediction.

A new method builds sparse polynomial chaos expansions for models with dependent inputs.

problem Quantifying uncertainty in models with dependent inputs.
method Data-driven approach to construct orthonormal polynomials recursively based on input correlations.
result Reduces the number of observations and improves numerical stability and computational efficiency.