arXiv research

New algorithms minimize PAC-Bayesian C-Bound for majority voting, leading to scalable and accurate predictors.

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 work to more complex outputs, by providing generalizations of the C-bound to the multiclass and multi-label settings.

We propose an extensive analysis of the behavior of majority votes in binary classification. In particular, we introduce a risk bound for majority votes, called the C-bound, that takes into account the average quality of the voters and their average disagreement. We also propose an extensive PAC-Bayesian analysis that …

We tackle the PAC-Bayesian Domain Adaptation (DA) problem. This arrives when one desires to learn, from a source distribution, a good weighted majority vote (over a set of classifiers) on a different target distribution. In this context, the disagreement between classifiers is known crucial to control. In non-DA superv…

A new feature selection method for semi-supervised learning with imperfect labels.

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 version of the \Cbound, an upper bound over the risk of models expressed as a weighted majority vote that is based on the first and second stat…

Existing guarantees in terms of rigorous upper bounds on the generalization error for the original random forest algorithm, one of the most frequently used machine learning methods, are unsatisfying. We discuss and evaluate various PAC-Bayesian approaches to derive such bounds. The bounds do not require additional hold…

In this paper we propose a boosting based multiview learning algorithm, referred to as PB-MVBoost, which iteratively learns i) weights over view-specific voters capturing view-specific information; and ii) weights over views by optimizing a PAC-Bayes multiview C-Bound that takes into account the accuracy of view-specif…

DAMVI algorithm improves imbalanced binary classification by adjusting weights of examples and classifiers.

New PAC-Bayesian bounds for multi-view learning using Rényi divergence.

We prove new improved endpoint, $L^{p_c}$, $p_c=\tfrac{2(n+1)}{n-1}$, estimates (the "kink point") for eigenfunctions on manifolds of nonpositive curvature. We do this by using energy and dispersive estimates for the wave equation as well as new improved $L^p$, $2<p< p_c$, bounds of Blair and the author \cite{BSTop}, \…

New bound improves on weighted majority vote risk estimation.

In machine learning, the domain adaptation problem arrives when the test (target) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classifica…

HappyMap improves fairness and learning across domains by generalizing multi-calibration.