164 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College LondonGB15 papers
- Institut national de recherche en sciences et technologies du numériqueFR13 papers
- Modélisation aléatoire de Paris NanterreFR13 papers
- University of LondonGB8 papers
- Centre Inria de l'Université de LilleFR7 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Laboratoire de Probabilités et Modèles AléatoiresFR5 papers
- Université Paris NanterreFR5 papers
- Centre de Mathématiques Appliquées de l'École polytechniqueFR3 papers
- Institut de Mathématiques de MarseilleFR3 papers
- Université de LilleFR3 papers
- University of OxfordGB3 papers
7 papers · 1 filter
Upper and Lower Bounds on the Performance of Kernel PCA
Maxime Haddouche, Benjamin Guedj, John Shawe-Taylor
Principal Component Analysis (PCA) is a popular method for dimension reduction and has attracted an unfailing interest for decades. More recently, kernel PCA (KPCA) has emerged as…
Learning Binary Decision Trees by Argmin Differentiation
Valentina Zantedeschi, Matt J. Kusner, Vlad Niculae
We address the problem of learning binary decision trees that partition data for some downstream task. We propose to learn discrete parameters (i.e., for tree traversals and node p…
PAC-Bayesian Bound for the Conditional Value at Risk
Zakaria Mhammedi, Benjamin Guedj, Robert C. Williamson
Conditional Value at Risk (CVaR) is a family of "coherent risk measures" which generalize the traditional mathematical expectation. Widely used in mathematical finance, it is garne…
Differentiable PAC-Bayes Objectives with Partially Aggregated Neural Networks
Felix Biggs, Benjamin Guedj
We make three related contributions motivated by the challenge of training stochastic neural networks, particularly in a PAC-Bayesian setting: (1) we show how averaging over an ens…
PAC-Bayesian Contrastive Unsupervised Representation Learning
Kento Nozawa, Pascal Germain, Benjamin Guedj
Contrastive unsupervised representation learning (CURL) is the state-of-the-art technique to learn representations (as a set of features) from unlabelled data. While CURL has colle…
Online k-means Clustering
Vincent Cohen-Addad, Benjamin Guedj, Varun Kanade +1
We study the problem of online clustering where a clustering algorithm has to assign a new point that arrives to one of clusters. The specific formulation we use is the -mea…
PAC-Bayes Un-Expected Bernstein Inequality
Zakaria Mhammedi, Peter D. Grunwald, Benjamin Guedj
We present a new PAC-Bayesian generalization bound. Standard bounds contain a $\sqrt{L_n \cdot \KL/n}$ complexity term which dominates unless , the empirical error of the lear…