Publications and preprints
Publications and preprints
Agnostic learning in (almost) optimal time via Gaussian surface area [arXiv]
with Lucas Pesenti and Manuel Wiedmer
Preprint (2026)
Robustness of Persistent Topological Features and Minimum Homological Cuts [arXiv]
with Pepijn Roos Hoefgeest
SOCG 2026 (to appear)
Hesse's Redemption: Efficient Convex Polynomial Programming [arXiv]
with David Steurer and Manuel Wiedmer
STOC 2026 (to appear)
Low degree conjecture implies sharp computational thresholds
in stochastic block model [arXiv]
with Jingqiu Ding, Yiding Hua, and David Steurer
NeurIPS 2025
Computational complexity of sum-of-squares bounds for copositive programs [arXiv] [journal]
with Marilena Palomba, Luis Felipe Vargas, and Monaldo Mastrolilli
SIAM J. Optimization (2025)
A sparsified Christoffel function for high-dimensional inference [arXiv]
with Jean-Bernard Lasserre
Preprint (2024)
Testably Learning Polynomial Threshold Functions [arXiv] [conference]
with Stefan Tiegel and Manuel Wiedmer
NeurIPS 2024
Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization
based on push-forward measures [arXiv] [journal]
with Manuel Wiedmer
Numerical Algebra, Control and Optimization (2024)
Degree bounds for Putinar's Positivstellensatz on the hypercube [arXiv] [journal]
with Lorenzo Baldi
SIAM J. Applied Algebra and Geometry (2024)
A Note on the Computational Complexity of the Moment-SOS Hierarchy
for Polynomial Optimization [arXiv] [conference]
with Sander Gribling and Sven Polak
ISSAC 2023
The Christoffel-Darboux kernel for topological data analysis [arXiv] [conference]
with Pepijn Roos Hoefgeest
SoCG 2023
A recursive theta body for hypergraphs [arXiv] [journal]
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin
Combinatorica (2023)
Sum-of-squares hierarchies for polynomial optimization
and the Christoffel-Darboux kernel [arXiv] [journal] [erratum]
SIAM J. Optimization (2022)
An effective version of Schmüdgen's Positivstellensatz for the hypercube [arXiv] [journal]
with Monique Laurent
Optimization Letters (2022)
A recursive Lovász theta number for simplex-avoiding sets [arXiv] [journal]
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin
Proc. American Mathematical Society (2022)
Sum-of-squares hierarchies for binary polynomial optimization [arXiv] [conference] [journal]
with Monique Laurent
IPCO 2021. Extended version in Mathematical Programming (2022)
Improved convergence analysis of Lasserre’s measure-based upper bounds
for polynomial minimization on compact sets [arXiv] [journal]
with Monique Laurent
Mathematical Programming (2022)
Near-optimal analysis of Lasserre’s univariate measure-based bounds
for multivariate polynomial optimization [arXiv] [journal]
with Monique Laurent
Mathematical Programming (2021)
Polynomiale optimalisatie en sommen van kwadraten
Nieuw Archief voor Wiskunde (Dec. 2024)
PhD Mathematics (cum laude) at Centrum Wiskunde & Informatica (CWI), Amsterdam and Tilburg University (2018-2022)
Thesis: Asymptotic Analysis of Semidefinite Bounds for Polynomial Optimization and Independent Sets in Geometric Hypergraphs
promotors: prof. dr. Monique Laurent and prof. dr. Etienne de Klerk.
Msc. Mathematics at the University of Bonn (2016-2018)
Thesis: Global Gate Sizing and Buffering, under the supervision of prof. dr. Stephan Held
Bsc. Mathematics and Bsc. Computer Science at the University of Amsterdam (2013-2016)
Thesis: Ultrametric Simplices, under the supervision of dr. Jan Brandts and dr. Leen Torenvliet