arxiv
PublishedMay 22, 2026 at 4:00 AM
Holographic functions and neural networks
Publisher summary· verbatim
arXiv:2605.22666v1 Announce Type: cross Abstract: A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered, up to small
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivMTR-Bench: A Comprehensive Benchmark for Multi-Turn Reasoning Evaluation4harxivFine-grained Claim-level RAG Benchmark for Law4harxivFix the Structural Bottleneck: Context Compression via Explicit Information Transmission4harxivLinear Dynamics in the RLVR Training of Large Language Models4hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗