Centrum: Model-based Database Auto-tuning with Minimal Distributional Assumptions
Not on the map. Why?
Abstract (arXiv)
Gaussian-Process-based Bayesian optimization (GP-BO), is a prevailing model-based framework for DBMS auto-tuning. However, recent work shows GP-BO-based DBMS auto-tuners significantly outperformed auto-tuners based on SMAC, which features random forest surrogate models; such results motivate us to rethink and investigate the limitations of GP-BO in auto-tuner design. We find the fundamental assumptions of GP-BO are widely violated when modeling and optimizing DBMS performance, while tree-ensemble-BOs (e.g., SMAC) can avoid the assumption pitfalls and deliver improved tuning efficiency and effectiveness. Moreover, we argue that existing tree-ensemble-BOs restrict further advancement in DBMS auto-tuning. First, existing tree-ensemble-BOs can only achieve distribution-free point estimates, but still impose unrealistic distributional assumptions on uncertainty estimates, compromising surrogate modeling and distort the acquisition function. Second, recent advances in gradient boosting, which can further enhance surrogate modeling against vanilla GP and random forest counterparts, have rarely been applied in optimizing DBMS auto-tuners. To address these issues, we propose a novel model-based DBMS auto-tuner, Centrum. Centrum improves distribution-free point and interval estimation in surrogate modeling with a two-phase learning procedure of stochastic gradient boosting ensembles. Moreover, Centrum adopts a generalized SGBE-estimated locally-adaptive conformal prediction to facilitate a distribution-free uncertainty estimation and acquisition function. To our knowledge, Centrum is the first auto-tuner to realize distribution-freeness, enhancing BO's practicality in DBMS auto-tuning, and the first to seamlessly fuse gradient boosting ensembles and conformal inference in BO. Extensive physical and simulation experiments on two DBMSs and three workloads show Centrum outperforms 21 SOTA methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 35 references that are in the map. First posted on arXiv 26 Oct 2025.
Builds on
18 of 35 references.
References · 18
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2021Revisiting Deep Learning Models for Tabular Datacited by 725
- 2016Distribution-Free Predictive Inference For Regressioncited by 657
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 178
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
- 2019Nested conformal prediction and quantile out-of-bag ensemble methodscited by 88
- 2020Learning Search Space Partition for Black-box Optimization using Monte Carlo Tree Searchcited by 87
- 2020Predictive Inference Is Free with the Jackknife+-after-Bootstrapcited by 55
- 2021OpenBox: A Generalized Black-box Optimization Servicecited by 46
- 2021Facilitating Database Tuning with Hyper-Parameter Optimization: A Comprehensive Experimental Evaluationcited by 22
- 2021Probabilistic Gradient Boosting Machines for Large-Scale Probabilistic Regressioncited by 20
6 more
- 2022Towards Dynamic and Safe Configuration Tuning for Cloud Databasescited by 16
- 2020Black or White? How to Develop an AutoTuner for Memory-based Analytics [Extended Version]cited by 9
- 2023OpenBox: A Python Toolkit for Generalized Black-box Optimizationcited by 9
- 2022LOCAT: Low-Overhead Online Configuration Auto-Tuning of Spark SQL Applicationscited by 6
- 2020A robust approach to warped Gaussian process-constrained optimizationcited by 4
- 2020MLOS: An Infrastructure for Automated Software Performance Engineeringcited by 3
Built on by
Not cited yet.