Skip to content

[question] ReLU support in Z3 linear arithmetics #5847

Answered by NikolajBjorner
wrwg asked this question in Q&A
Discussion options

You must be logged in to vote

It isn't suitable because the main engine uses infinite precision arithmetic, so far mainly suitable for standard program verification but not best for optimization and areas where you have decimal points and can tolerate FP errors to some bounds. To get an overview of verification techniques for the area check out the tutorial session at https://cpaior2021.dbai.tuwien.ac.at/ on techniques up to summer 2021 in this domain. There are many more recent techniques, also using MIP solvers that use FP and other heuristics for conditional inequalities.

Replies: 1 comment

Comment options

You must be logged in to vote
0 replies
Answer selected by wrwg
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants
Converted from issue

This discussion was converted from issue #5846 on February 17, 2022 07:15.