Random Forest Super Greedy Trees
Overview
Implements random forest Super Greedy Trees (SGTs) for regression. SGTs extend classification and regression tree splitting by fitting lasso-penalized local parametric models at tree nodes, producing sparse univariate and multivariate geometric cuts such as axis-aligned splits, hyperplanes, ellipsoids, hyperboloids, and interaction-based cuts. Trees are grown best-split-first by selecting cuts that reduce empirical risk, and ensembles provide out-of-bag error estimation, prediction on new data, variable filtering, tuning of the hcut complexity parameter, coordinate-descent lasso fitting, variable importance, and local coefficient summaries. For the underlying method, see Ishwaran (2026) doi:10.1007/s10462-026-11541-6.
- Initial release.
From NEWS.md in the release
Install
Health
- OK13 OK2026-08-05
- NOTE12 OK, 1 NOTE2026-08-01
- OK13 OK2026-06-09
- ERROR12 OK, 1 ERROR2026-06-08
- OK8 OK2026-05-12
Documentation
- Help pages
- 6 (1 internal)
- Examples that run
- 67%2 run in a plain check · 1 only when donttest examples are enabled (R CMD check --as-cran)
- Exported functions with examples
- 50%
- Documented parameters
- 89%
- Return-value docs
- 100%
- Help pages citing references
- 50%
Downloads
Repository
Forks over time
Checks run against github.com/kogalur/randomforestsgt on 2026-10-18.
No development-tooling practices detected in the upstream repository.
Dependencies
Code & Tests
People & History
- 1.0.0Latestfirst seen 2026-05-11 · current release
- RR 4.6.0 released · 2026-04-24
Package metadata
- First seen
- 2026-05-11
- Total releases
- 1 / 1 yrs
- License
- GPL (>= 3) OSI
- Minimum R
- ≥ 4.3.0
- Download size
- 166 KB
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("randomForestSGT")The package provides a citation file that builds its entry when R runs it. Run citation() to see it.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-22, which the citation names so these numbers can be found later. More on citing and the projects behind them.