Search Results for author: Bruno Conche

Found 9 papers, 0 papers with code

A Deep Neural Networks ensemble workflow from hyperparameter search to inference leveraging GPU clusters

no code implementations30 Aug 2022 Pierrick Pochelu, Serge G. Petiton, Bruno Conche

Finally, we propose a novel algorithm to optimize the inference of the DNNs ensemble in a GPU cluster based on allocation optimization.

AutoML

An efficient and flexible inference system for serving heterogeneous ensembles of deep neural networks

no code implementations30 Aug 2022 Pierrick Pochelu, Serge G. Petiton, Bruno Conche

Experiments show the flexibility and efficiency under extreme scenarios: It successes to serve an ensemble of 12 heavy DNNs into 4 GPUs and at the opposite, one single DNN multi-threaded into 16 GPUs.

Image Classification

AutoML to generate ensembles of deep neural networks

no code implementations29 Sep 2021 Pierrick Pochelu, Serge G. Petiton, Bruno Conche

Automated Machine Learning with ensembling seeks to automatically build ensembles of Deep Neural Networks (DNNs) to achieve qualitative predictions.

AutoML BIG-bench Machine Learning

Recycling sub-optimial Hyperparameter Optimization models to generate efficient Ensemble Deep Learning

no code implementations1 Jan 2021 Pierrick Pochelu, Bruno Conche, Serge G. Petiton

Due to the lack of consensus to design a successful deep learning ensemble, we introduce Hyperband-Dijkstra, a new workflow that automatically explores neural network designs with Hyperband and efficiently combines them with Dijkstra's algorithm.

Hyperparameter Optimization

Ranking Viscous Finger Simulations to an Acquired Ground Truth with Topology-aware Matchings

no code implementations20 Aug 2019 Maxime Soler, Martin Petitfrere, Gilles Darche, Melanie Plainchault, Bruno Conche, Julien Tierny

Different metrics, based on optimal transport, for comparing time-varying persistence diagrams in this specific applicative case are introduced.

Topological Data Analysis

Lifted Wasserstein Matcher for Fast and Robust Topology Tracking

no code implementations17 Aug 2018 Maxime Soler, Mélanie Plainchault, Bruno Conche, Julien Tierny

First, we revisit the seminal assignment algorithm by Kuhn and Munkres which we specifically adapt to the problem of matching persistence diagrams in an efficient way.

Topologically Controlled Lossy Compression

no code implementations8 Feb 2018 Maxime Soler, Melanie Plainchault, Bruno Conche, Julien Tierny

However, in many scenarios it is desirable to control in a similar way the preservation of higher-level notions, such as topological features , in order to provide guarantees on the outcome of post-hoc data analyses.

Quantization Topological Data Analysis

Cannot find the paper you are looking for? You can Submit a new open access paper.