Fast Interpretable Greedy-Tree Sums for Tree Ensembles R package figsr version 0.1.1 Flexible, interpretable machine learning algorithm for additive tree sums (FIGS). Fits a sum of shallow classification and regression trees (CART) by greedily minimizing residual impurity, growing a new tree or deepening an existing one at each step, whichever reduces the residuals most. Supports regression and two-class classification, variable importance, bootstrap ensembling and seamless integration with 'parsnip' and 'tidymodels' workflows. The method is described in Tan et al. (2023) <doi:10.1073/pnas.2310151122>. Software Depends: R (>= 4.1) Imports: dials, graphics, parsnip, rlang, stats, tibble Suggests: knitr, rmarkdown, testthat (>= 3.0.0) João Paulo Assis Bonifácio <jpab.27@hotmail.com> Comprehensive R Archive Network (CRAN) João Paulo Assis Bonifácio [aut, cre, cph] (ORCID: <https://orcid.org/0009-0009-2335-8391>), Geraldo Magela da Cruz Pereira [aut, cph] (ORCID: <https://orcid.org/0000-0001-6280-4870>), Pedro Mambelli Fernandes [aut, cph] (ORCID: <https://orcid.org/0009-0001-1695-279X>), João Vitor Andrade Alves de Souza [aut, cph] (ORCID: <https://orcid.org/0009-0006-2780-318X>) MIT + file LICENSE (https://CRAN.R-project.org/package=figsr/LICENSE) 2026-08-31 application/tgz https://CRAN.R-project.org/package=figsr doi:10.32614/CRAN.package.figsr en-US