Adversarial random forests for density estimation and generative modeling
원문 초록
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}$.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Binned semiparametric Bayesian networks
How Good Are Synthetic Requirements ? Evaluating LLM-Generated Datasets for AI4RE
EBC-ZIP: Improving Blockwise Crowd Counting with Zero-Inflated Poisson Regression
Scaling-Up the Pretraining of the Earth Observation Foundation Model PhilEO to the MajorTOM Dataset
SDialog: A Python Toolkit for Synthetic Dialogue Generation and Analysis
Cosmos-Drive-Dreams: Scalable Synthetic Driving Data Generation with World Foundation Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.