10 citations · 12 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LG2025★ 10 cited
Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees
Guanqin Zhang, Kota Fukuda, Zhenya Zhang +4
The vulnerability of neural networks to adversarial perturbations has necessitated formal verification techniques that can rigorously certify the quality of neural networks. As the…
cs.LG2025
Adaptive Branch-and-Bound Tree Exploration for Neural Network Verification
Kota Fukuda, Guanqin Zhang, Zhenya Zhang +2
Formal verification is a rigorous approach that can provably ensure the quality of neural networks, and to date, Branch and Bound (BaB) is the state-of-the-art that performs verifi…