Benjamin Quost
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Benjamin Quost has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sébastien Destercke
Université de Technologie de Compiègne
6 shared publications - Haifei Zhang
UMR CNRS 5516 Laboratoire Hubert Curien, Université Jean Monnet, Saint-Etienne, France and UMR CNRS 7253 Heudiasyc, Université de Technologie de Compiègne, Compiègne, France
4 shared publications - Marie-Hélène Masson
UMR CNRS 7253 Heudiasyc, Université de Technologie de Compiègne, Compiègne, France and IUT de l’Oise, Université de Picardie Jules Verne, Beauvais, France
4 shared publications - Cyprien Gilet
Université de Technologie de Compiègne, CNRS, Heudiasyc (Heuristics and Diagnosis of Complex Systems)
2 shared publications - Tathagata Basu
University of Strathclyde
2 shared publications - Wenlong Chen
Université de Technologie de Compiègne, CNRS, Heudiasyc (Heuristics and Diagnosis of Complex Systems)
2 shared publications
Latest Publications
- 5 November 2026
- Published by Springer Nature
- p. 95-109
Uncertainty-Aware Discrete Bayesian Classification Under Bounded Input Perturbations
- 5 November 2026
- Published by Springer Nature
- p. 95-109
Uncertainty-Aware Discrete Bayesian Classification Under Bounded Input Perturbations
- Open Access
- 9 May 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (5) , 121
Reducing Aleatoric and Epistemic Uncertainty Through Multi-modal Data Acquisition
To generate accurate and reliable predictions, modern AI systems need to combine data from multiple modalities, such as text, images, audio, spreadsheets, and time series. However, collecting training and test data for many modalities is challenging and time-consuming, creating a need for cost-efficient multi-modal data acquisition. In this paper we advocate that this can be realized by disentangling epistemic and aleatoric uncertainty. It is commonly assumed in the machine learning community that epistemic uncertainty can be reduced by collecting more data, while aleatoric uncertainty is irreducible. We claim that this assumption can be challenged in modern multi-modal AI systems, and we introduces an innovative data acquisition framework where uncertainty disentanglement leads to actionable decisions, allowing cost-efficient sampling in two directions: sample size and data modality. The main hypothesis is that aleatoric uncertainty decreases as the number of modalities increases, while epistemic uncertainty decreases by collecting more observations. We provide a theoretical analysis and proof-of-concept implementations on various multi-modal datasets to prove the usefulness of our framework, which combines ideas from active learning, active feature acquisition and uncertainty quantification.
- 9 May 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (5) , 121
Open AccessReducing Aleatoric and Epistemic Uncertainty Through Multi-modal Data Acquisition
To generate accurate and reliable predictions, modern AI systems need to combine data from multiple modalities, such as text, images, audio, spreadsheets, and time series. However, collecting training and test data for many modalities is challenging and time-consuming, creating a need for cost-efficient multi-modal data acquisition. In this paper we advocate that this can be realized by disentangling epistemic and aleatoric uncertainty. It is commonly assumed in the machine learning community that epistemic uncertainty can be reduced by collecting more data, while aleatoric uncertainty is irreducible. We claim that this assumption can be challenged in modern multi-modal AI systems, and we introduces an innovative data acquisition framework where uncertainty disentanglement leads to actionable decisions, allowing cost-efficient sampling in two directions: sample size and data modality. The main hypothesis is that aleatoric uncertainty decreases as the number of modalities increases, while epistemic uncertainty decreases by collecting more observations. We provide a theoretical analysis and proof-of-concept implementations on various multi-modal datasets to prove the usefulness of our framework, which combines ideas from active learning, active feature acquisition and uncertainty quantification.
- Open Access
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Counterfactual Explanations for Cautious Random Forests
Traditional machine learning models provide a single-class prediction for a given input instance. This may be inadequate in some scenarios, especially when the cost of erroneous predictions is high. Cautious random forests are cautious classification models that may output sets of possible classes as predictions when uncertainty is high, thus reducing the risk of making incorrect decisions. However, making such indeterminate predictions carries a cost, as resolving indeterminacy typically necessitates further analysis and manual intervention. This work focuses on explaining why an indeterminate prediction has been made and how indeterminacy can be resolved. To this end, we use counterfactual examples associated with determinate predictions. We propose a branch-and-bound algorithm that can efficiently generate proximal, plausible, and actionable counterfactual examples. Several experimental results are presented to demonstrate the advantages of our proposed method.
- 17 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Open AccessCounterfactual Explanations for Cautious Random Forests
Traditional machine learning models provide a single-class prediction for a given input instance. This may be inadequate in some scenarios, especially when the cost of erroneous predictions is high. Cautious random forests are cautious classification models that may output sets of possible classes as predictions when uncertainty is high, thus reducing the risk of making incorrect decisions. However, making such indeterminate predictions carries a cost, as resolving indeterminacy typically necessitates further analysis and manual intervention. This work focuses on explaining why an indeterminate prediction has been made and how indeterminacy can be resolved. To this end, we use counterfactual examples associated with determinate predictions. We propose a branch-and-bound algorithm that can efficiently generate proximal, plausible, and actionable counterfactual examples. Several experimental results are presented to demonstrate the advantages of our proposed method.
- 12 November 2024
- Published by Springer Nature
- p. 100-114
Robust Discrete Bayesian Classifier Under Covariate and Label Noise
- 12 November 2024
- Published by Springer Nature
- p. 100-114
Robust Discrete Bayesian Classifier Under Covariate and Label Noise
- 1 January 2024
- Published by Springer Nature
- p. 377-388
Geospatial Uncertainties: A Focus on Intervals and Spatial Models Based on Inverse Distance Weighting
- 1 January 2024
- Published by Springer Nature
- p. 377-388
Geospatial Uncertainties: A Focus on Intervals and Spatial Models Based on Inverse Distance Weighting
- 23 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 213
Cautious weighted random forests
- 23 September 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 213
Cautious weighted random forests
- 25 August 2022
- Published by Springer Nature
- p. 390-397
Explaining Cautious Random Forests via Counterfactuals
- 25 August 2022
- Published by Springer Nature
- p. 390-397
Explaining Cautious Random Forests via Counterfactuals
- 25 August 2022
- Published by Springer Nature
- p. 32-39
An Imprecise Label Ranking Method for Heterogeneous Data
- 25 August 2022
- Published by Springer Nature
- p. 32-39
An Imprecise Label Ranking Method for Heterogeneous Data
- 4 July 2022
- Published by Springer Nature
- p. 757-769
A Robust Bayesian Estimation Approach for the Imprecise Plackett–Luce Model
- 4 July 2022
- Published by Springer Nature
- p. 757-769
A Robust Bayesian Estimation Approach for the Imprecise Plackett–Luce Model