246 citations · 492 across the 24 of their papers we have counts for
10 papers · 1 filter
Statistical Guarantees for Variational Autoencoders using PAC-Bayesian Theory
Sokhna Diarra Mbacke, Florence Clerc, Pascal Germain
Since their inception, Variational Autoencoders (VAEs) have become central in machine learning. Despite their widespread use, numerous questions regarding their theoretical propert…
Invariant Causal Set Covering Machines
Thibaud Godon, Baptiste Bauvin, Pascal Germain +2
Rule-based models, such as decision trees, appeal to practitioners due to their interpretable nature. However, the learning algorithms that produce such models are often vulnerable…
PAC-Bayesian Generalization Bounds for Adversarial Generative Models
Sokhna Diarra Mbacke, Florence Clerc, Pascal Germain
We extend PAC-Bayesian theory to generative models and develop generalization bounds for models based on the Wasserstein distance and the total variation distance. Our first result…
Seeking Interpretability and Explainability in Binary Activated Neural Networks
Benjamin Leblanc, Pascal Germain
We study the use of binary activated neural networks as interpretable and explainable predictors in the context of regression tasks on tabular data; more specifically, we provide g…
PAC-Bayesian Learning of Aggregated Binary Activated Neural Networks with Probabilities over Representations
Louis Fortier-Dubois, Gaël Letarte, Benjamin Leblanc +2
Considering a probability distribution over parameters is known as an efficient strategy to learn a neural network with non-differentiable activation functions. We study the expect…
Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound
Valentina Zantedeschi, Paul Viallard, Emilie Morvant +4
We investigate a stochastic counterpart of majority votes over finite ensembles of classifiers, and study its generalization properties. While our approach holds for arbitrary dist…