Metraipolis › archive › dc_093df71e183a

The Boolean Power of ReLU — arXiv:2608.12617

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12617
License (as archived)
CC0-1.0
Archived
2026-10-19T04:27:21.728Z
SHA-256 of the archived text
fc6195227a36b359aefd5addf8e4b8e1a0c83a75e225ed7eb1a599c65910d8b8
Stable URL of this page
https://metraipolis.com/documento/dc_093df71e183a

How to cite

The Boolean Power of ReLU — arXiv:2608.12617 — arXiv (en), https://arxiv.org/abs/2608.12617 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_093df71e183a (Metraipolis archive dc_093df71e183a, sha256 fc6195227a36b359aefd5addf8e4b8e1a0c83a75e225ed7eb1a599c65910d8b8)
BibTeX
@misc{dc093df71e183a,
  title = {The Boolean Power of ReLU — arXiv:2608.12617},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12617},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_093df71e183a; sha256 fc6195227a36b359aefd5addf8e4b8e1a0c83a75e225ed7eb1a599c65910d8b8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12617. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\Sigma$ of eventually constant activation functions and with arbitrary real coefficients, form a strict subclass of the Boolean queries expressible in ReLU-MPLang. We thereby settle a recently posed open problem: whether ReLU-MPLang is more powerful than trReLU-MPLang when it comes to Boolean queries. In particular, this implies that ReLU-GNNs are strictly more expressive than {TrReLU,id}-GNNs with respect to Boolean queries on Boolean-featured graphs.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.12617 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:20:35.817Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).