Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 180

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Learning Nonlinear Functions Using Regularized Greedy Forest

Open access
Johnson, Rie, Zhang, Tong · 2014 · IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

We consider the problem of learning a forest of nonlinear decision rules with general loss functions. The standard methods employ boosted decision trees such as Adaboost for exponential loss and Friedman's gradient boosting for general loss. In contrast to these traditional boosting algorithms that treat a tree learner as a black box, the method we propose directly learns decision forests via fully-corrective regularized greedy search using the underlying forest structure. Our method achieves higher accuracy and smaller models than gradient boosting on many of the datasets we have tested on.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpami.2013.159

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Research works printed but not linked: 25

  1. 10.1214/09-AOAS285 · DOI · Paper page
  2. frank, 2010, UCI Machine Learning Repository
  3. freund, 2003, An efficient boosting algorithm for combining preferences, JMLR, 4, 933
  4. freund, 0, The alternating decision tree learning algorithm, Proc ICML, 124
  5. friedman, 2011, Package 'glmnet'
  6. friedman, 2003, Importance sampled learning ensembles
  7. herbrich, 2000, Large margin rank boundaries for ordinal regression, Advances in Large Margin Classifiers, 115, 10.7551/mitpress/1113.003.0010 · DOI · Paper page
  8. 10.1145/1143844.1143970 · DOI
  9. breiman, 1984, Classification and Regression Trees
  10. 10.1137/090759574 · DOI
  11. 10.1109/TIT.2010.2040894 · DOI · Paper page
  12. 10.1214/009053605000000255 · DOI · Paper page
  13. 10.1007/BF00058655 · DOI · Paper page
  14. bube, 1997, Hybrid $\ell^{1}/\ell^{2}$ minimization with application to tomography, Geophysics, 62, 1183, 10.1190/1.1444219 · DOI · Paper page
  15. breiman, 2010, Package 'RandomForest
  16. bach, 2009, High-Dimensional Non-Linear Variable Selection Through Hierarchical Kernel Learning
  17. chipman, 2010, Package 'BayesTree'
  18. bach, 0, Exploring large feature spaces with hierarchical multiple kernel learning, Proc NIPS
  19. huang, 2011, Learning with structured sparsity, JMLR, 12, 3371
  20. jenatton, 2011, Structured variable selection with sparsity-inducing norms, JMLR, 12, 2777
  21. 10.1145/1553374.1553431 · DOI · Paper page
  22. ridgeway, 2006, Package 'gbm' v1
  23. ross, 1993, Quinlan C4 5 Programs for Machine Learning
  24. 10.1023/A:1007614523901 · DOI · Paper page
  25. schapire, 2003, The boosting approach to machine learning: An overview, Nonlinear Estimation Classification, 10.1007/978-0-387-21579-2_9 · DOI · Paper page

Cited by

Metadata

Authors
Johnson, R., & Zhang, T.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2014-05
Volume
36
Issue
5
Pages
942-954
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
OpenAlex
W2149591630
Cited by
180
References
4
FWCI
5.45
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.