Loading…

Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks

Artificial neural networks (ANN) have displayed considerable utility in a wide range of applications such as image processing, character and pattern recognition, self-driving cars, evolutionary robotics, and non-linear system identification and control. While ANNs are able to carry out complicated t...

Full description

Saved in:
Bibliographic Details
Main Authors: Tran, Hoang-Dung, Musau, Patrick, Manzanas Lopez, Diego, Yang, Xiaodong, Nguyen, Luan Viet, Xiang, Weiming, Johnson, Taylor T
Format: Conference Proceeding
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-a308t-426c0b32005a776e32ca092584717c674df3ad80916c78bc4ad857780768293d3
cites
container_end_page 60
container_issue
container_start_page 51
container_title
container_volume
creator Tran, Hoang-Dung
Musau, Patrick
Manzanas Lopez, Diego
Yang, Xiaodong
Nguyen, Luan Viet
Xiang, Weiming
Johnson, Taylor T
description Artificial neural networks (ANN) have displayed considerable utility in a wide range of applications such as image processing, character and pattern recognition, self-driving cars, evolutionary robotics, and non-linear system identification and control. While ANNs are able to carry out complicated tasks efficiently, they are susceptible to unpredictable and errant behavior due to irregularities that emanate from their complex non-linear structure. As a result, there have been reservations about incorporating them into safety-critical systems. In this paper, we present a reachability analysis method for feed-forward neural networks (FNN) that employ rectified linear units (ReLUs) as activation functions. The crux of our approach relies on three reachable-set computation algorithms, namely exact schemes, lazy-approximate schemes, and mixing schemes. The exact scheme computes an exact reachable set for FNN, while the lazy-approximate and mixing schemes generate an over-approximation of the exact reachable set. All schemes are designed efficiently to run on parallel platforms to reduce the computation time and enhance the scalability. Our methods are implemented in a toolbox called, NNV, and is evaluated using a set of benchmarks that consist of realistic neural networks with sizes that range from tens to a thousand neurons. Notably, NNV successfully computes and visualizes the exact reachable sets of the real world ACAS Xu deep neural networks (DNNs), which are a variant of a family of novel airborne collision detection systems known as the ACAS System X, using a representation of tens to hundreds of polyhedra.
doi_str_mv 10.1109/FormaliSE.2019.00012
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8807491</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8807491</ieee_id><sourcerecordid>8807491</sourcerecordid><originalsourceid>FETCH-LOGICAL-a308t-426c0b32005a776e32ca092584717c674df3ad80916c78bc4ad857780768293d3</originalsourceid><addsrcrecordid>eNotjs1KAzEUhaMgWGqfQBd5gak3yWRusiylo4WixZ91uTOT2mjGkWSk1Kc3oKvDgY_vHMZuBMyFAHtbD7Gn4J9XcwnCzgFAyDM2s2gESiOUQoXnbCI16kKDtZdsltJ7xpSwAFpP2HZLkUJwwf9QExx_ctQeqPHBjye--KRwSj7xRXgboh8PfeL7IfLaua7I20eKHX9w39mQYzwO8SNdsYs9heRm_zllr_XqZXlfbB7v1svFpiAFZixKWbXQKJlfEGLllGwJrNSmRIFthWW3V9QZsKJq0TRtmYtGNICVkVZ1asqu_7zeObf7ir6neNqZDJRWqF8E0FDW</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks</title><source>IEEE Xplore All Conference Series</source><creator>Tran, Hoang-Dung ; Musau, Patrick ; Manzanas Lopez, Diego ; Yang, Xiaodong ; Nguyen, Luan Viet ; Xiang, Weiming ; Johnson, Taylor T</creator><creatorcontrib>Tran, Hoang-Dung ; Musau, Patrick ; Manzanas Lopez, Diego ; Yang, Xiaodong ; Nguyen, Luan Viet ; Xiang, Weiming ; Johnson, Taylor T</creatorcontrib><description>Artificial neural networks (ANN) have displayed considerable utility in a wide range of applications such as image processing, character and pattern recognition, self-driving cars, evolutionary robotics, and non-linear system identification and control. While ANNs are able to carry out complicated tasks efficiently, they are susceptible to unpredictable and errant behavior due to irregularities that emanate from their complex non-linear structure. As a result, there have been reservations about incorporating them into safety-critical systems. In this paper, we present a reachability analysis method for feed-forward neural networks (FNN) that employ rectified linear units (ReLUs) as activation functions. The crux of our approach relies on three reachable-set computation algorithms, namely exact schemes, lazy-approximate schemes, and mixing schemes. The exact scheme computes an exact reachable set for FNN, while the lazy-approximate and mixing schemes generate an over-approximation of the exact reachable set. All schemes are designed efficiently to run on parallel platforms to reduce the computation time and enhance the scalability. Our methods are implemented in a toolbox called, NNV, and is evaluated using a set of benchmarks that consist of realistic neural networks with sizes that range from tens to a thousand neurons. Notably, NNV successfully computes and visualizes the exact reachable sets of the real world ACAS Xu deep neural networks (DNNs), which are a variant of a family of novel airborne collision detection systems known as the ACAS System X, using a representation of tens to hundreds of polyhedra.</description><identifier>EISSN: 2575-5099</identifier><identifier>EISBN: 9781728133737</identifier><identifier>EISBN: 1728133734</identifier><identifier>DOI: 10.1109/FormaliSE.2019.00012</identifier><language>eng</language><publisher>IEEE</publisher><subject>Biological neural networks ; formal methods ; machine learning ; Matlab ; Neurons ; parallel algorithms ; Reachability analysis ; Safety ; Task analysis</subject><ispartof>2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE), 2019, p.51-60</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a308t-426c0b32005a776e32ca092584717c674df3ad80916c78bc4ad857780768293d3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8807491$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8807491$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Tran, Hoang-Dung</creatorcontrib><creatorcontrib>Musau, Patrick</creatorcontrib><creatorcontrib>Manzanas Lopez, Diego</creatorcontrib><creatorcontrib>Yang, Xiaodong</creatorcontrib><creatorcontrib>Nguyen, Luan Viet</creatorcontrib><creatorcontrib>Xiang, Weiming</creatorcontrib><creatorcontrib>Johnson, Taylor T</creatorcontrib><title>Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks</title><title>2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE)</title><addtitle>FormaliSE</addtitle><description>Artificial neural networks (ANN) have displayed considerable utility in a wide range of applications such as image processing, character and pattern recognition, self-driving cars, evolutionary robotics, and non-linear system identification and control. While ANNs are able to carry out complicated tasks efficiently, they are susceptible to unpredictable and errant behavior due to irregularities that emanate from their complex non-linear structure. As a result, there have been reservations about incorporating them into safety-critical systems. In this paper, we present a reachability analysis method for feed-forward neural networks (FNN) that employ rectified linear units (ReLUs) as activation functions. The crux of our approach relies on three reachable-set computation algorithms, namely exact schemes, lazy-approximate schemes, and mixing schemes. The exact scheme computes an exact reachable set for FNN, while the lazy-approximate and mixing schemes generate an over-approximation of the exact reachable set. All schemes are designed efficiently to run on parallel platforms to reduce the computation time and enhance the scalability. Our methods are implemented in a toolbox called, NNV, and is evaluated using a set of benchmarks that consist of realistic neural networks with sizes that range from tens to a thousand neurons. Notably, NNV successfully computes and visualizes the exact reachable sets of the real world ACAS Xu deep neural networks (DNNs), which are a variant of a family of novel airborne collision detection systems known as the ACAS System X, using a representation of tens to hundreds of polyhedra.</description><subject>Biological neural networks</subject><subject>formal methods</subject><subject>machine learning</subject><subject>Matlab</subject><subject>Neurons</subject><subject>parallel algorithms</subject><subject>Reachability analysis</subject><subject>Safety</subject><subject>Task analysis</subject><issn>2575-5099</issn><isbn>9781728133737</isbn><isbn>1728133734</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjs1KAzEUhaMgWGqfQBd5gak3yWRusiylo4WixZ91uTOT2mjGkWSk1Kc3oKvDgY_vHMZuBMyFAHtbD7Gn4J9XcwnCzgFAyDM2s2gESiOUQoXnbCI16kKDtZdsltJ7xpSwAFpP2HZLkUJwwf9QExx_ctQeqPHBjye--KRwSj7xRXgboh8PfeL7IfLaua7I20eKHX9w39mQYzwO8SNdsYs9heRm_zllr_XqZXlfbB7v1svFpiAFZixKWbXQKJlfEGLllGwJrNSmRIFthWW3V9QZsKJq0TRtmYtGNICVkVZ1asqu_7zeObf7ir6neNqZDJRWqF8E0FDW</recordid><startdate>201905</startdate><enddate>201905</enddate><creator>Tran, Hoang-Dung</creator><creator>Musau, Patrick</creator><creator>Manzanas Lopez, Diego</creator><creator>Yang, Xiaodong</creator><creator>Nguyen, Luan Viet</creator><creator>Xiang, Weiming</creator><creator>Johnson, Taylor T</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201905</creationdate><title>Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks</title><author>Tran, Hoang-Dung ; Musau, Patrick ; Manzanas Lopez, Diego ; Yang, Xiaodong ; Nguyen, Luan Viet ; Xiang, Weiming ; Johnson, Taylor T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a308t-426c0b32005a776e32ca092584717c674df3ad80916c78bc4ad857780768293d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Biological neural networks</topic><topic>formal methods</topic><topic>machine learning</topic><topic>Matlab</topic><topic>Neurons</topic><topic>parallel algorithms</topic><topic>Reachability analysis</topic><topic>Safety</topic><topic>Task analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Tran, Hoang-Dung</creatorcontrib><creatorcontrib>Musau, Patrick</creatorcontrib><creatorcontrib>Manzanas Lopez, Diego</creatorcontrib><creatorcontrib>Yang, Xiaodong</creatorcontrib><creatorcontrib>Nguyen, Luan Viet</creatorcontrib><creatorcontrib>Xiang, Weiming</creatorcontrib><creatorcontrib>Johnson, Taylor T</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tran, Hoang-Dung</au><au>Musau, Patrick</au><au>Manzanas Lopez, Diego</au><au>Yang, Xiaodong</au><au>Nguyen, Luan Viet</au><au>Xiang, Weiming</au><au>Johnson, Taylor T</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks</atitle><btitle>2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE)</btitle><stitle>FormaliSE</stitle><date>2019-05</date><risdate>2019</risdate><spage>51</spage><epage>60</epage><pages>51-60</pages><eissn>2575-5099</eissn><eisbn>9781728133737</eisbn><eisbn>1728133734</eisbn><abstract>Artificial neural networks (ANN) have displayed considerable utility in a wide range of applications such as image processing, character and pattern recognition, self-driving cars, evolutionary robotics, and non-linear system identification and control. While ANNs are able to carry out complicated tasks efficiently, they are susceptible to unpredictable and errant behavior due to irregularities that emanate from their complex non-linear structure. As a result, there have been reservations about incorporating them into safety-critical systems. In this paper, we present a reachability analysis method for feed-forward neural networks (FNN) that employ rectified linear units (ReLUs) as activation functions. The crux of our approach relies on three reachable-set computation algorithms, namely exact schemes, lazy-approximate schemes, and mixing schemes. The exact scheme computes an exact reachable set for FNN, while the lazy-approximate and mixing schemes generate an over-approximation of the exact reachable set. All schemes are designed efficiently to run on parallel platforms to reduce the computation time and enhance the scalability. Our methods are implemented in a toolbox called, NNV, and is evaluated using a set of benchmarks that consist of realistic neural networks with sizes that range from tens to a thousand neurons. Notably, NNV successfully computes and visualizes the exact reachable sets of the real world ACAS Xu deep neural networks (DNNs), which are a variant of a family of novel airborne collision detection systems known as the ACAS System X, using a representation of tens to hundreds of polyhedra.</abstract><pub>IEEE</pub><doi>10.1109/FormaliSE.2019.00012</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2575-5099
ispartof 2019 IEEE/ACM 7th International Conference on Formal Methods in Software Engineering (FormaliSE), 2019, p.51-60
issn 2575-5099
language eng
recordid cdi_ieee_primary_8807491
source IEEE Xplore All Conference Series
subjects Biological neural networks
formal methods
machine learning
Matlab
Neurons
parallel algorithms
Reachability analysis
Safety
Task analysis
title Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T10%3A08%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Parallelizable%20Reachability%20Analysis%20Algorithms%20for%20Feed-Forward%20Neural%20Networks&rft.btitle=2019%20IEEE/ACM%207th%20International%20Conference%20on%20Formal%20Methods%20in%20Software%20Engineering%20(FormaliSE)&rft.au=Tran,%20Hoang-Dung&rft.date=2019-05&rft.spage=51&rft.epage=60&rft.pages=51-60&rft.eissn=2575-5099&rft_id=info:doi/10.1109/FormaliSE.2019.00012&rft.eisbn=9781728133737&rft.eisbn_list=1728133734&rft_dat=%3Cieee_CHZPO%3E8807491%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a308t-426c0b32005a776e32ca092584717c674df3ad80916c78bc4ad857780768293d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8807491&rfr_iscdi=true