• (Sep) My paper Testably Learning Polynomial Threshold Functions with Stefan Tiegel and Manuel Wiedmer was accepted to NeurIPS 2024.

• (Sep) My preprint A sparsified Christoffel function for high-dimensional inference with Jean-Bernard Lasserre is on arXiv.

• (Aug) My paper Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures with Manuel Wiedmer appeared as early access in NACO.

• (Aug) I am nominated for the Christiaan Huygens prize, to be awarded by the Royal Netherlands Academy of Arts and Sciences (KNAW) in October 2024.

• (Jul) My paper Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel won the SIAM Student Paper Prize 2024,
  which was awarded at the SIAM Annual Meeting (AN24).

• (Apr) I won the Stieltjes Prize for the best PhD thesis in mathematics defended at a Dutch university in 2022-2023.

From November 2022, I am a postdoc in the group of David Steurer at ETH Zürich.

Previously, I was a PhD student at Centrum Wiskunde & Informatica (CWI) in the Networks & Optimization group, under the supervision of Monique Laurent.
I defended my thesis cum laude at Tilburg University on 30 September 2022.

You can view my CV here (updated April 2024).

My main interest is in polynomial optimization and semidefinite programming approaches to problems in optimization, discrete geometry, combinatorics, statistics and data science.

Some topics I have worked on are:

• Asymptotic error analysis of various sum-of-squares hierarchies.

• Bounds on the bit-complexity of SoS-proofs.

• Extensions of the Lovász theta-number to (geometric) hypergraphs.

• Applications of reproducing (Christoffel-Darboux) kernels to (topological) data analysis.

• Methods based on polynomial regression for algorithmic learning theory.