We propose methods for density estimation and data synthesis using a novel form of unsupervised random forests. Inspired by generative adversarial networks, we implement a recursive procedure in which trees gradually learn structural properties of the data through alternating rounds of generation and discrimination. The method is provably consistent under minimal assumptions. Unlike classic tree-based alternatives, our approach provides smooth (un)conditional densities and allows for fully synthetic data generation. We achieve comparable or superior performance to state-of-the-art probabilistic circuits and deep learning models on various tabular data benchmarks while executing about two orders of magnitude faster on average. An accompanying $\texttt{R}$ package, $\texttt{arf}$, is available on $\texttt{CRAN}$.

翻译：我们提出了一种基于新型无监督随机森林的密度估计与数据合成方法。受生成对抗网络的启发，我们实现了一种递归过程，其中树通过交替进行生成与判别轮次，逐步学习数据的结构特性。该方法在极小假设条件下具有可证明的一致性。与经典树基替代方案不同，我们的方法提供了平滑的（无）条件密度，并支持全合成数据生成。在各类表格数据基准测试中，我们达到了与先进概率电路及深度学习模型相当或更优的性能，同时平均执行速度快约两个数量级。配套的$\texttt{R}$包$\texttt{arf}$已在$\texttt{CRAN}$上发布。