3 citations · 3 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LG2024
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…
math.OC2024
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…