no code implementations • 18 Oct 2022 • Jean-Samuel Leboeuf, Frédéric LeBlanc, Mario Marchand
Furthermore, we show that the VC dimension of a binary tree structure with $L_T$ leaves on examples of $\ell$ real-valued features is in $O(L_T \log(L_T\ell))$.
1 code implementation • 29 Oct 2021 • Jean-Samuel Leboeuf, Frédéric LeBlanc, Mario Marchand
We significantly improve the generalization bounds for VC classes by using two main ideas.
1 code implementation • NeurIPS 2020 • Jean-Samuel Leboeuf, Frédéric LeBlanc, Mario Marchand
We introduce the notion of partitioning function, and we relate it to the growth function and to the VC dimension.
no code implementations • 14 Dec 2019 • Nicolas Garneau, Jean-Samuel Leboeuf, Yuval Pinter, Luc Lamontagne
We propose a new contextual-compositional neural network layer that handles out-of-vocabulary (OOV) words in natural language processing (NLP) tagging tasks.
no code implementations • WS 2018 • Nicolas Garneau, Jean-Samuel Leboeuf, Luc Lamontagne
We propose a novel way to handle out of vocabulary (OOV) words in downstream natural language processing (NLP) tasks.