pith. sign in

arxiv: 1602.06183 · v1 · pith:R32OT5RGnew · submitted 2016-02-19 · 💻 cs.LG

Node-By-Node Greedy Deep Learning for Interpretable Features

classification 💻 cs.LG
keywords deeplearningalgorithminterpretablenetworknetworksnodeperformance
0
0 comments X
read the original abstract

Multilayer networks have seen a resurgence under the umbrella of deep learning. Current deep learning algorithms train the layers of the network sequentially, improving algorithmic performance as well as providing some regularization. We present a new training algorithm for deep networks which trains \emph{each node in the network} sequentially. Our algorithm is orders of magnitude faster, creates more interpretable internal representations at the node level, while not sacrificing on the ultimate out-of-sample performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.