Deep Sprecher Network universality conjecture

Let n1n\geq 1, L1L\geq 1, and let f:[0,1]nRf:[0,1]^n\to\mathbb{R} or f:[0,1]nRmf:[0,1]^n\to\mathbb{R}^m be continuous. Consider a Sprecher Network with architecture n[d1,,dL]1n\to[d_1,\dots,d_L]\to 1 or m\to m, with continuous splines ϕ(),Φ()\phi^{(\ell)},\Phi^{(\ell)}, suitable parameters λ(),η()\lambda^{(\ell)},\eta^{(\ell)}, and optionally lateral mixing parameters τ(),ω()\tau^{(\ell)},\omega^{(\ell)}. Deep Sprecher Network universality conjecture. For every ϵ>0\epsilon>0, sufficiently large hidden widths d1,,dLd_1,\dots,d_L—possibly satisfying d2d1+1d_\ell\geq 2d_{\ell-1}+1, though this condition is not asserted to be necessary—allow the network output f^(x)\hat f(\mathbf{x}) to satisfy

supx[0,1]nf(x)f^(x)<ϵ,\sup_{\mathbf{x}\in[0,1]^n}|f(\mathbf{x})-\hat f(\mathbf{x})|<\epsilon,

with the corresponding vector-norm condition in the Rm\mathbb{R}^m case.

The conjecture concerns whether stacking multiple Sprecher blocks preserves universal approximation and whether depth or lateral mixing improves efficiency or learning dynamics. The supplied context says these properties remain unexplored, so the conjecture is open.

Sources & referencesView supporting material

Primary source

Christian Hägg, Kathlén Kohn, Giovanni Luca Marchetti and Boris Shapiro, “Sprecher Networks: A Parameter-Efficient Kolmogorov-Arnold Architecture”, arXiv:2512.19367 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.