Energy
Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach
Graph neural networks (GNNs) are vulnerable to adversarial perturbations, including those that affect both node features and graph topology. This paper investigates GNNs derived from diverse neural flows, concentrating on their connection to various stability notions such as BIBO stability, Lyapunov stability, structural stability, and conservative stability. We argue that Lyapunov stability, despite its common use, does not necessarily ensure adversarial robustness. Inspired by physics principles, we advocate for the use of conservative Hamiltonian neural flows to construct GNNs that are robust to adversarial attacks. The adversarial robustness of different neural flow GNNs is empirically compared on several benchmark datasets under a variety of adversarial attacks.
RapidBERT_NeurIPS_Submission-2023-5-24-358pm
The GLUE benchmark consists of 8 (originally 9) tasks [Wang et al., 2018]. Hypothesis: "It has a buffet." CoLA (Corpus of Linguistic Acceptability) [8,551 train, 1,063 test] [Warstadt et al., 2019] is a "The higher the stakes, the lower his expectations are." The task is to classify the sentiment as either positive or negative [Socher et al., 2013]. Note that we excluded finetuning on the 9th GLUE task WNLI (Winograd NLI) [Levesque et al., We used the hyperparameters in Table S1 for finetuning all BERT and RapidBERT models.