What to Expect of Classifiers? Reasoning about Logistic Regression with Missing Features
Not on the map. Why?
Abstract (arXiv)
While discriminative classifiers often yield strong predictive performance, missing feature values at prediction time can still be a challenge. Classifiers may not behave as expected under certain ways of substituting the missing values, since they inherently make assumptions about the data distribution they were trained on. In this paper, we propose a novel framework that classifies examples with missing features by computing the expected prediction with respect to a feature distribution. Moreover, we use geometric programming to learn a naive Bayes distribution that embeds a given logistic regression classifier and can efficiently take its expected predictions. Empirical evaluations show that our model achieves the same performance as the logistic regression with all features observed, and outperforms standard imputation techniques when features go missing during prediction time. Furthermore, we demonstrate that our method can be used to generate "sufficient explanations" of logistic regression classifications, by removing features that do not affect the classification.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 0; 2023: 2; 2024: 1; 2025: 3; 2026: 1.
12 papers.
- 2021Probabilistic Sufficient Explanationscited by 24
- 2021Efficient Explanations With Relevant Setscited by 12
- 2021A Compositional Atlas of Tractable Circuit Operations: From Simple Transformations to Complex Information-Theoretic Queriescited by 7
- 2023Bayesian Structure Scores for Probabilistic Circuitscited by 7
- 2021MisConv: Convolutional Neural Networks for Missing Datacited by 4
- 2025Semantic Probabilistic Control of Language Modelscited by 4
- 2025When is the Computation of a Feature Attribution Method Tractable?cited by 2
- 2021Tractable Computation of Expected Kernelscited by 1
- 2025Learning High-dimensional Gaussians from Censored Datacited by 1
- 2026Even More Guarantees for Variational Inference in the Presence of Symmetriescited by 1
- 2023On Logic-Based Explainability with Partially Specified Inputscited by 0
- 2024Learning from Uncertain Data: From Possible Worlds to Possible Modelscited by 0
- 2026Even More Guarantees for Variational Inference in the Presence of Symmetries23 Apr 2026
- 2025Semantic Probabilistic Control of Language Models4 May 2025
- 2025Learning High-dimensional Gaussians from Censored Data28 Apr 2025
- 2025When is the Computation of a Feature Attribution Method Tractable?4 Jan 2025
- 2024Learning from Uncertain Data: From Possible Worlds to Possible Models28 May 2024
- 2023On Logic-Based Explainability with Partially Specified Inputs27 Jun 2023
- 2023Bayesian Structure Scores for Probabilistic Circuits23 Feb 2023
- 2021MisConv: Convolutional Neural Networks for Missing Data26 Oct 2021
- 2021Efficient Explanations With Relevant Sets1 Jun 2021
- 2021Probabilistic Sufficient Explanations21 May 2021
- 2021Tractable Computation of Expected Kernels21 Feb 2021
- 2021A Compositional Atlas of Tractable Circuit Operations: From Simple Transformations to Complex Information-Theoretic Queries11 Feb 2021