Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with ReLU gates:
TR17-190 | 6th November 2017
Anirbit Mukherjee, Amitabh Basu

Lower bounds over Boolean inputs for deep neural networks with ReLU gates.

Motivated by the resurgence of neural networks in being able to solve complex learning tasks we undertake a study of high depth networks using ReLU gates which implement the function $x \mapsto \max\{0,x\}$. We try to understand the role of depth in such neural networks by showing size lowerbounds against ... more >>>

ISSN 1433-8092 | Imprint