Frédéric Pennerath
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Frédéric Pennerath has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Brieuc Conan-Guez
Université de Lorraine, CNRS, LORIA
3 shared publications - Miguel Couceiro
INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
3 shared publications - Mohammed Fellaji
Université Paris Saclay, CNRS, LORIA
2 shared publications - Amedeo Napoli
Université de Lorraine, CNRS, LORIA
1 shared publication - Claire Theobald
Université de Lorraine CNRS LORIA F-54000 Nancy France
1 shared publication
Latest Publications
- 22 August 2024
- Published by Springer Nature
- p. 160-176
On the Calibration of Epistemic Uncertainty: Principles, Paradoxes and Conflictual Loss
- 22 August 2024
- Published by Springer Nature
- p. 160-176
On the Calibration of Epistemic Uncertainty: Principles, Paradoxes and Conflictual Loss
- Open Access
On the Calibration of Epistemic Uncertainty: Principles, Paradoxes and Conflictual Loss
The calibration of predictive distributions has been widely studied in deep learning, but the same cannot be said about the more specific epistemic uncertainty as produced by Deep Ensembles, Bayesian Deep Networks, or Evidential Deep Networks. Although measurable, this form of uncertainty is difficult to calibrate on an objective basis as it depends on the prior for which a variety of choices exist. Nevertheless, epistemic uncertainty must in all cases satisfy two formal requirements: first, it must decrease when the training dataset gets larger and, second, it must increase when the model expressiveness grows. Despite these expectations, our experimental study shows that on several reference datasets and models, measures of epistemic uncertainty violate these requirements, sometimes presenting trends completely opposite to those expected. These paradoxes between expectation and reality raise the question of the true utility of epistemic uncertainty as estimated by these models. A formal argument suggests that this disagreement is due to a poor approximation of the posterior distribution rather than to a flaw in the measure itself. Based on this observation, we propose a regularization function for deep ensembles, called conflictual loss in line with the above requirements. We emphasize its strengths by showing experimentally that it restores both requirements of epistemic uncertainty, without sacrificing either the performance or the calibration of the deep ensembles.
Open AccessOn the Calibration of Epistemic Uncertainty: Principles, Paradoxes and Conflictual Loss
The calibration of predictive distributions has been widely studied in deep learning, but the same cannot be said about the more specific epistemic uncertainty as produced by Deep Ensembles, Bayesian Deep Networks, or Evidential Deep Networks. Although measurable, this form of uncertainty is difficult to calibrate on an objective basis as it depends on the prior for which a variety of choices exist. Nevertheless, epistemic uncertainty must in all cases satisfy two formal requirements: first, it must decrease when the training dataset gets larger and, second, it must increase when the model expressiveness grows. Despite these expectations, our experimental study shows that on several reference datasets and models, measures of epistemic uncertainty violate these requirements, sometimes presenting trends completely opposite to those expected. These paradoxes between expectation and reality raise the question of the true utility of epistemic uncertainty as estimated by these models. A formal argument suggests that this disagreement is due to a poor approximation of the posterior distribution rather than to a flaw in the measure itself. Based on this observation, we propose a regularization function for deep ensembles, called conflictual loss in line with the above requirements. We emphasize its strengths by showing experimentally that it restores both requirements of epistemic uncertainty, without sacrificing either the performance or the calibration of the deep ensembles.
- Open Access
Clarity: an improved gradient method for producing quality visual counterfactual explanations
Visual counterfactual explanations identify modifications to an image that would change the prediction of a classifier. We propose a set of techniques based on generative models (VAE) and a classifier ensemble directly trained in the latent space, which all together, improve the quality of the gradient required to compute visual counterfactuals. These improvements lead to a novel classification model, Clarity, which produces realistic counterfactual explanations over all images. We also present several experiments that give insights on why these techniques lead to better quality results than those in the literature. The explanations produced are competitive with the state-of-the-art and emphasize the importance of selecting a meaningful input space for training.
Open AccessClarity: an improved gradient method for producing quality visual counterfactual explanations
Visual counterfactual explanations identify modifications to an image that would change the prediction of a classifier. We propose a set of techniques based on generative models (VAE) and a classifier ensemble directly trained in the latent space, which all together, improve the quality of the gradient required to compute visual counterfactuals. These improvements lead to a novel classification model, Clarity, which produces realistic counterfactual explanations over all images. We also present several experiments that give insights on why these techniques lead to better quality results than those in the literature. The explanations produced are competitive with the state-of-the-art and emphasize the importance of selecting a meaningful input space for training.
- 23 January 2019
- Published by Springer Nature
- p. 483-499
An Efficient Algorithm for Computing Entropic Measures of Feature Subsets
- 23 January 2019
- Published by Springer Nature
- p. 483-499
An Efficient Algorithm for Computing Entropic Measures of Feature Subsets