Home > Research > Publications & Outputs > Reachability analysis of deep neural networks w...
View graph of relations

Reachability analysis of deep neural networks with provable guarantees

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Reachability analysis of deep neural networks with provable guarantees. / Ruan, Wenjie; Huang, Xiaowei; Kwiatkowska, Marta.
Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. ed. / Jerome Lang. Vol. 2018 International Joint Conferences on Artificial Intelligence, 2018. p. 2651-2659.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

Ruan, W, Huang, X & Kwiatkowska, M 2018, Reachability analysis of deep neural networks with provable guarantees. in J Lang (ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. vol. 2018, International Joint Conferences on Artificial Intelligence, pp. 2651-2659, 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13/07/18.

APA

Ruan, W., Huang, X., & Kwiatkowska, M. (2018). Reachability analysis of deep neural networks with provable guarantees. In J. Lang (Ed.), Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 (Vol. 2018, pp. 2651-2659). International Joint Conferences on Artificial Intelligence.

Vancouver

Ruan W, Huang X, Kwiatkowska M. Reachability analysis of deep neural networks with provable guarantees. In Lang J, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Vol. 2018. International Joint Conferences on Artificial Intelligence. 2018. p. 2651-2659

Author

Ruan, Wenjie ; Huang, Xiaowei ; Kwiatkowska, Marta. / Reachability analysis of deep neural networks with provable guarantees. Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. editor / Jerome Lang. Vol. 2018 International Joint Conferences on Artificial Intelligence, 2018. pp. 2651-2659

Bibtex

@inproceedings{efec72f853a84e6fa48c2dc9f8328118,
title = "Reachability analysis of deep neural networks with provable guarantees",
abstract = "Verifying correctness of deep neural networks (DNNs) is challenging. We study a generic reachability problem for feed-forward DNNs which, for a given set of inputs to the network and a Lipschitz-continuous function over its outputs, computes the lower and upper bound on the function values. Because the network and the function are Lipschitz continuous, all values in the interval between the lower and upper bound are reachable. We show how to obtain the safety verification problem, the output range analysis problem and a robustness measure by instantiating the reachability problem. We present a novel algorithm based on adaptive nested optimisation to solve the reachability problem. The technique has been implemented and evaluated on a range of DNNs, demonstrating its efficiency, scalability and ability to handle a broader class of networks than state-of-the-art verification approaches.",
author = "Wenjie Ruan and Xiaowei Huang and Marta Kwiatkowska",
year = "2018",
month = jul,
day = "13",
language = "English",
volume = "2018",
pages = "2651--2659",
editor = "Jerome Lang",
booktitle = "Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018",
publisher = "International Joint Conferences on Artificial Intelligence",
note = "27th International Joint Conference on Artificial Intelligence, IJCAI 2018 ; Conference date: 13-07-2018 Through 19-07-2018",

}

RIS

TY - GEN

T1 - Reachability analysis of deep neural networks with provable guarantees

AU - Ruan, Wenjie

AU - Huang, Xiaowei

AU - Kwiatkowska, Marta

PY - 2018/7/13

Y1 - 2018/7/13

N2 - Verifying correctness of deep neural networks (DNNs) is challenging. We study a generic reachability problem for feed-forward DNNs which, for a given set of inputs to the network and a Lipschitz-continuous function over its outputs, computes the lower and upper bound on the function values. Because the network and the function are Lipschitz continuous, all values in the interval between the lower and upper bound are reachable. We show how to obtain the safety verification problem, the output range analysis problem and a robustness measure by instantiating the reachability problem. We present a novel algorithm based on adaptive nested optimisation to solve the reachability problem. The technique has been implemented and evaluated on a range of DNNs, demonstrating its efficiency, scalability and ability to handle a broader class of networks than state-of-the-art verification approaches.

AB - Verifying correctness of deep neural networks (DNNs) is challenging. We study a generic reachability problem for feed-forward DNNs which, for a given set of inputs to the network and a Lipschitz-continuous function over its outputs, computes the lower and upper bound on the function values. Because the network and the function are Lipschitz continuous, all values in the interval between the lower and upper bound are reachable. We show how to obtain the safety verification problem, the output range analysis problem and a robustness measure by instantiating the reachability problem. We present a novel algorithm based on adaptive nested optimisation to solve the reachability problem. The technique has been implemented and evaluated on a range of DNNs, demonstrating its efficiency, scalability and ability to handle a broader class of networks than state-of-the-art verification approaches.

M3 - Conference contribution/Paper

AN - SCOPUS:85055719349

VL - 2018

SP - 2651

EP - 2659

BT - Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018

A2 - Lang, Jerome

PB - International Joint Conferences on Artificial Intelligence

T2 - 27th International Joint Conference on Artificial Intelligence, IJCAI 2018

Y2 - 13 July 2018 through 19 July 2018

ER -