Pages that link to "Item:Q2286751"
From MaRDI portal
The following pages link to A game-based approximate verification of deep neural networks with provable guarantees (Q2286751):
Displaying 10 items.
- Robustness verification of semantic segmentation neural networks using relaxed reachability (Q832180) (← links)
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability (Q2026298) (← links)
- Improving neural network verification through spurious region guided refinement (Q2044215) (← links)
- Enhancing robustness verification for deep neural networks via symbolic propagation (Q2050096) (← links)
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
- Constructing the basis path set by eliminating the path dependency (Q2109299) (← links)
- Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
- Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper). (Q5875362) (← links)
- Generalizing universal adversarial perturbations for deep neural networks (Q6103573) (← links)
- Bridging formal methods and machine learning with model checking and global optimisation (Q6151625) (← links)
