Skip to content

arf

Adversarial Random Forests

v0.2.4 · Feb 24, 2025 · GPL (>= 3)

Description

Adversarial random forests (ARFs) recursively partition data into fully factorized leaves, where features are jointly independent. The procedure is iterative, with alternating rounds of generation and discrimination. Data becomes increasingly realistic at each round, until original and synthetic samples can no longer be reliably distinguished. This is useful for several unsupervised learning tasks, such as density estimation and data synthesis. Methods for both are implemented in this package. ARFs naturally handle unstructured data with mixed continuous and categorical covariates. They inherit many of the benefits of random forests, including speed, flexibility, and solid performance with default parameters. For details, see Watson et al. (2023) <https://proceedings.mlr.press/v206/watson23a.html>.

Downloads

357

Last 30 days

10722nd

1.1K

Last 90 days

4K

Last year

Trend: -17.2% (30d vs prior 30d)

CRAN Check Status

14 OK
Show all 14 flavors
Flavor Status
r-devel-linux-x86_64-debian-clang OK
r-devel-linux-x86_64-debian-gcc OK
r-devel-linux-x86_64-fedora-clang OK
r-devel-linux-x86_64-fedora-gcc OK
r-devel-macos-arm64 OK
r-devel-windows-x86_64 OK
r-oldrel-macos-arm64 OK
r-oldrel-macos-x86_64 OK
r-oldrel-windows-x86_64 OK
r-patched-linux-x86_64 OK
r-release-linux-x86_64 OK
r-release-macos-arm64 OK
r-release-macos-x86_64 OK
r-release-windows-x86_64 OK

Check History

OK 14 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE Mar 10, 2026

Reverse Dependencies (2)

suggests

Dependency Network

Dependencies Reverse dependencies data.table ranger foreach stringr truncnorm RFAE xplainfi arf

Version History

new 0.2.4 Mar 10, 2026
updated 0.2.4 ← 0.2.0 diff Feb 23, 2025
updated 0.2.0 ← 0.1.3 diff Jan 23, 2024
updated 0.1.3 ← 0.1.2 diff Feb 5, 2023
new 0.1.2 Dec 15, 2022