Pages that link to "Item:Q2151238"

The following pages link to Reluplex: an efficient SMT solver for verifying deep neural networks (Q2151238):

Displaying 48 items.

• DiffRNN: differential verification of recurrent neural networks (Q832044) (← links)
• Robustness verification of quantum classifiers (Q832160) (← links)
• \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks (Q832164) (← links)
• Verisig 2.0: verification of neural network controllers using Taylor model preconditioning (Q832173) (← links)
• Robustness verification of semantic segmentation neural networks using relaxed reachability (Q832180) (← links)
• Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter (Q1982635) (← links)
• Probabilistic guarantees for safe deep reinforcement learning (Q1996032) (← links)
• A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability (Q2026298) (← links)
• Optimization problems for machine learning: a survey (Q2029894) (← links)
• Improving neural network verification through spurious region guided refinement (Q2044215) (← links)
• Advances in verification of ReLU neural networks (Q2046329) (← links)
• Enhancing robustness verification for deep neural networks via symbolic propagation (Q2050096) (← links)
• Reachable sets of classifiers and regression models: (non-)robustness analysis and robust training (Q2051310) (← links)
• Risk verification of stochastic systems with neural network controllers (Q2093383) (← links)
• An SMT theory of fixed-point arithmetic (Q2096435) (← links)
• Cryptanalytic extraction of neural network models (Q2102063) (← links)
• Robustness verification of ReLU networks via quadratic programming (Q2102314) (← links)
• Neural network repair with reachability analysis (Q2112124) (← links)
• On neural network equivalence checking using SMT solvers (Q2112128) (← links)
• Reachability analysis of a general class of neural ordinary differential equations (Q2112130) (← links)
• Static analysis of ReLU neural networks with tropical polyhedra (Q2145325) (← links)
• Exploiting verified neural networks via floating point numerical error (Q2145326) (← links)
• Verifying low-dimensional input neural networks via input quantization (Q2145327) (← links)
• Toward neural-network-guided program synthesis and verification (Q2145332) (← links)
• Bisimulations for neural network reduction (Q2152656) (← links)
• Spanning attack: reinforce black-box attacks with unlabeled data (Q2217425) (← links)
• An SMT-based approach for verifying binarized neural networks (Q2233508) (← links)
• SyReNN: a tool for analyzing deep neural networks (Q2233513) (← links)
• Abstract neural networks (Q2233525) (← links)
• Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
• A game-based approximate verification of deep neural networks with provable guarantees (Q2286751) (← links)
• Reachability is NP-complete even for the simplest neural networks (Q2695495) (← links)
• Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes (Q5026215) (← links)
• Safety Verification for Deep Neural Networks with Provable Guarantees (Invited Paper). (Q5875362) (← links)
• Modeling design and control problems involving neural network surrogates (Q6043129) (← links)
• Global optimization of objective functions represented by ReLU networks (Q6053800) (← links)
• Metrics and methods for robustness evaluation of neural networks with generative models (Q6053812) (← links)
• Reachability in Simple Neural Networks (Q6070612) (← links)
• Sparse polynomial optimisation for neural network verification (Q6073032) (← links)
• Risk-aware shielding of partially observable Monte Carlo planning policies (Q6088298) (← links)
• Speeding up neural network robustness verification via algorithm configuration and an optimised mixed integer linear programming solver portfolio (Q6097125) (← links)
• Reluplex: a calculus for reasoning about deep neural networks (Q6108442) (← links)
• On the (complete) reasons behind decisions (Q6117140) (← links)
• Chordal sparsity for SDP-based neural network verification (Q6119748) (← links)
• Generating probabilistic safety guarantees for neural network controllers (Q6134350) (← links)
• Bridging formal methods and machine learning with model checking and global optimisation (Q6151625) (← links)
• Temporal logic explanations for dynamic decision systems using anchors and Monte Carlo tree search (Q6161477) (← links)
• Towards global neural network abstractions with locally-exact reconstruction (Q6488831) (← links)