Reproduce “Random Tessellation Forests” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Shufei Ge, Shijia Wang, Yee Whye Teh, Liangliang Wang, Lloyd T. Elliott
The authors introduce a hierarchical partitioning process with oblique hyperplane cuts, including the Mondrian process as a special case. Under stated conditions on the hyperplane measure, partitions are self-consistent under restriction. In rotated simulation uRTP significantly outperforms MRTP; on GL85, weighted uRTF reaches 84.90% versus 73.01% for random forests, while schizophrenia results are comparable to logistic regression and random forests.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.