mlsanityData to 14 Oct 2026

Robust Watermarking on Gradient Boosting Decision Trees

arXiv 2511.09822 ↗First posted 12 Nov 2025cs.AIcited by 0

Not on the map. Why?

Abstract (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 to neural networks. In this work, we present the first robust watermarking framework tailored to GBDT models, utilizing in-place fine-tuning to embed imperceptible and resilient watermarks. We propose four embedding strategies, each designed to minimize impact on model accuracy while ensuring watermark robustness. Through experiments across diverse datasets, we demonstrate that our methods achieve high watermark embedding rates, low accuracy degradation, and strong resistance to post-deployment fine-tuning.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). First posted on arXiv 12 Nov 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026DRGW: Learning Disentangled Representations for Robust Graph Watermarking
  2. 2024Watermarking Decision Tree Ensembles
  3. 2026Decoder Gradient Shields: A Family of Provable and High-Fidelity Methods Against Gradient-Based Box-Free Watermark Removal
  4. 2025Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data
  5. 2022Quantized Training of Gradient Boosting Decision Trees
  6. 2025When There Is No Decoder: Removing Watermarks from Stable Diffusion Models in a No-box Setting
  7. 2021Don't Forget to Sign the Gradients!
  8. 2024Robustness of Watermarking on Text-to-Image Diffusion Models