Multiple Instance Learning with Trainable Decision Tree Ensembles

02/13/2023
by   Andrei V. Konstantinov, et al.
0

A new random forest based model for solving the Multiple Instance Learning (MIL) problem under small tabular data, called Soft Tree Ensemble MIL (STE-MIL), is proposed. A new type of soft decision trees is considered, which is similar to the well-known soft oblique trees, but with a smaller number of trainable parameters. In order to train the trees, it is proposed to convert them into neural networks of a specific form, which approximate the tree functions. It is also proposed to aggregate the instance and bag embeddings (output vectors) by using the attention mechanism. The whole STE-MIL model, including soft decision trees, neural networks, the attention mechanism and a classifier, is trained in an end-to-end manner. Numerical experiments with tabular datasets illustrate STE-MIL. The corresponding code implementing the model is publicly available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2023

Neural Attention Forests: Transformer-Based Forest Improvement

A new approach called NAF (the Neural Attention Forest) for solving regr...
research
04/03/2020

Unpack Local Model Interpretation for GBDT

A gradient boosting decision tree (GBDT), which aggregates a collection ...
research
12/07/2017

End-to-end Learning of Deterministic Decision Trees

Conventional decision trees have a number of favorable properties, inclu...
research
05/25/2022

A Neural Tangent Kernel Formula for Ensembles of Soft Trees with Arbitrary Architectures

A soft tree is an actively studied variant of a decision tree that updat...
research
12/29/2020

Growing Deep Forests Efficiently with Soft Routing and Learned Connectivity

Despite the latest prevailing success of deep neural networks (DNNs), se...
research
07/04/2018

Generating Mandarin and Cantonese F0 Contours with Decision Trees and BLSTMs

This paper models the fundamental frequency contours on both Mandarin an...
research
09/26/2014

Autoencoder Trees

We discuss an autoencoder model in which the encoding and decoding funct...

Please sign up or login with your details

Forgot password? Click here to reset