OurBigBook.comSite Source code

Growth bound for signs of m-term linear combinations

For

f = \sum_{j = 1}^{m} α_{j} g_{j}

with

g_{j}

drawn from a binary class

G

, fixing

(g_{1}, \dots, g_{m})

leaves an

m

-dimensional linear sign class. Consequently

s (sgn F, n) \leq (n + 1)^{m} ∣ G ∣^{m}

when

G

is finite, and in general

s (sgn F, n) \leq (n + 1)^{m} s (G, n)^{m} .

Table of contents 72 1
- Growth bound for a single-hidden-layer sign network Growth bound for signs of m-term linear combinations 33

 Ancestors (5)

 Incoming links (1)

Solution