Approximate Online Bilevel Optimization for Learning Data Augmentation

In this project we aim to automatically learn an augmenter network by using an approximate online bilevel optimization procedure. We plan to learn a augmenter network that generates a distribution of transformations that minimizes the loss on a validation set. By unfolding the gradients of the training loss, we will optimize the loss on validation with respect to the data augmentation parameters. In this way we can provide a general solution for an efficient and automatic data augmentation that is learned jointly with the training of the model.

Composing without forgetting

In this project, we propose a continual learning approach to face the problem of catastrophic forgetting in online image classification problems. Concretely, we propose a model that learns how to mask a series of general modules in a deep learning architecture, so that generalization emerges through the composition of those modules. This is of vital importance for Element AI to provide reusable solutions that scale with new data, without the need of learning a new model for every problem and improving the overall performance.

Apprentissage automatique pour la construction de diagrammes de décision

L’optimisation combinatoire occupe une place prépondérante dans notre société actuelle. Que ce soit la logistique, le transport ou la gestion financière, tous ses domaines se retrouvent confrontés à des problèmes pour lesquels on recherche la meilleure solution. Cependant, un grand nombre de problèmes très complexes reste encore hors de portée des méthodes d’optimisation actuelles. C’est pourquoi, l’amélioration des techniques est un sujet crucial. Parmi les techniques récentes, les diagrammes de décisions semblent avoir un avenir prometteur.

Pages