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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Predictive learning via rule ensembles
Friedman, J. H., & Popescu, B. E. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas148 · Cited by 1,315 · cited 3×
“Although [18] discusses various techniques regarding rules, we focus on the aspect of the two-stage approach which [18] derives from [17], since it is the most relevant portion to our work due to its contrast with our interleaving approach.”
BackgroundMethodResult
Research works printed but not linked: 25
- 10.1214/09-AOAS285 · DOI · Paper page
- frank, 2010, UCI Machine Learning Repository
- freund, 2003, An efficient boosting algorithm for combining preferences, JMLR, 4, 933
- freund, 0, The alternating decision tree learning algorithm, Proc ICML, 124
- friedman, 2011, Package 'glmnet'
- friedman, 2003, Importance sampled learning ensembles
- herbrich, 2000, Large margin rank boundaries for ordinal regression, Advances in Large Margin Classifiers, 115, 10.7551/mitpress/1113.003.0010 · DOI · Paper page
- 10.1145/1143844.1143970 · DOI
- breiman, 1984, Classification and Regression Trees
- 10.1137/090759574 · DOI
- 10.1109/TIT.2010.2040894 · DOI · Paper page
- 10.1214/009053605000000255 · DOI · Paper page
- 10.1007/BF00058655 · DOI · Paper page
- bube, 1997, Hybrid $\ell^{1}/\ell^{2}$ minimization with application to tomography, Geophysics, 62, 1183, 10.1190/1.1444219 · DOI · Paper page
- breiman, 2010, Package 'RandomForest
- bach, 2009, High-Dimensional Non-Linear Variable Selection Through Hierarchical Kernel Learning
- chipman, 2010, Package 'BayesTree'
- bach, 0, Exploring large feature spaces with hierarchical multiple kernel learning, Proc NIPS
- huang, 2011, Learning with structured sparsity, JMLR, 12, 3371
- jenatton, 2011, Structured variable selection with sparsity-inducing norms, JMLR, 12, 2777
- 10.1145/1553374.1553431 · DOI · Paper page
- ridgeway, 2006, Package 'gbm' v1
- ross, 1993, Quinlan C4 5 Programs for Machine Learning
- 10.1023/A:1007614523901 · DOI · Paper page
- 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
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
Gradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887
“Moreover the GBMs have shown considerable success in not only practical applications, but also in various machine-learning and data-mining challenges (Bissacco et al., 2007; Hutchinson et al., 2011; Pittman and Brown, 2011; Johnson and Zhang, 2012).”
BackgroundCatBoost for big data: an interdisciplinary review
Hancock, J. T., & Khoshgoftaar, T. M. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00369-8 · Cited by 1,814
A boosted decision tree approach using Bayesian hyper-parameter optimization for credit scoring
Xia, Y., Liu, C., Li, Y., & Liu, N. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.02.017 · Cited by 769
Scene Classification via a Gradient Boosting Random Convolutional Network Framework
Zhang, F., Du, B., & Zhang, L. (2016) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2488681 · Cited by 424
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning Nonlinear Functions Using Regularized Greedy Forest. https://app.cochat.ai/papers/10.1109/tpami.2013.159
- The paper
- Johnson, R., & Zhang, T. (2014). Learning Nonlinear Functions Using Regularized Greedy Forest. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2013.159
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.