Multiple Instance Learning with Trainable Decision Tree Ensembles

Andrei V. Konstantinov, Lev V. Utkin
2/13/2023
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{konstantinov2023multiple,
  title  = {Multiple Instance Learning with Trainable Decision Tree Ensembles},
  author = {Andrei V. Konstantinov and Lev V. Utkin},
  year   = {2023},
  eprint = {2302.06601},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.06601v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.06601.svg)](https://codeofpaper.com/paper/2302.06601)

Discussion