- Computer Science Laboratory

CLÉMENT François

PhD Student at Sorbonne University
Team : RO
https://webia.lip6.fr/~fclement/fclement.html
https://webia.lip6.fr/~fclement/fclement.html

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 to 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.


Phd defence : 07/18/2024

Jury members :

Jury:
-> Pr. Dmitriy Bilyk (reviewer), University of Minnesota, United States of America
-> Priv.-Doz. Mag. Dr. Peter Kritzer (reviewer), Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Austria
-> Dr. Claire Mathieu (examinator), CNRS, Université Paris Cité, IRIF, France
-> Pr. Art B. Owen (examinator), Stanford University, United States of America
-> Dr. Julien Tierny (examinator), CNRS, Sorbonne Université, LIP6, France
-> Dr Carola Doerr (PhD supervisor), CNRS, Sorbonne Université, LIP6, France
-> Dr Luís Paquete (PhD supervisor), DEI, University of Coimbra, Portugal

Departure date : 09/30/2024

2022-2024 Publications