Lune

ICLR2025顶会

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth

Gennadiy Averkov, Christopher Hojny, Maximilian Merkert

2025年份
2顶会引用

摘要

To confirm that the expressive power of ReLU neural networks grows with their depth, the function Fn=max⁡{0,x1,…,xn}F_n = \max \{0,x_1,\ldots,x_n\} has been considered in the literature. A conjecture by Hertrich, Basu, Di Summa, and Skutella [NeurIPS 2021] states that any ReLU network that exactly represents FnF_n has at least ⌈log⁡2(n+1)⌉\lceil\log_2 (n+1)\rceil hidden layers. The conjecture has recently been confirmed for networks with integer weights by Haase, Hertrich, and Loho [ICLR 2023]. We follow up on this line of research and show that, within ReLU networks whose weights are decimal fractions, FnF_n can only be represented by networks with at least ⌈log⁡3(n+1)⌉\lceil\log_3 (n+1)\rceil hidden layers. Moreover, if all weights are NN-ary fractions, then FnF_n can only be represented by networks with at least Ω(ln⁡nln⁡ln⁡N)Ω( \frac{\ln n}{\ln \ln N}) layers. These results are a partial confirmation of the above conjecture for rational ReLU networks, and provide the first non-constant lower bound on the depth of practically relevant ReLU networks.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

lune papers fulltext 59afa650-72b9-4a39-b599-d3a4e89e4c7d

引用它的顶会 Paper2

问问它们各自怎么用它

它引用的顶会 Paper8

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖