paper-with-me

Papers

Adaptive Neural Trees

2018-07-17 · ICLR 2019 5 · Ryutaro Tanno, Kai Arulkumaran, Daniel C. Alexander, Antonio Criminisi, Aditya Nori

Deep neural networks and decision trees operate on largely separate paradigms; typically, the former performs representation learning with pre-specified architectures, while the latter is characterised by learning hierarchies over pre-specified features with data-driven architectures. We unite the two via adaptive neural trees (ANTs) that incorporates representation learning into edges, routing functions and leaf nodes of a decision tree, along with a backpropagation-based training algorithm that adaptively grows the architecture from primitive modules (e.g., convolutional layers). We demonstrate that, whilst achieving competitive performance on classification and regression datasets, ANTs benefit from (i) lightweight inference via conditional computation, (ii) hierarchical separation of features useful to the task e.g. learning meaningful class associations, such as separating natural vs. man-made objects, and (iii) a mechanism to adapt the architecture to the size and complexity of the training dataset.

📄 PDF Abstract BibTeX arXiv:1807.06699

Code (1)

rtanno21609/AdaptiveNeuralTrees 공식 구현 pytorch

Tasks

General ClassificationRepresentation Learning

Similar Papers 제목 키워드 기반

Hoeffding adaptive splitting trees for data stream classification with concept drift and ensemble learning

2026-08-17 · Daniel Nowak Assis, Jean Paul Barddal, Fabrício Enembreck arxiv

Ensembles of decision trees are well-established methods for data stream classification. In ensemble learning, Hoeffding Trees are widely adopted as base learners, performing periodic split attempts according to the Hoef…

Ensemble LearningChange Detection

Fast Inference of Visual Autoregressive Model with Adjacency-Adaptive Dynamical Draft Trees

2025-12-26 · Haodong Lei, Hongsong Wang, Xin Geng, Liang Wang 외 arxiv

Autoregressive (AR) image models achieve diffusion-level quality but suffer from sequential inference, requiring approximately 2,000 steps for a 576x576 image. Speculative decoding with draft trees accelerates LLMs yet u…

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…

Multi-class Classification

Alpha-Trimming: Locally Adaptive Tree Pruning for Random Forests

2024-08-13 · Nikola Surjanovic, Andrew Henrey, Thomas M. Loughin

We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruni…

Adaptive Concentration of Regression Trees, with Application to Random Forests

2015-03-22 · Stefan Wager, Guenther Walther

We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a …

Model Selectionregressionvalid