Explaining Inference Queries with Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
Obtaining an explanation for an SQL query result can enrich the analysis experience, reveal data errors, and provide deeper insight into the data. Inference query explanation seeks to explain unexpected aggregate query results on inference data; such queries are challenging to explain because an explanation may need to be derived from the source, training, or inference data in an ML pipeline. In this paper, we model an objective function as a black-box function and propose BOExplain, a novel framework for explaining inference queries using Bayesian optimization (BO). An explanation is a predicate defining the input tuples that should be removed so that the query result of interest is significantly affected. BO - a technique for finding the global optimum of a black-box function - is used to find the best predicate. We develop two new techniques (individual contribution encoding and warm start) to handle categorical variables. We perform experiments showing that the predicates found by BOExplain have a higher degree of explanation compared to those found by the state-of-the-art query explanation engines. We also show that BOExplain is effective at deriving explanations for inference queries from source and training data on a variety of real-world datasets. BOExplain is open-sourced as a Python package at https://github.com/sfu-db/BOExplain.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 56 references that are in the map. First posted on arXiv 10 Feb 2021.
Builds on
20 of 56 references.
References · 20
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2018A Tutorial on Bayesian Optimizationcited by 734
- 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
- 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
- 2019Random Search and Reproducibility for Neural Architecture Searchcited by 253
- 2019Combinatorial Bayesian Optimization using the Graph Cartesian Productcited by 78
- 2018Simple random search provides a competitive approach to reinforcement learningcited by 75
- 2018Automated Data Slicing for Model Validation:A Big data - AI Integration Approachcited by 70
- 2017Dealing with Integer-valued Variables in Bayesian Optimization with Gaussian Processescited by 65
- 2018Bayesian Optimization of Combinatorial Structurescited by 64
- 2019Bayesian Optimisation over Multiple Continuous and Categorical Inputscited by 55
8 more
- 2014Student-t Processes as Alternatives to Gaussian Processescited by 45
- 2019Bayesian Optimization for Categorical and Category-Specific Continuous Inputscited by 28
- 2020Complaint-driven Training Data Debugging for Query 2.0cited by 16
- 2016MacroBase: Prioritizing Attention in Fast Datacited by 15
- 2020Scalable Combinatorial Bayesian Optimization with Tractable Statistical modelscited by 7
- 2018Explaining Aggregates for Exploratory Analyticscited by 6
- 2020Handling Concept Drifts in Regression Problems -- the Error Intersection Approachcited by 6
- 2020CADET: Debugging and Fixing Misconfigurations using Counterfactual Reasoningcited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.