REVIEW 4 cited by
Permutation Invariant Representations with Applications to Graph Deep Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is invariant to node relabeling. Two embedding schemes are introduced, one based on sorting and the other based on algebras of multivariate polynomials. While both embeddings exhibit a computational complexity exponential in problem size, the sorting based embedding is globally bi-Lipschitz and admits a low dimensional target space. Additionally, an almost everywhere injective scheme can be implemented with minimal redundancy and low computational cost. In turn, this proves that almost any classifier can be implemented with an arbitrary small loss of performance. Numerical experiments are carried out on two data sets, a chemical compound data set (QM9) and a proteins data set (PROTEINS).
Forward citations
Cited by 4 Pith papers
-
Monotone and Separable Set Functions: Characterizations and Neural Models
Exact subset-order-preserving ('MAS') embeddings need dimension ≥|V| on finite ground sets and do not exist for infinite ground sets; the paper relaxes to weakly-MAS hat-activation models with Hölder-stability and pro...
-
Estimating the Euclidean distortion of an orbit space
The paper derives exact Euclidean distortion values for several orbit spaces, including cyclic quotients of C^n, seven wallpaper group quotients, and two-sided bounds for O(r), SO(r), E(r), and SE(r) actions.
-
On the (Non) Injectivity of Piecewise Linear Janossy Pooling
No piecewise linear k-ary Janossy pooling is injective on general multisets, but simple deep sets are injective on compact domains of well-separated distinct points.
-
Optimal Transport-based Permutation-Invariant Bayesian Optimization of Offshore Wind Farm Layouts
Optimal-transport flows turn permutation-invariant layout optimization into a standard BO problem, yielding higher AEP and lower runtime than vanilla BO on a five-turbine wind-farm surrogate.
Discussion (0). Sign in to comment.