activity
20232026
most citedOn the Relationship Between Interpretability and Explainability in Machine Learning

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2026

Bound to Disagree: Generalization Bounds via Certifiable Surrogates

Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain

Generalization bounds for deep learning models are typically vacuous, not computable or restricted to specific model classes. In this paper, we tackle these issues by providing new…

cs.LG2025

A Framework for Bounding Deterministic Risk with PAC-Bayes: Applications to Majority Votes

Benjamin Leblanc, Pascal Germain

PAC-Bayes is a popular and efficient framework for obtaining generalization guarantees in situations involving uncountable hypothesis spaces. Unfortunately, in its classical formul…

cs.LG2024

Generalization Bounds via Meta-Learned Model Representations: PAC-Bayes and Sample Compression Hypernetworks

Benjamin Leblanc, Mathieu Bazinet, Nathaniel D'Amours +2

Both PAC-Bayesian and Sample Compress learning frameworks are instrumental for deriving tight (non-vacuous) generalization bounds for neural networks. We leverage these results in…

cs.LG2024★ 1 cited

Sample Compression Unleashed: New Generalization Bounds for Real Valued Losses

Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain

The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, gener…

cs.LG2023★ 2 cited

On the Relationship Between Interpretability and Explainability in Machine Learning

Benjamin Leblanc, Pascal Germain

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshoot…