Search Results for author: Mathieu Guillame-Bert

Found 8 papers, 1 papers with code

Boosting gets full Attention for Relational Learning

no code implementations22 Feb 2024 Mathieu Guillame-Bert, Richard Nock

Second, what has been learned progresses back bottom-up via attention and aggregation mechanisms, progressively crafting new features that complete at the end the set of observation features over which a single tree is learned, boosting's iteration clock is incremented and new class residuals are computed.

Relational Reasoning

Generative Forests

no code implementations7 Aug 2023 Richard Nock, Mathieu Guillame-Bert

Tabular data represents one of the most prevalent form of data.

Imputation Text Generation

Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library

1 code implementation6 Dec 2022 Mathieu Guillame-Bert, Sebastian Bruch, Richard Stotz, Jan Pfeifer

Yggdrasil Decision Forests is a library for the training, serving and interpretation of decision forest models, targeted both at research and production work, implemented in C++, and available in C++, command line interface, Python (under the name TensorFlow Decision Forests), JavaScript, Go, and Google Sheets (under the name Simple ML for Sheets).

Generative Trees: Adversarial and Copycat

no code implementations26 Jan 2022 Richard Nock, Mathieu Guillame-Bert

While Generative Adversarial Networks (GANs) achieve spectacular results on unstructured data like images, there is still a gap on tabular data, data for which state of the art supervised learning still favours to a large extent decision tree (DT)-based models.

Imputation

Modeling Text with Decision Forests using Categorical-Set Splits

no code implementations21 Sep 2020 Mathieu Guillame-Bert, Sebastian Bruch, Petr Mitrichev, Petr Mikheev, Jan Pfeifer

We define a condition that is specific to categorical-set features -- defined as an unordered set of categorical variables -- and present an algorithm to learn it, thereby equipping decision forests with the ability to directly model text, albeit without preserving sequential order.

text-classification Text Classification

Exact Distributed Training: Random Forest with Billions of Examples

no code implementations18 Apr 2018 Mathieu Guillame-Bert, Olivier Teytaud

We introduce an exact distributed algorithm to train Random Forest models as well as other decision forest models without relying on approximating best split search.

Batched Lazy Decision Trees

no code implementations8 Mar 2016 Mathieu Guillame-Bert, Artur Dubrawski

We introduce a batched lazy algorithm for supervised classification using decision trees.

General Classification

Cannot find the paper you are looking for? You can Submit a new open access paper.