mlsanityData to 14 Oct 2026

FUTURE: Flexible Unlearning for Tree Ensemble

arXiv 2508.21181 ↗First posted 28 Aug 2025cs.LG cs.AIcited by 3

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Tree ensembles are widely recognized for their effectiveness in classification tasks, achieving state-of-the-art performance across diverse domains, including bioinformatics, finance, and medical diagnosis. With increasing emphasis on data privacy and the textitright to be forgotten, several unlearning algorithms have been proposed to enable tree ensembles to forget sensitive information. However, existing methods are often tailored to a particular model or rely on the discrete tree structure, making them difficult to generalize to complex ensembles and inefficient for large-scale datasets. To address these limitations, we propose FUTURE, a novel unlearning algorithm for tree ensembles. Specifically, we formulate the problem of forgetting samples as a gradient-based optimization task. In order to accommodate non-differentiability of tree ensembles, we adopt the probabilistic model approximations within the optimization framework. This enables end-to-end unlearning in an effective and efficient manner. Extensive experiments on real-world datasets show that FUTURE yields significant and successful unlearning performance.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 12 of its 31 references that are in the map. First posted on arXiv 28 Aug 2025.

Builds on

12 of 31 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025Speech Unlearning1 Jun
  2. 2025Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond7 Feb
  3. 2025Tool Unlearning for Tool-Augmented LLMs3 Feb
  4. 2024Rethinking Machine Unlearning for Large Language Models13 Feb

Other references · 8

  1. 2019Machine Unlearningcited by 1,061
  2. 2020Machine Unlearning for Random Forestscited by 131
  3. 2019FOCUS: Flexible Optimizable Counterfactual Explanations for Tree Ensemblescited by 43
  4. 2019Relational Collaborative Filtering:Modeling Multiple Item Relations for Recommendationcited by 23
  5. 2017Neural Decision Treescited by 17
  6. 2021From None to Severe: Predicting Severity in Movie Scriptscited by 8
  7. 2023Positive and Risky Message Assessment for Music Productscited by 6
  8. 2025Transformers Boost the Performance of Decision Trees on Tabular Data across Sample Sizescited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024DynFrs: An Efficient Framework for Machine Unlearning in Random Forest
  2. 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning
  3. 2023SAFE: Machine Unlearning With Shard Graphs
  4. 2025Towards Aligned Data Forgetting via Twin Machine Unlearning
  5. 2025When to Forget? Complexity Trade-offs in Machine Unlearning
  6. 2026Efficient Unlearning through Maximizing Relearning Convergence Delay
  7. 2025Group-robust Machine Unlearning
  8. 2024Learning to Unlearn for Robust Machine Unlearning