Pages that link to "Item:Q832168"
From MaRDI portal
The following pages link to Scalable polyhedral verification of recurrent neural networks (Q832168):
Displaying 7 items.
- Reluplex: an efficient SMT solver for verifying deep neural networks (Q2151238) (← links)
- Improved geometric path enumeration for verifying ReLU neural networks (Q2225077) (← links)
- Challenging SMT solvers to verify neural networks (Q3164970) (← links)
- Verifying Recurrent Neural Networks Using Invariant Inference (Q6485856) (← links)
- Shared Certificates for Neural Network Verification (Q6487315) (← links)
- Example Guided Synthesis of Linear Approximations for Neural Network Verification (Q6487316) (← links)
- LinSyn: synthesizing tight linear bounds for arbitrary neural network activation functions (Q6535572) (← links)
