Andrea Patane

Andrea Patane

Auto-generated profile, based on publicly available information

Andrea Patane

Trinity College Dublin

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2023 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Open access
ATAlessandro Tognan
Alessandro Tognan
APAndrea Patanè
Andrea Patanè
LLLuca Laurenti
Luca Laurenti
Enrico SalvatiEnrico Salvati
Enrico Salvati

11 September 2024
Verified
Book Chapter
Open access
PDF file
MWMatthew Wicker
Matthew Wicker
APAndrea Patane
Andrea Patane
LLLuca Laurenti
Luca Laurenti
MKMarta Kwiatkowska
Marta Kwiatkowska
We study the problem of certifying the robustness of Bayesian neural networks (BNNs) to adversarial input perturbations. Specifically, we define two notions of robustness for BNNs in an adversarial setting: probabilistic robustness and decision robustness. The former deals with the probabilistic behaviour of the network, that is, it ensures robustness across different stochastic realisations of the network, while the latter provides guarantees for the overall (output) decision of the BNN. Although these robustness properties cannot be computed analytically, we present a unified computational framework for efficiently and formally bounding them. Our approach is based on weight interval sampling, integration and bound propagation techniques, and can be applied to BNNs with a large number of parameters independently of the (approximate) inference method employed to train the BNN. We evaluate the effectiveness of our method on tasks including airborne collision avoidance, medical imaging and autonomous driving, demonstrating that it can compute non-trivial guarantees on medium size images (i.e., over 16 thousand input parameters).

23 June 2023 in arXiv
Verified
Preprint
Open access
PDF file
MWMatthew Wicker
Matthew Wicker
APAndrea Patane
Andrea Patane
LLLuca Laurenti
Luca Laurenti
MKMarta Kwiatkowska
Marta Kwiatkowska
We study the problem of certifying the robustness of Bayesian neural networks (BNNs) to adversarial input perturbations. Given a compact set of input points $T \subseteq \mathbb{R}^m$ and a set of output points $S \subseteq \mathbb{R}^n$, we define two notions of robustness for BNNs in an adversarial setting: probabilistic robustness and decision robustness. Probabilistic robustness is the probability that for all points in $T$ the output of a BNN sampled from the posterior is in $S$. On the other hand, decision robustness considers the optimal decision of a BNN and checks if for all points in $T$ the optimal decision of the BNN for a given loss function lies within the output set $S$. Although exact computation of these robustness properties is challenging due to the probabilistic and non-convex nature of BNNs, we present a unified computational framework for efficiently and formally bounding them. Our approach is based on weight interval sampling, integration, and bound propagation techniques, and can be applied to BNNs with a large number of parameters, and independently of the (approximate) inference method employed to train the BNN. We evaluate the effectiveness of our methods on various regression and classification tasks, including an industrial regression benchmark, MNIST, traffic sign recognition, and airborne collision avoidance, and demonstrate that our approach enables certification of robustness and uncertainty of BNN predictions.

4 March 2025
Verified
Book Chapter
Closed access
PDF file
BWBrian Whelan
Brian Whelan
APAndrea Patane
Andrea Patane

21 April 2023 in arXiv
Verified
Preprint
Open access
PDF file
ADAlice Doherty
Alice Doherty
MWMatthew Wicker
Matthew Wicker
LLLuca Laurenti
Luca Laurenti
APAndrea Patane
Andrea Patane
We study Individual Fairness (IF) for Bayesian neural networks (BNNs). Specifically, we consider the $ε$-$δ$-individual fairness notion, which requires that, for any pair of input points that are $ε$-similar according to a given similarity metrics, the output of the BNN is within a given tolerance $δ>0.$ We leverage bounds on statistical sampling over the input space and the relationship between adversarial robustness and individual fairness to derive a framework for the systematic estimation of $ε$-$δ$-IF, designing Fair-FGSM and Fair-PGD as global,fairness-aware extensions to gradient-based attacks for BNNs. We empirically study IF of a variety of approximately inferred BNNs with different architectures on fairness benchmarks, and compare against deterministic models learnt using frequentist techniques. Interestingly, we find that BNNs trained by means of approximate Bayesian inference consistently tend to be markedly more individually fair than their deterministic counterparts.

26 May 2023
Verified
Book Chapter
Closed access
PDF file
MAMatteo N. Amaradio
Matteo N. Amaradio
GJGiorgio Jansen
Giorgio Jansen
APAndrea Patanè
Andrea Patanè
JCJole Costanza
Jole Costanza
GNGiuseppe Nicosia
Giuseppe Nicosia