• Login
    View Item 
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Analytic Treatment of Deep Neural Networks Under Additive Gaussian Noise

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    MS_Thesis.pdf
    Size:
    11.36Mb
    Format:
    PDF
    Description:
    Thesis Full Text
    Download
    Thumbnail
    Name:
    MS_Defense.pptx
    Size:
    20.43Mb
    Format:
    Microsoft PowerPoint 2007
    Description:
    Thesis Defense Slides
    Download
    Thumbnail
    Name:
    MoL_Results.zip
    Size:
    779.3Kb
    Format:
    Unknown
    Description:
    MoL Results
    Download
    View more filesView fewer files
    Type
    Thesis
    Authors
    Alfadly, Modar cc
    Advisors
    Ghanem, Bernard cc
    Committee members
    Heidrich, Wolfgang cc
    Wonka, Peter cc
    Program
    Computer Science
    KAUST Department
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Date
    2018-04-12
    Permanent link to this record
    http://hdl.handle.net/10754/627554
    
    Metadata
    Show full item record
    Abstract
    Despite the impressive performance of deep neural networks (DNNs) on numerous vision tasks, they still exhibit yet-to-understand uncouth behaviours. One puzzling behaviour is the reaction of DNNs to various noise attacks, where it has been shown that there exist small adversarial noise that can result in a severe degradation in the performance of DNNs. To rigorously treat this, we derive exact analytic expressions for the first and second moments (mean and variance) of a small piecewise linear (PL) network with a single rectified linear unit (ReLU) layer subject to general Gaussian input. We experimentally show that these expressions are tight under simple linearizations of deeper PL-DNNs, especially popular architectures in the literature (e.g. LeNet and AlexNet). Extensive experiments on image classification show that these expressions can be used to study the behaviour of the output mean of the logits for each class, the inter-class confusion and the pixel-level spatial noise sensitivity of the network. Moreover, we show how these expressions can be used to systematically construct targeted and non-targeted adversarial attacks. Then, we proposed a special estimator DNN, named mixture of linearizations (MoL), and derived the analytic expressions for its output mean and variance, as well. We employed these expressions to train the model to be particularly robust against Gaussian attacks without the need for data augmentation. Upon training this network on a loss that is consolidated with the derived output probabilistic moments, the network is not only robust under very high variance Gaussian attacks but is also as robust as networks that are trained with 20 fold data augmentation.
    Citation
    Alfadly, M. (2018). Analytic Treatment of Deep Neural Networks Under Additive Gaussian Noise. KAUST Research Repository. https://doi.org/10.25781/KAUST-Y7627
    DOI
    10.25781/KAUST-Y7627
    ae974a485f413a2113503eed53cd6c53
    10.25781/KAUST-Y7627
    Scopus Count
    Collections
    MS Theses; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.