AI & ML
On the (non-)closedness of the set of ReLU networks
arXiv cs.NA0 views
arXiv:2611.09887v1 Announce Type: cross Abstract: We prove that the set $\mathcal{N}_N$ of ReLU networks with one hidden layer and at most $N\in\mathbb N$ neurons is weakly closed in $W^{1,p}(\Omega)$, for a bounded connected open set $\Omega\subset\mathbb R^d$. Consequently, every coercive, weakly lower semicontinuous energy on this space attains its minimum over $\mathcal{N}_N$. This covers the Deep Ritz method with convex integrands, Sobolev training and Lipschitz learning. Moreover, as the weight decay parameter tends to zero, minimizers of the regularized problem converge, up to subsequences, to minimizers with minimal parameter norm. We also prove that the set of ReLU networks with two hidden layers of bounded widths is not closed in $W^{1,p}(\Omega)$ or in $C(\overline\Omega)$. This disproves a conjecture of Petersen, Raslan and Voigtlaender.
Source:https://arxiv.org/abs/2611.09887PreviousEfficient iterative methods for the nonlinear compressible Reynolds equation with Navier slip boundary conditionNextThe Finite Difference Method, for the heat equation on Sierpi\'{n}ski simplices
Related posts
What free AI training in Nepal can teach you before you pay for a class
0dev.to

Agents draft. People decide.
0dev.to UX

โค้ดเพิ่ม 400% แต่คุณไม่ได้เร็วขึ้น 400%: GitHub ชี้คอขวดใหม่อยู่ที่การรีวิว
0dev.to GitHub

Drago: Your GitHub Dragon
0dev.to GitHub
Case Study: Automating Tableau to Power BI Migration with Up to 90% Accuracy.
0dev.to Data
Vom Bluttest ins Molekül: Warum die Alamar/Nightingale-Studie räumliches Denken braucht...
0dev.to Data