21 citations · 50 across the 18 of their papers we have counts for
4 papers · 1 filter
A Christoffel-like function for high-dimensional support inference in graphical models
Jean-Bernard Lasserre, Lucas Slot
Christoffel polynomials are classical tools from approximation theory. They can be used to estimate the (compact) support of a measure on based on its low-degree…
An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
Monique Laurent, Lucas Slot
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This mod…
Testably Learning Polynomial Threshold Functions
Lucas Slot, Stefan Tiegel, Manuel Wiedmer
Rubinfeld & Vasilyan recently introduced the framework of testable learning as an extension of the classical agnostic model. It relaxes distributional assumptions which are difficu…
Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
Lucas Slot, Manuel Wiedmer
Let be a closed set, and consider the problem of computing the minimum of a polynomial on . Given a measure suppo…