Parameterized Hardness of Zonotope Containment and Neural Network Verification

The episode discusses "Parameterized Hardness of Zonotope Containment and Neural Network Verification," detailing that verifying neural networks is computationally difficult as input dimensions increase. The hosts explain that tasks like checking for positive output or covering all outputs are proven to be W[one]-hard, linking AI safety limits to computational geometry.

Open the full episode

More from AI Radio