1 citations · 1 across the 14 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers
Nico Pelleriti, Christoph Spiegel, Shiwei Liu +3
Certifying nonnegativity of polynomials is a well-known NP-hard problem with direct applications spanning non-convex optimization, control, robotics, and beyond. A sufficient condi…
cs.LG2024
Black-Box Uniform Stability for Non-Euclidean Empirical Risk Minimization
Simon Vary, David Martínez-Rubio, Patrick Rebeschini
We study first-order algorithms that are uniformly stable for empirical risk minimization (ERM) problems that are convex and smooth with respect to -norms, . We propos…