AI Chat AI Image Generator AI Video Text to Speech

Fast adjoint differentiation of chaos

11/15/2021

∙

by Angxiu Ni, et al.

∙

∙

We devise a fast algorithm for the gradient of the long-time-average statistics of chaotic systems, with cost almost independent of the number of parameters. It runs on one sample orbit; its cost is linear to the unstable dimension. The algorithm is based on two theoretical results in this paper: the adjoint shadowing lemma for the shadowing contribution and the fast adjoint formula for the unstable divergence in the linear response.

research

∙ 07/14/2022

Adjoint shadowing for backpropagation in hyperbolic chaos

For both discrete-time and continuous-time hyperbolic chaos, we introduc...

0 Angxiu Ni, et al. ∙

research

∙ 08/31/2021

On computing derivatives of transfer operators and linear responses in higher dimensions

We show that the derivative of the transfer operator with respect to per...

0 Angxiu Ni, et al. ∙

research

∙ 08/15/2023

No-propagate algorithm for linear responses of random chaotic systems

We develop the no-propagate algorithm for sampling the linear response o...

0 Angxiu Ni, et al. ∙

research

∙ 07/25/2022

Improved Bounds for Sampling Solutions of Random CNF Formulas

Let Φ be a random k-CNF formula on n variables and m clauses, where each...

0 Kun He, et al. ∙

research

∙ 03/28/2016

Generalized Exponential Concentration Inequality for Rényi Divergence Estimation

Estimating divergences in a consistent way is of great importance in man...

0 Shashank Singh, et al. ∙

research

∙ 07/25/2019

Fast Deterministic Constructions of Linear-Size Spanners and Skeletons

In the distributed setting, the only existing constructions of sparse sk...

0 Michael Elkin, et al. ∙

research

∙ 10/31/2010

Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

Two very fast and simple O(lg n) algorithms for individual Fibonacci num...

0 L. F. Johnson, et al. ∙