Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers

Published in arXiv preprint (under review), 2025

Certifying nonnegativity of polynomials is a well-known NP-hard problem with applications spanning non-convex optimization, control, robotics, and beyond.

Recommended citation: Pelleriti, N., Spiegel, C., Liu, S., Martínez-Rubio, D., Zimmer, M., & Pokutta, S. (2025). Neural Sum-of-Squares: Certifying the Nonnegativity of Polynomials with Transformers. arXiv preprint arXiv:2510.13444.
Download Paper