70 citations · 198 across the 23 of their papers we have counts for
5 papers · 1 filter
Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein Distances
Ruben Ohana, Kimia Nadjahi, Alain Rakotomamonjy +1
The Sliced-Wasserstein distance (SW) is a computationally efficient and theoretically grounded alternative to the Wasserstein distance. Yet, the literature on its statistical prope…
On Generalizing the C-Bound to the Multiclass and Multi-label Settings
Francois Laviolette, Emilie Morvant, Liva Ralaivola +1
The C-bound, introduced in Lacasse et al., gives a tight upper bound on the risk of a binary majority vote classifier. In this work, we present a first step towards extending this…
Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
Antoine Bonnefoy, Valentin Emiya, Liva Ralaivola +1
Recent computational strategies based on screening tests have been proposed to accelerate algorithms addressing penalized sparse regression problems such as the Lasso. Such approac…
On the Generalization of the C-Bound to Structured Output Ensemble Methods
François Laviolette, Emilie Morvant, Liva Ralaivola +1
This paper generalizes an important result from the PAC-Bayesian literature for binary classification to the case of ensemble methods for structured outputs. We prove a generic ver…
PAC-Bayesian Generalization Bound on Confusion Matrix for Multi-Class Classification
Emilie Morvant, Sokol Koço, Liva Ralaivola
In this work, we propose a PAC-Bayes bound for the generalization risk of the Gibbs classifier in the multi-class classification framework. The novelty of our work is the critical…