The Boolean power of ReLU: ReLU-MPLang expresses more Boolean queries than Σ-MPLang with eventually constant activations on finite graphs, resolving an open question
Read the original at arxiv.org→arXiv:2608.12617v1 Announce Type: new Abstract: We prove that, on finite simple undirected graphs equipped with a single Boolean node feature, the Boolean queries expressible in $\Sigma$-MPLang, for any collection...
Original headline: "The Boolean Power of ReLU"
Coverage timeline
- Aug 14, 04:00 UTC arXiv cs.LG lead source The Boolean Power of ReLU