Digitala Vetenskapliga Arkivet

Driftstörningar
Det förekommer återkommande driftstörningar på några av sök-portalerna på grund av hög belastning. Vi arbetar på att lösa problemet, ni kan tillfälligt mötas av ett felmeddelande.
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Analysis of Neural Network Robustness using Mixed Integer Linear Programming
KTH, Skolan för teknikvetenskap (SCI).
KTH, Skolan för teknikvetenskap (SCI).
2026 (Engelska)Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
Abstract [en]

Deep neural networks are increasingly deployed in applications involving critical decision-making, yet their vulnerability to adversarial perturbations raises important concerns regarding their reliability. This has motivated the need for methods that can rigorously assess and certify the robustness of such models.

In this thesis, we study the robustness of feedforward neural networks with ReLU activation functions. For ReLU networks, the robustness problem can be reformulated as a Mixed-Integer Linear Programming problem (MILP) , enabling the computation of maximum perturbations using state-of-the-art solvers. However, due to the computational complexity of MILP, approximate methods based on algorithmic bound propagation are often employed to obtain certified lower bounds on robustness.

We analyze neural network models trained on a smaller and bigger dataset respectively. The models for the respective datasets have architectures ranging from zero to five hidden layers. For each model, we compute the maximum admissible perturbation using an exact MILP solver, and compare it with three approximation methods: forward pass, forward-backward pass and FastLin. Additionally, we investigate the influence of different norm constraints on the robustness estimate.

The results show a consistent relationship between model complexity and the tightness of robustness bounds: more advanced models yield larger (less conservative) estimates of the maximum perturbation. Furthermore, the gap between approximate and exact methods increases with network depth, indicating that simpler methods become less accurate for deeper architectures. The choice of norm also significantly affects the bounds, with the L-infinity norm giving the smallest robustness bounds.

These findings all align with theoretical expectations, as approximate methods introduce layer-wise relaxations that accumulate with increasing network depth. Consequently, using such methods on deeper networks lead to looser bounds.

A limitation of this study is the relatively small scale of the models and datasets used. Future work could extend the analysis to larger and more complex models, as well as additional datasets, to further investigate the scalability and accuracy of robustness estimation methods.

Ort, förlag, år, upplaga, sidor
2026.
Serie
TRITA-SCI-GRU ; 2026:099
Nyckelord [en]
Deep Neural Networks (DNNs), Robustness, Mixed-Integer Linear Programming (MILP), ReLU Networks, Optimization, Algorithmic Bound Propagation, FastLin, Relaxation, Big M method
Nationell ämneskategori
Matematik
Identifikatorer
URN: urn:nbn:se:kth:diva-384183OAI: oai:DiVA.org:kth-384183DiVA, id: diva2:2080107
Utbildningsprogram
Civilingenjörsexamen - Teknisk Matematik
Handledare
Examinatorer
Tillgänglig från: 2026-06-26 Skapad: 2026-06-26 Senast uppdaterad: 2026-06-26Bibliografiskt granskad

Open Access i DiVA

fulltext(1668 kB)38 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1668 kBChecksumma SHA-512
4619bbfa8ea9013dcb3eea745637d62a4bbcb8bd8abbd5e87be71ce9a81b68bf59340b9d4dfc2d7cabdc6faf2505f3053594f3d5c67dc524386a7698a6a6a11c
Typ fulltextMimetyp application/pdf

Av organisationen
Skolan för teknikvetenskap (SCI)
Matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 1073 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf