Manuscript Psy03-C@1 · Psy03-C-v1.tex · theorem · d3380b90
Theorem: External-tanh bound and biased-ReLU envelope
Hidden-state invariants and their limits · lines 435–477 · proof included or linked
Psy03-C@1#thm:tanh, Psy03-C@1#eq:Renvelope, Psy03-C@1#eq:Rloose
For either path with external tanh,
For biased ReLU, set . A pathwise envelope is
Then .
If all hidden-noise coordinates up to time have magnitude at most , a convenient looser bound is
For fixed finite parameters and , all hidden first moments are finite.
If , biased ReLU does not have a deterministic unit-cube bound: conditional on a finite preceding state, each noisy preactivation has an unbounded upper Gaussian tail.
Proof. The tanh assertion follows from its range. For ReLU, use Lemma lem:convex, the nonnegative offset, and coordinatewise. Use and iterate for (eq:Rloose). Gaussian norm first moments are finite, so the finite recurrence has finite first moments. A nonzero Gaussian term before ReLU has arbitrarily large positive values with positive probability.
Displayed formulas in this passage
unlabeled · line 438
Psy03-C@1#eq:Renvelope · line 443
Psy03-C@1#eq:Rloose · line 453
Nearby in this section
- lemma: Lemma: Coordinate envelope of the cell
- theorem: Theorem: Ordinary-ReLU invariant cube
- section: Hidden-state invariants and their limits
- section: Hidden-state invariants and their limits
- proposition: Proposition: Positive bias need not grow without bound over time
- section: Hidden-state invariants and their limits