Preisach
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Worst-Case Update Complexity of the Preisach Extremum Stack
new Abstract: The Preisach extremum stack $\Pi_n$ is the minimal sufficient statistic for the class $\mathcal{R}$ of computable rate-independent functionals in the Kolmogorov complexity sense [1]. Its standard update algorithm runs in amortised $O(1)$ time, but adversarial inputs can force $\Theta(k)$ operations per step (where $k$ is the current depth). We establish a three-level complexity picture: (i) any compact exact $\mathcal{R}$-minimal representation incurs $\Theta(k)$ output changes...
The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals
Announce Type: new Abstract: 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};...
Worker Utility as Hysteresis: A Preisach Model of Transaction Acceptance in Gig Labour Markets
arXiv:2606.04916v1 Announce Type: new Abstract: Worker utility is not observed -- only its consequence is. Each gig transaction produces a single bit: accepted or rejected.