no code implementations • 1 Jan 2021 • Yutong Xie, Gaoxiang Chen, Quanzheng Li
Inspired by the proof of this upper bound and the framework of matrix computation in \citet{hinz2019framework}, we propose a general computational approach to compute a tight upper bound of regions number for theoretically any network structures (e. g. DNN with all kind of skip connections and residual structures).
no code implementations • 8 Dec 2020 • Yutong Xie, Gaoxiang Chen, Quanzheng Li
Inspired by the proof of this upper bound and theframework of matrix computation in Hinz & Van de Geer (2019), we propose ageneral computational approach to compute a tight upper bound of regions numberfor theoretically any network structures (e. g. DNN with all kind of skip connec-tions and residual structures).
2 code implementations • MIDL 2019 • Jun Ma, Zhan Wei, Yiwen Zhang, Yixin Wang, Rongfei Lv, Cheng Zhu, Gaoxiang Chen, Jianan Liu, Chao Peng, Lei Wang, Yunpeng Wang, Jianan Chen
The \emph{second contribution} is that we systematically evaluated five benchmark methods on two representative public datasets.