Publications
Publications
On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
with Adam Kurpisz and Mikhail Zaytsev
ISSAC 2026 [arXiv]
Agnostic learning in (almost) optimal time via Gaussian surface area
with Lucas Pesenti and Manuel Wiedmer
Preprint (2026) [arXiv]
Robustness of Persistent Topological Features and Minimum Homological Cuts
with Pepijn Roos Hoefgeest
SoCG 2026 [arXiv]
Hesse's Redemption: Efficient Convex Polynomial Programming
with David Steurer and Manuel Wiedmer
STOC 2026 [arXiv]
Low degree conjecture implies sharp computational thresholds in stochastic block model
with Jingqiu Ding, Yiding Hua, and David Steurer
NeurIPS 2025 (spotlight) [arXiv]
Computational complexity of sum-of-squares bounds for copositive programs
with Marilena Palomba, Luis Felipe Vargas, and Monaldo Mastrolilli
SIAM J. Optimization (2025) [arXiv] [journal]
A Christoffel-like function for high-dimensional support inference in graphical models
with Jean-Bernard Lasserre
J. Approximation Theory (2026) [arXiv] [journal]
Testably Learning Polynomial Threshold Functions
with Stefan Tiegel and Manuel Wiedmer
NeurIPS 2024 [arXiv] [conference]
Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
with Manuel Wiedmer
Numerical Algebra, Control and Optimization (2024) [arXiv] [journal]
Degree bounds for Putinar's Positivstellensatz on the hypercube
with Lorenzo Baldi
SIAM J. Applied Algebra and Geometry (2024) [arXiv] [journal]
A Note on the Computational Complexity of the Moment-SOS Hierarchy for Polynomial Optimization
with Sander Gribling and Sven Polak
ISSAC 2023 [arXiv] [conference]
The Christoffel-Darboux kernel for topological data analysis
with Pepijn Roos Hoefgeest
SoCG 2023 [arXiv] [conference]
A recursive theta body for hypergraphs
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin
Combinatorica (2023) [arXiv] [journal]
Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel [erratum]
SIAM J. Optimization (2022) [arXiv]
An effective version of Schmüdgen's Positivstellensatz for the hypercube
with Monique Laurent
Optimization Letters (2022) [arXiv] [journal]
A recursive Lovász theta number for simplex-avoiding sets
with Davi Castro-Silva, Fernando Mário de Oliveira Filho and Frank Vallentin
Proc. American Mathematical Society (2022) [arXiv] [journal]
Sum-of-squares hierarchies for binary polynomial optimization
with Monique Laurent
IPCO 2021. Extended version in Mathematical Programming (2022) [arXiv] [conference] [journal]
Improved convergence analysis of Lasserre’s measure-based upper bounds for polynomial minimization on compact sets
with Monique Laurent
Mathematical Programming (2022) [arXiv] [journal]
Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization
with Monique Laurent
Mathematical Programming (2021) [arXiv] [journal]
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