Preisach极值堆是率无关泛函的Shannon最小充分统计量
The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals
AI总结:
本文证明Preisach极值堆是率无关泛函的Shannon最小充分统计量,并给出信息论推论和在线维护算法。
摘要:
令R表示所有经典意义下率无关(在单调时间重参数化下不变)的可计算因果泛函类,Pi_n为输入序列u_{0:n}的Preisach极值堆。我们证明了一个刻画定理:每个F∈R满足Fu = f(Pi_n)对于某个可计算f成立,并推导出两个信息论结果。首先,在u_{0:n}的任何概率测度下,对于每个F∈R,等式I(u_{0:n}; Fu) = I(Pi_n; Fu)成立,这是刻画定理的直接推论。其次,主要结果:Pi_n是Shannon最小充分统计量,即对于任何可从其计算所有R查询的随机变量S,有I(u_{0:n}; Pi_n) <= I(u_{0:n}; S)。证明使用了[Frydrych, 2026]的有限指示族从任何充分S重构Pi_n。作为推论,在线维护Pi_n足以进行率无关估计:Preisach测度μ的NNLS估计量可以从增量堆过程(Pi_t)_{t=0}^n以每步O(k * L^2)内存组装,其中k = |Pi_t|,L为网格分辨率。
英文摘要:
Let R denote the class of all computable, causal functionals that are rate-independent in the classical sense (invariant under monotone time reparametrizations), and let Pi_n be the Preisach extremum stack of an input sequence u_{0:n}. We prove a characterization theorem establishing that every F in R satisfies Fu = f(Pi_n) for a computable f, and derive two information-theoretic results. First, under any probability measure on u_{0:n}, the equality I(u_{0:n}; Fu) = I(Pi_n; Fu) holds for every F in R and is an immediate corollary of the characterization theorem. Second, the main result: Pi_n is a Shannon-minimal sufficient statistic in the sense that I(u_{0:n}; Pi_n) <= I(u_{0:n}; S) for every random variable S from which all R-queries are computable. The proof uses the finite indicator family of [Frydrych, 2026] to reconstruct Pi_n from any sufficient S. As a corollary, online maintenance of Pi_n suffices for rate-independent estimation: the NNLS estimator of the Preisach measure mu can be assembled from the incremental stack process (Pi_t)_{t=0}^n in O(k * L^2) memory per step, where k = |Pi_t| and L is the grid resolution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。