Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Saro Passaro

dblp:276/0629 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 64% Deep learning architectures and training · 36%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › equivariant neural network
equivariant convolution
0.712023
Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs · ICML 2023
Machine learning › Graph learning › graph neural network › geometric graph neural network
equivariant graph neural network
0.712023
Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs · ICML 2023
Machine learning › Graph learning
graph neural network
0.512021
Directional Graph Networks · ICML 2021

Methods — techniques the papers use, named apart from their topics

tensor product · 0.7spherical channel network · 0.7SO(3) equivariance · 0.7
YearPublicationVenuePosition
2023 Reducing SO(3) Convolutions to SO(2) for Efficient Equivariant GNNs
abstract
Graph neural networks that model 3D data, such as point clouds or atoms, are typically desired to be $SO(3)$ equivariant, i.e., equivariant to 3D rotations. Unfortunately equivariant convolutions, which are a fundamental operation for equivariant networks, increase significantly in computational complexity as higher-order tensors are used. In this paper, we address this issue by reducing the $SO(3)$ convolutions or tensor products to mathematically equivalent convolutions in $SO(2)$ . This is accomplished by aligning the node embeddings' primary axis with the edge vectors, which sparsifies the tensor product and reduces the computational complexity from $O(L^6)$ to $O(L^3)$, where $L$ is the degree of the representation. We demonstrate the potential implications of this improvement by proposing the Equivariant Spherical Channel Network (eSCN), a graph neural network utilizing our novel approach to equivariant convolutions, which achieves state-of-the-art results on the large-scale OC-20 and OC-22 datasets.
Saro Passaro, C. Lawrence Zitnick
ICML1
2021 Directional Graph Networks
Dominique Beaini, Saro Passaro, Vincent Létourneau, William L. Hamilton, Gabriele Corso, Pietro Liò
ICML2