AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Pruning Random Forests for Prediction on a Budget

Feng Nan, Joseph Wang, Venkatesh Saligrama

NeurIPS 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning · 16 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Prune the RF using the global feature-cost and error objective40-tree RF · MiniBooNE testaverage feature cost: 42.0 -> 24.3Improved
Prune the RF using the global feature-cost and error objective40-tree RF · MiniBooNE testtest error: 6.6% -> 6.7%Hurt
Use feature-cost-aware global pruning instead of CCPRandom forest · MiniBooNE with non-uniform feature costscost-accuracy tradeoffImproved
Build the input RF using Pairs impurity rather than entropy (ablation)BudgetPrune · MiniBooNE and ForestaccuracyMixed
Build the input RF using Pairs impurity rather than entropy (ablation)BudgetPrune · MiniBooNE and Forestaccuracy in the low-cost regionImproved
Use majority voting instead of aggregating leaf class distributions (ablation)BudgetPrune · Pruned random forestsprediction errorHurt
Increase the random feature subset size at each split from k=20 to k=120 (ablation)BudgetPrune input RF · Scene15accuracyHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy