HackerPapers

arXiv:1702.08835cs.LG

Deep Forest

Zhi-Hua Zhou, Ji Feng

Abstract

Current deep learning models are mostly build upon neural networks, i.e., multiple layers of parameterized differentiable nonlinear modules that can be trained by backpropagation. In this paper, we explore the possibility of building deep models based on non-differentiable modules. We conjecture that the mystery behind the success of deep neural networks owes much to three characteristics, i.e., layer-by-layer processing, in-model feature transformation and sufficient model complexity. We propose the gcForest approach, which generates \textit{deep forest} holding these characteristics. This is a decision tree ensemble approach, with much less hyper-parameters than deep neural networks, and its model complexity can be automatically determined in a data-dependent way. Experiments show that its performance is quite robust to hyper-parameter settings, such that in most cases, even across different data from different domains, it is able to get excellent performance by using the same default setting. This study opens the door of deep learning based on non-differentiable modules, and exhibits the possibility of constructing deep models without using backpropagation.

arXiv comments
Journal reference
National Science Review, 2019, 6(1): 74-86
DOI
Subjects
cs.LGMachine Learning stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 3 identifiable commenters in 3 comments across 3 threads, from Mar 2017 to Mar 2026. Found in 1 HN submission from Mar 2017 to Mar 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments3 threads

    • > So NNs too really (damn autocorrect, it's rely, rely) on human insight and structuring upon which they can then build over. If so, one can repeat it with other basic models as well. It is possible to train deep decision trees forests [1]. Then I believe that it is possible to…

      theszView on HNParent context

    • Very interesting; I've ignored random forests more than I should. Thank you! I won't comment on your methods except to say that comparing classification over linear PCA against a kernel PCA in linearly unseparable data isn't exactly fair, and I think that providing an SVM…

      stochastic_monkView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.