Lucas Slot
ETH Zürich
address: Andreasstrasse 5, 8092 Zürich
email: lucas.slot@inf.ethz.ch
News
(Jan) My preprint Computational complexity of sum-of-squares bounds for copositive programs
with Marilena Palomba, Luis Felipe Vargas, and Monaldo Mastrolilli is on arXiv(Dec) An expository article on my thesis research was published in Nieuw Archief voor Wiskunde.
(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.
About me
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).
Research interests
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 and statistical inference.
Methods based on polynomial regression for algorithmic learning theory.