[54] K. Lu, A. Grover, P. Abbeel, and I. Mordatch. Frozen pretrained transformers as universal computation engines. In AAAI, 2022. (Cited on 22)
[55] S. Luo, T. Chen, Y. Xu, S. Zheng, T. Liu, D. He, and L. Wang. One transformer can understand both 2d & 3d molecular data. arXiv, 2022. (Cited on 22)
[56] H. Maron, H. Ben-Hamu, H. Serviansky, and Y. Lipman. Provably powerful graph networks. In NeurIPS, 2019. (Cited on 1, 6, 7, 9, 22)
[57] H. Maron, H. Ben-Hamu, N. Shamir, and Y. Lipman. Invariant and equivariant graph networks. In ICLR, 2019. (Cited on 19, 22)
[58] H. Maron, E. Fetaya, N. Segol, and Y. Lipman. On the universality of invariant networks. In ICML, 2019. (Cited on 1)
[59] H. Maron, O. Litany, G. Chechik, and E. Fetaya. On learning sets of symmetric elements. In ICML, 2020. (Cited on 19)
[60] B. D. McKay, M. A. Yirik, and C. Steinbeck. Surge: a fast open-source chemical graph generator. J. Cheminformatics, 2022. (Cited on 31)
[61] G. E. Mena, D. Belanger, S. W. Linderman, and J. Snoek. Learning latent permutations with gumbel-sinhorn networks. In ICLR, 2018. (Cited on 4, 24)
[62] F. Mezzadri. How to generate random matrices from the classical compact groups. Notices of the American Mathematical Society, 2006. (Cited on 2)
[63] E. Min, R. Chen, Y. Bian, T. Xu, K. Zhao, W. Huang, P. Zhao, J. Huang, S. Ananiadou, and Y. Rong. Transformer for graphs: An overview from architecture perspective. arXiv, 2022. (Cited on 22)
[64] C. Morris, M. Ritzert, M. Fey, W. L. Hamilton, J. E. Lenssen, G. Rattan, and M. Grohe. Weisfeiler and leman go neural: Higher-order graph neural networks. In AAAI, 2019. (Cited on 1, 22)
[65] S. C. Mouli and B. Ribeiro. Neural networks for learning counterfactual g-invariances from single environments. In ICLR, 2021. (Cited on 2, 22)
[66] L. Müller, M. Galkin, C. Morris, and L. Rampásek. Attending to graph transformers. arXiv, 2023. (Cited on 22)
[67] R. L. Murphy, B. Srinivasan, V. Rao, and B. Ribeiro. Janossy pooling: Learning deep permutation-invariant functions for variable-size inputs. In ICLR, 2019. (Cited on 1, 2, 22, 28)
[68] R. L. Murphy, B. Srinivasan, V. A. Rao, and B. Ribeiro. Relational pooling for graph representations. In ICML, 2019. (Cited on 2, 22, 28)
[69] H. NT and T. Maehara. Revisiting graph neural networks: All we have is low-pass filters. arXiv, 2019. (Cited on 22)
[70] K. Oono and T. Suzuki. Graph neural networks exponentially lose expressive power for node classification. In ICLR, 2020. (Cited on 4, 22)
[71] F. Paischer, T. Adler, V. P. Patil, A. Bitto-Nemling, M. Holzleitner, S. Lehner, H. Eghbal-Zadeh, and S. Hochreiter. History compression via language models in reinforcement learning. In ICML, 2022. (Cited on 22)
[72] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS, 2019. (Cited on 24, 25)
[73] S. Prillo and J. M. Eisenschlos. Softsort: A continuous relaxation for the argsort operator. In ICML, 2020. (Cited on 4)
[74] O. Puny, M. Atzmon, E. J. Smith, I. Misra, A. Grover, H. Ben-Hamu, and Y. Lipman. Frame averaging for invariant and equivariant network design. In *ICLR*, 2022. (Cited on 2, 5, 6, 7, 8, 15, 18, 19, 21, 22, 24, 26, 27)
[75] C. Raffel, N. Shazeer, A. Roberts, K. Lee, S. Narang, M. Matena, Y. Zhou, W. Li, and P. J. Liu. Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res., 2020. (Cited on 22)
[76] L. Rampásek, M. Galkin, V. P. Dwivedi, A. T. Luu, G. Wolf, and D. Beini. Recipe for a general, powerful, scalable graph transformer. In NeurIPS, 2022. (Cited on 10)
[77] M. Rath and A. P. Condurache. Boosting deep neural networks with geometrical prior knowledge: A survey. arXiv, 2020. (Cited on 22)
[78] S. Ravanbakhsh, J. G. Schneider, and B. Póczos. Equivariance through parameter-sharing. In ICML, 2017. (Cited on 22)