-
Notifications
You must be signed in to change notification settings - Fork 93
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Backward forward algorithm #845
Open
ido-shm-uel
wants to merge
18
commits into
NeuralNetworkVerification:master
Choose a base branch
from
ido-shm-uel:Backward-Forward-Algorithm
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Backward forward algorithm #845
ido-shm-uel
wants to merge
18
commits into
NeuralNetworkVerification:master
from
ido-shm-uel:Backward-Forward-Algorithm
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Added assignment and store-into-other NLR tests for every activation function.
0-2-0: Implementing layer simulations for every activation function.
0-2-1: Testing layer simulations for every activation function.
0-3-0: Implementing interval arithmetic for all activation functions.
0-3-1: Adding interval arithmetic tests for all activation functions.
…nction. 0-4-0: Implementing symbolic bound tightening for every activation function.
…tions. 0-4-1: Adding symbolic bound tightening tests for all activation functions.
0-5-0: Adding rounding constant for LP relaxation propagation.
… activation functions. 0-5-1: Implementing forward-backward LP propagation algorithm for all activation functions.
…n functions. 0-5-2: Adding forward-backward LP propagation tests for all activation functions.
0-5---3: Minor fix.
0-5--4: Another fix.
0-5---5: Fixing fix 0-5--4 for this branch.
0-5--6: Changes in Backward-Forward Algorithm: - Bug fixes: Sigmoid (wrong bias for bounds, unlike in DeepPoly), Softmax (missing two assignments lead to NaN values when bounds equal zero). - Improvements: Absolute Value, Round (stricter initial range for target variable). - Minor fixes: Bilinear (removed unnecessary epsilon and unused variable). Changes in SBT: - Same Bilinear minor fix.
wu-haoze
approved these changes
Dec 11, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implemented Backward-Forward algorithm, symbolic bound tightening, interval arithmetic, simulations for all missing activation functions, and added unit tests for every combination of algorithm+activation.