mlsanityData to 14 Oct 2026

PACE: Prune-And-Compress Ensemble Models

arXiv 2605.06278 ↗First posted 7 May 2026cs.LG math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

Ensemble models achieve state-of-the-art performance on prediction tasks, but usually require aggregating a large number of weak learners. This can hinder deployment, interpretability, and downstream tasks such as robustness verification. Remedies to this issue fall into two main camps: pruning, which discards redundant learners, and compression, which generates new ones from scratch. We introduce PACE, a framework that interleaves these paradigms in a two-phase strategy. First, new learners are actively generated via a theoretically grounded procedure to enhance the diversity of the initial ensemble. When no more relevant learners can be found, a second phase of pruning is performed on this enriched ensemble. During both operations, PACE allows fine control on the faithfulness to the original ensemble. Experiments show that our method outperforms prior pruning and compression methods while offering principled control of faithfulness guarantees.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 70 references that are in the map. First posted on arXiv 7 May 2026.

Builds on

20 of 70 references.

References · 20

  1. 2018Rethinking the Value of Network Pruningcited by 599
  2. 2014OpenML: networked science in machine learningcited by 526
  3. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 202
  4. 2019Network Pruning via Transformable Architecture Searchcited by 80
  5. 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
  6. 2022Advancing Model Pruning via Bi-level Optimizationcited by 56
  7. 2023Pruning vs Quantization: Which is Better?cited by 46
  8. 2023Fast as CHITA: Neural Network Pruning with Combinatorial Optimizationcited by 40
  9. 2020Born-Again Tree Ensemblescited by 38
  10. 2021Optimal Counterfactual Explanations in Tree Ensemblescited by 36
  11. 2019Robustness Verification of Tree-based Modelscited by 33
  12. 2016Interpreting Models via Single Tree Approximationcited by 17
8 more
  1. 2022Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracycited by 15
  2. 2024Trained Random Forests Completely Reveal your Datasetcited by 11
  3. 2024FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruningcited by 11
  4. 2020Boosting Frank-Wolfe by Chasing Gradientscited by 10
  5. 2022ForestPrune: Compact Depth-Controlled Tree Ensemblescited by 7
  6. 2024Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensemblescited by 4
  7. 2023Dynamic Decision Tree Ensembles for Energy-Efficient Inference on IoT Edge Nodescited by 3
  8. 2025Boosting Revisited: Benchmarking and Advancing LP-Based Ensemble Methodscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.