paper-with-me

홈 › Papers

Watermarking Decision Tree Ensembles

2024-10-06 · Stefano Calzavara, Lorenzo Cazzaro, Donald Gera, Salvatore Orlando

Protecting the intellectual property of machine learning models is a hot topic and many watermarking schemes for deep neural networks have been proposed in the literature. Unfortunately, prior work largely neglected the investigation of watermarking techniques for other types of models, including decision tree ensembles, which are a state-of-the-art model for classification tasks on non-perceptual data. In this paper, we present the first watermarking scheme designed for decision tree ensembles, focusing in particular on random forest models. We discuss watermark creation and verification, presenting a thorough security analysis with respect to possible attacks. We finally perform an experimental evaluation of the proposed scheme, showing excellent results in terms of accuracy and security against the most relevant threats.

📄 PDF Abstract BibTeX arXiv:2410.04570

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Boosting-Based Sequential Meta-Tree Ensemble Construction for Improved Decision Trees

2024-02-09 · Ryota Maniwa, Naoki Ichijo, Yuta Nakahara, Toshiyasu Matsushima

A decision tree is one of the most popular approaches in machine learning fields. However, it suffers from the problem of overfitting caused by overly deepened trees. Then, a meta-tree is recently proposed. It solves the…

On Computing Optimal Tree Ensembles

2023-06-07 · Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge

Random forests and, more generally, (decision\nobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for variou…

Robust Watermarking on Gradient Boosting Decision Trees

2025-11-12 · Jun Woo Chung, Yingjie Lao, Weijie Zhao arxiv

Gradient Boosting Decision Trees (GBDTs) are widely used in industry and academia for their high accuracy and efficiency, particularly on structured data. However, watermarking GBDT models remains underexplored compared …

Verifiable Learning for Robust Tree Ensembles

2023-05-05 · Stefano Calzavara, Lorenzo Cazzaro, Giulio Ermanno Pibiri, Nicola Prezza

Verifying the robustness of machine learning models against evasion attacks at test time is an important research problem. Unfortunately, prior work established that this problem is NP-hard for decision tree ensembles, h…

ForestPrune: Compact Depth-Controlled Tree Ensembles

2022-05-31 · Brian Liu, Rahul Mazumder

Tree ensembles are powerful models that achieve excellent predictive performances, but can grow to unwieldy sizes. These ensembles are often post-processed (pruned) to reduce memory footprint and improve interpretability…