Cover Image

PACE: Prune-And-Compress Ensemble Models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akkerman, Fabian, Ferry, Julien, Guyard, Théo, Vidal, Thibaut
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
by: Emine, Youssouf, et al.
Published: (2024)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
by: Elvira, Clément, et al.
Published: (2025)

Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles
by: Forel, Alexandre, et al.
Published: (2022)

El0ps: An Exact L0-regularized Problems Solver
by: Guyard, Théo, et al.
Published: (2025)

Boosting Revisited: Benchmarking and Advancing LP-Based Ensemble Methods
by: Akkerman, Fabian, et al.
Published: (2025)

Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control
by: Jungel, Kai, et al.
Published: (2023)

DistrictNet: Decision-aware learning for geographical districting
by: Ahmed, Cheikh, et al.
Published: (2024)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
by: Liang, Jiaqi, et al.
Published: (2024)

Contextual Stochastic Vehicle Routing with Time Windows
by: Serrano, Breno, et al.
Published: (2024)

A Survey of Contextual Optimization Methods for Decision Making under Uncertainty
by: Sadana, Utsav, et al.
Published: (2023)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Optimization Benchmark for Diffusion Models on Dynamical Systems
by: Schaipp, Fabian
Published: (2025)

Don't Be Greedy, Just Relax! Pruning LLMs via Frank-Wolfe
by: Roux, Christophe, et al.
Published: (2025)

Subsampled Ensemble Can Improve Generalization Tail Exponentially
by: Qian, Huajie, et al.
Published: (2024)

Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms
by: Khouna, Awa, et al.
Published: (2026)

LEVDA: Latent Ensemble Variational Data Assimilation via Differentiable Dynamics
by: Si, Phillip, et al.
Published: (2026)

An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems
by: Bao, Feng, et al.
Published: (2023)

Wasserstein Distributionally Robust Shallow Convex Neural Networks
by: Pallage, Julien, et al.
Published: (2024)

Online Dynamic Submodular Optimization
by: Lesage-Landry, Antoine, et al.
Published: (2023)

Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise
by: Ramirez, Juan, et al.
Published: (2025)

A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
by: Xu, Ziqing, et al.
Published: (2025)

Accelerated Distributed Optimization with Compression and Error Feedback
by: Gao, Yuan, et al.
Published: (2025)

Supervised Feature Compression based on Counterfactual Analysis
by: Piccialli, Veronica, et al.
Published: (2022)

Improved Compression Bounds for Scenario Decision Making
by: Berger, Guillaume O.
Published: (2025)

Bayesian Optimization with Preference Exploration using a Monotonic Neural Network Ensemble
by: Wang, Hanyang, et al.
Published: (2025)

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
by: Yan, Yu-Hu, et al.
Published: (2023)

Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks
by: Bernardelli, Ambrogio Maria, et al.
Published: (2022)

Machine Learning for K-adaptability in Two-stage Robust Optimization
by: Julien, Esther, et al.
Published: (2022)

Stability of Data-Dependent Ridge-Regularization for Inverse Problems
by: Neumayer, Sebastian, et al.
Published: (2024)

A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming
by: Bonasera, Lorenzo, et al.
Published: (2024)

Neural Collapse under Gradient Flow on Shallow ReLU Networks for Orthogonally Separable Data
by: Min, Hancheng, et al.
Published: (2025)

The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
by: Schaipp, Fabian, et al.
Published: (2025)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
by: Liu, Wei, et al.
Published: (2025)

Solving Sparse \& High-Dimensional-Output Regression via Compression
by: Li, Renyuan, et al.
Published: (2024)

Compression-aware Training of Neural Networks using Frank-Wolfe
by: Zimmer, Max, et al.
Published: (2022)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
by: Bonet, Clément, et al.
Published: (2024)

Nesterov Acceleration for Ensemble Kalman Inversion and Variants
by: Vernon, Sydney, et al.
Published: (2025)

Position: Adopt Constraints Over Fixed Penalties in Deep Learning
by: Ramirez, Juan, et al.
Published: (2025)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)