← Search

Bernardo Subercaseaux

5 accepted papers

2022

Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions

NeurIPS 2022accept

The growing body of work in learning-augmented online algorithms studies how online algorithms can be improved when given access to ML predictions about the future. Motivated by ML models that give a confidence parameter for their predictions, we study online algorithms with predictions that are $\e…

Cited by 5SourcePDFScholar
2022

On Computing Probabilistic Explanations for Decision Trees

NeurIPS 2022accept

Formal XAI (explainable AI) is a growing area that focuses on computing explanations with mathematical guarantees for the decisions made by ML models. Inside formal XAI, one of the most studied cases is that of explaining the choices taken by decision trees, as they are traditionally deemed as one o…

Cited by 55SourcePDFScholar
2021

Foundations of Symbolic Languages for Model Interpretability

NeurIPS 2021spotlight

Several queries and scores have recently been proposed to explain individual predictions over ML models. Examples include queries based on “anchors”, which are parts of an instance that are sufficient to justify its classification, and “feature-perturbation” scores such as SHAP. Given the need for f…

2020

Model Interpretability through the lens of Computational Complexity

NeurIPS 2020poster

In spite of several claims stating that some models are more interpretable than others --e.g., "linear models are more interpretable than deep neural networks"-- we still lack a principled notion of interpretability that allows us to formally compare among different classes of models. We make a step…

Cited by 128SourcePDFScholar