CLÉMENT François

PhD student (Teaching assistant, Bourse EDITE)
Team : RO
Arrival date : 10/01/2021
    Sorbonne Université - LIP6
    Boîte courrier 169
    Couloir 26-00, Étage 4, Bureau 440
    4 place Jussieu
    75252 PARIS CEDEX 05
    FRANCE

Tel: +33 1 44 27 88 37, Francois.Clement (at) nulllip6.fr
https://lip6.fr/Francois.Clement

Supervision : Carola DOERR

Efficient algorithms for discrepancy subset selection

Given a point set of size n, we want to find the subset of size m of minimal star discrepancy (a specific measure of discrepancy). Initial results obtained recently by C. Doerr and L. Paquete (Coimbra University) were promising and during this thesis we will aim to provide a more formal approach to the problem, as well as provide new algorithms and theoretical bounds, both for the exact problem as for approximations. Our approach will be both theoretical, via complexity analysis and algorithm development, and practical, with extensive testing of our algorithms and searching for the different applications of our new approach on discrepancy. We will be working with different branches of mathematics and computer science (Operations, Research, Algorithmic Theory, Discrepancy Theory) and it is highly likely that that the resolution of our problem will bring us to develop new tools or proofs in these different fields