惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Google DeepMind News
Google DeepMind News
G
Google Developers Blog
博客园 - 三生石上(FineUI控件)
B
Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Hugging Face - Blog
Hugging Face - Blog
C
Check Point Blog
V
V2EX
Vercel News
Vercel News
U
Unit 42
Recent Announcements
Recent Announcements
Last Week in AI
Last Week in AI
J
Java Code Geeks
WordPress大学
WordPress大学
罗磊的独立博客
I
InfoQ
阮一峰的网络日志
阮一峰的网络日志
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
小众软件
小众软件
M
MIT News - Artificial intelligence
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Apple Machine Learning Research
Apple Machine Learning Research
Martin Fowler
Martin Fowler
云风的 BLOG
云风的 BLOG

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
A Mathematical Framework for Linear Response Theory for N...
[Submitted on 19 Mar 2026 (v1), last revised 24 Jun 2026 (this v · 2026-06-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Linear Response theory aims to predict how added forcing alters the statistical properties of an unforced system. These kinds of questions have been studied predominantly for autonomous dynamical systems, yet many systems in the physical, natural, and social sciences are inherently nonautonomous, evolving in time under external forcings of various kinds (a canonical example being the climate system). In such settings, one would like to understand how the system's time dependent statistical properties change when additional infinitesimal forcings are applied. This question is of clear practical relevance, but from a rigorous mathematical viewpoint it has been addressed only for a few specific classes of systems/perturbations. Here we provide a rigorous linear response theory for a rather general class of deterministic and random nonautonomous systems satisfying a specific set of assumptions that in some sense extend the standard assumptions used in the autonomous setting. A central ingredient is rapid loss of memory, i.e. sufficiently fast forgetting of initial conditions along the nonautonomous evolution. Our main strategy is to reformulate the sequential dynamics as a fixed-point problem for a global transfer operator acting on an extended sequence space of measures. This yields explicit and readily implementable response formulas for predicting the effect of small perturbations on time-dependent statistical states. We illustrate the theory on two representative classes: sequential compositions of C3 expanding maps and sequential compositions of noisy random maps, where uniform positivity of the noise induces exponential loss of memory.

Submission history

From: Stefano Galatolo [view email]
[v1] Thu, 19 Mar 2026 22:32:21 UTC (36 KB)
[v2] Mon, 6 Apr 2026 09:56:18 UTC (36 KB)
[v3] Wed, 24 Jun 2026 11:29:06 UTC (38 KB)