2 papers
cs.LG2025
Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
Jianting Yang, SreÄko ÃuraÅ¡inoviÄ, Srećko Ðurašinović +3
This paper explores methods for verifying the properties of Binary Neural Networks (BNNs), focusing on robustness against adversarial attacks. Despite their lower computational and…
math.OC2025
Leveraging Christoffel-Darboux Kernels to Strengthen Moment-SOS Relaxations
SreÄko ÃuraÅ¡inoviÄ, Perla Azzi, Jean-Bernard Lasserre +3
The classical Moment-Sum Of Squares hierarchy allows to approximate a global minimum of a polynomial optimization problem through semidefinite relaxations of increasing size. Howev…