Deep belief networks are exact
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
arXiv:2608.29279v1 Announce Type: new Abstract: Deep learning is often criticized for its theoretical research lagging behind practice. To make deep learning easier to understand, the entropy space t...
arXiv:2607. 23349v1 Announce Type: new Abstract: We study the generative capabilities of Boltzmann machines to recover systems governed by the majority rule under critical conditions.
The paper proves two universality theorems for single‑neuron neural networks. First, it establishes a strong form of the Bovdi–Geche universality conjecture for neurons over finite fields, employing a modified discrete logarithm activation function and the Weil bound on multiplicative character sums. Second, it generalises Aizenberg’s universality theorem to complex binary neurons with a weight vector independent of the target function, using an equidistribution theorem for dilates of maps into tori.
arXiv:2605. 26477v2 Announce Type: replace Abstract: While Deep Neural Networks (DNNs) achieve remarkable performance, their tendency to produce overconfident predictions.
We investigate message-passing graph neural networks with random node features. Random node features are known to enhance the expressiveness of graph neural networks (GNNs) both theoretically and empirically.
arXiv:2609.07184v1 Announce Type: cross Abstract: We present tensor network representations for discrete maximum entropy distributions under expectation constraints. To this end, we introduce Computa...