paper-with-me

Papers

Adaptive Forests For Classification

2025-10-27 · Dimitris Bertsimas, Yubing Cui arxiv

Random Forests (RF) and Extreme Gradient Boosting (XGBoost) are two of the most widely used and highly performing classification and regression models. They aggregate equally weighted CART trees, generated randomly in RF or sequentially in XGBoost. In this paper, we propose Adaptive Forests (AF), a novel approach that adaptively selects the weights of the underlying CART models. AF combines (a) the Optimal Predictive-Policy Trees (OP2T) framework to prescribe tailored, input-dependent unequal weights to trees and (b) Mixed Integer Optimization (MIO) to refine weight candidates dynamically, enhancing overall performance. We demonstrate that AF consistently outperforms RF, XGBoost, and other weighted RF in binary and multi-class classification problems over 20+ real-world datasets.

📄 PDF Abstract BibTeX arXiv:2510.22991

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-class Classification

Similar Papers 제목 키워드 기반

Vectorized Adaptive Histograms for Sparse Oblique Forests

2026-02-27 · Ariel Lubonja, Jungsang Yoon, Haoyin Xu, Yue Wan 외 arxiv

Classification using sparse oblique random forests provides guarantees on uncertainty and confidence while controlling for specific error types. However, they use more data and more compute than other tree ensembles beca…

Dynamic Connected Neural Decision Classifier and Regressor with Dynamic Softing Pruning

2019-11-13 · Xinyu Fan

To deal with various datasets over different complexity, this paper presents an self-adaptive learning model that combines the proposed Dynamic Connected Neural Decision Networks (DNDN) and a new pruning method--Dynamic …

ClassificationGeneral ClassificationRepresentation Learning

Minimax optimal rates for Mondrian trees and forests

2018-03-15 · Jaouad Mourtada, Stéphane Gaïffas, Erwan Scornet

Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One parti…

Alternating Decision Forests

2013-06-01 · CVPR 2013 6 · Samuel Schulter, Paul Wohlhart, Christian Leistner, Amir Saffari 외

This paper introduces a novel classification method termed Alternating Decision Forests (ADFs), which formulates the training of Random Forests explicitly as a global loss minimization problem. During training, the losse…

object-detectionObject Detection

Lassoed Forests: Random Forests with Adaptive Lasso Post-selection

2025-11-10 · Jing Shang, James Bannon, Benjamin Haibe-Kains, Robert Tibshirani arxiv

Random forests are a statistical learning technique that use bootstrap aggregation to average high-variance and low-bias trees. Improvements to random forests, such as applying Lasso regression to the tree predictions, h…