Fast differentiation of hyperbolic chaos
Angxiu Ni
TL;DR
This work tackles the challenge of computing the linear response of high-dimensional hyperbolic chaotic systems by deriving a fast, pointwise estimator for the unstable divergence that is suitable for Monte-Carlo evaluation. It introduces a blended approach that splits the derivative of the SRB measure into a shadowing contribution, computed via nonintrusive shadowing, and an unstable contribution expressed through a renormalized second-order tangent framework with a dominant term $p$, evolving under a single propagation rule. The resulting fast response algorithm achieves cost $O(Mu)$ per step and is demonstrated on a 21-dimensional solenoid map, where it attains enormous speedups over path-perturbation methods while remaining robust in high dimensions. This advances gradient-based optimization, uncertainty quantification, and sensitivity analysis for complex chaotic systems by enabling scalable linear-response computations. The work also provides a detailed geometric and algebraic toolkit for second-order tangents, volume ratios, and projection operators that underpin the estimator and algorithm.
Abstract
We derive and prove the `fast response' formula for the linear response, the parameter derivatives of long-time-averaged statistics, of hyperbolic deterministic chaotic systems. The expression is pointwisely defined so we can compute the linear response in high-dimensions via Monte-Carlo-type algorithms. It has two parts, where the shadowing contribution is computed by the nonintrusive shadowing algorithm. The unstable contribution is expressed by renormalized second-order tangent equations; importantly, it does not contain any distributional derivatives. The algorithm's cost is solving $u$, the unstable dimension, many first-order and second-order tangent equations along a long orbit; the main error is the sampling error of the orbit. We numerically demonstrate the algorithm on a 21-dimensional example, which is difficult for previous methods.
