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

推荐订阅源

量子位
GbyAI
GbyAI
V
Vulnerabilities – Threatpost
阮一峰的网络日志
阮一峰的网络日志
罗磊的独立博客
Recorded Future
Recorded Future
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
博客园 - 司徒正美
Y
Y Combinator Blog
Microsoft Security Blog
Microsoft Security Blog
美团技术团队
博客园 - Franky
Blog — PlanetScale
Blog — PlanetScale
B
Blog RSS Feed
V
Visual Studio Blog
Martin Fowler
Martin Fowler
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
博客园_首页
C
Cybersecurity and Infrastructure Security Agency CISA
博客园 - 叶小钗
AWS News Blog
AWS News Blog
Project Zero
Project Zero
T
Threat Research - Cisco Blogs
V
V2EX
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Latest news
Latest news
N
News and Events Feed by Topic
The Last Watchdog
The Last Watchdog
T
Threatpost
L
Lohrmann on Cybersecurity
小众软件
小众软件
IT之家
IT之家
MongoDB | Blog
MongoDB | Blog
博客园 - 聂微东
Engineering at Meta
Engineering at Meta
爱范儿
爱范儿
Google Online Security Blog
Google Online Security Blog
Forbes - Security
Forbes - Security
Attack and Defense Labs
Attack and Defense Labs
The Register - Security
The Register - Security
K
KPMG report finds enterprise disconnect between AI and its ROI | CIO
H
Help Net Security
Security Latest
Security Latest
Recent Announcements
Recent Announcements
C
Check Point Blog
B
Blog
Google DeepMind News
Google DeepMind News
K
Kaspersky official blog
I
InfoQ

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 Learning Decision-Sufficient Representations for Linear Optimization Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses Prabhakar function and unified fractional kinetic equation in bicomplex space Computing Gamma(p/q) with Beta function values Flows on Graded Manifolds Optimal embedding dimension in the Nash--Tognoli theorem An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit Sharp Bohr-Type inequalities for certain classes of close-to-convex functions Invariants of real affine varieties based on their complexifications Topological symmetric and braid homologies A Formal Graph-Theoretic Framework for Pitch Class Set Analysis Finite groups with high commuting probability for Sylow subgroups Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems Real 2-blocks in quasi-simple groups 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 Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection 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 Concise and elegant proofs of three formulas for complete Bell polynomials On Reed-Muller subcodes, Grassmannian partitions and sum-free functions 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 A Comprehensive Study of Clique Graphs and Clique Regular Graphs Every signed planar graph is $5$-choosable: A short proof and refinements 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 Democratizing Large-Scale Re-Optimization with LLM-Guided Model Patches On Stability and Decomposition of Sample Quantiles under Heavy-Tailed Distributions Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers Stochastic Non-Smooth Convex Optimization with Unbounded Gradients Dimension-Free Convergence of Discrete Diffusion Models: Adjoint Equations Induce the Right Space Conditional Entropy of Heat Diffusion on Temporal Networks The Geometry of Cooperative Game Solutions: Stratified Egalitarian Shapley Values An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition Amortized Energy-Based Bayesian Inference PyCSP3-Scheduling: A Scheduling Extension for PyCSP3 Strategic PAC Learnability via Geometric Definability Proximal-Based Generative Modeling for Bayesian Inverse Problems Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference NOVA: Fundamental Limits of Knowledge Discovery Through AI Model-based Bootstrap of Controlled Markov Chains TopoGeoScore: A Self-Supervised Source-Only Geometric Framework for OOD Checkpoint Selection Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Towards an Inferentialist Account of Information Through Proof-theoretic Semantics Random test functions, $H^{-1}$ norm equivalence, and stochastic variational physics-informed neural networks QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization Robust and Fast Training via Per-Sample Clipping Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshots Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback Deep Learning of Solver-Aware Turbulence Closures from Nudged LES Dynamics Information bottleneck for learning the phase space of dynamics from high-dimensional experimental data QED: An Open-Source Multi-Agent System for Generating Mathematical Proofs on Open Problems Information-Theoretic Measures in AI: A Practical Decision Guide Inference of Online Newton Methods with Nesterov's Accelerated Sketching A Unified Fractional Regularization Framework for Sparse Recovery Mathematical Foundations for Peer-to-Peer Lattice Computation Geometric Layer-wise Approximation Rates for Deep Networks RateQuant: Optimal Mixed-Precision KV Cache Quantization via Rate-Distortion Theory ML-based approach to classification and generation of structured light propagation in turbulent media Zeroth-Order Optimization at the Edge of Stability Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version Beyond Fixed False Discovery Rates: Post-Hoc Conformal Selection with E-Variables Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes Training-Free Rate-Distortion-Perception Traversal With Diffusion Conformal Policy Control Linear Regression with Unknown Truncation Beyond Gaussian Features ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport Feature Learning Dynamics in Infinite-Depth Neural Networks ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms Normalizing Flows on Quotient Manifolds via Boundary Quotients Limit Theorems for Stochastic Gradient Descent in High-Dimensional Single-Layer Networks What Can Be Recovered Under Sparse Adversarial Corruption? Assumption-Free Theory for Linear Measurements TelecomTS: A Multi-Modal Observability Dataset for Time Series and Language Analysis Program Evaluation with Remotely Sensed Outcomes Efficient Gradient Estimation for Parameterized Quantum Systems with Lie Algebraic Symmetries
A Mathematical Framework for Linear Response Theory for Nonautonomous Systems
[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)