Imagen de Portada

Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Paolino, Raffaele, Maskey, Sohir, Welke, Pascal, Kutyniok, Gitta
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Graph Representational Learning: When Does More Expressivity Hurt Generalization?
por: Maskey, Sohir, et al.
Publicado: (2025)

Generalization Bounds for Message Passing Networks on Mixture of Graphons
por: Maskey, Sohir, et al.
Publicado: (2024)

Graph Neural Networks for Enhancing Ensemble Forecasts of Extreme Rainfall
por: Bülte, Christopher, et al.
Publicado: (2025)

The Price of Robustness: Stable Classifiers Need Overparameterization
por: von Berg, Jonas, et al.
Publicado: (2026)

Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets Win
por: Kummer, Lorenz, et al.
Publicado: (2025)

Aligning Transformers with Weisfeiler-Leman
por: Müller, Luis, et al.
Publicado: (2024)

On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters
por: Lanzinger, Matthias, et al.
Publicado: (2023)

Weisfeiler Leman for Euclidean Equivariant Machine Learning
por: Hordan, Snir, et al.
Publicado: (2024)

Weisfeiler and Leman Go Measurement Modeling: Probing the Validity of the WL Test
por: Subramonian, Arjun, et al.
Publicado: (2023)

Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
por: Hordan, Snir, et al.
Publicado: (2026)

1-Bit Wonder: Improving QAT Performance in the Low-Bit Regime through K-Means Quantization
por: Maskey, Sohir, et al.
Publicado: (2026)

Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs
por: Heeg, Franziska, et al.
Publicado: (2025)

Empowering GNNs via Edge-Aware Weisfeiler-Leman Algorithm
por: Liu, Meng, et al.
Publicado: (2022)

Weisfeiler-Leman at the margin: When more expressivity matters
por: Franks, Billy J., et al.
Publicado: (2024)

Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power
por: Zhou, Junru, et al.
Publicado: (2023)

Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
por: Zhou, Junru, et al.
Publicado: (2024)

Probabilistic neural operators for functional uncertainty quantification
por: Bülte, Christopher, et al.
Publicado: (2025)

Random Spiking Neural Networks are Stable and Spectrally Simple
por: Araya, Ernesto, et al.
Publicado: (2025)

A method for the systematic generation of graph XAI benchmarks via Weisfeiler-Leman coloring
por: Fontanesi, Michele, et al.
Publicado: (2025)

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
por: Boche, Holger, et al.
Publicado: (2024)

Robust identifiability for symbolic recovery of differential equations
por: Hauger, Hillary, et al.
Publicado: (2024)

Time to Spike? Understanding the Representational Power of Spiking Neural Networks in Discrete Time
por: Nguyen, Duc Anh, et al.
Publicado: (2025)

Uncertainty Quantification for Regression: A Unified Framework based on kernel scores
por: Bülte, Christopher, et al.
Publicado: (2025)

An Upper Bound on the Weisfeiler-Leman Dimension
por: Schneider, Thomas, et al.
Publicado: (2024)

Logical Distillation of Graph Neural Networks
por: Pluska, Alexander, et al.
Publicado: (2024)

Improved probabilistic regression using diffusion models
por: Kneissl, Carlo, et al.
Publicado: (2025)

Computational complexity of the Weisfeiler-Leman dimension
por: Lichter, Moritz, et al.
Publicado: (2024)

Weisfeiler and Lehman Go Categorical
por: Choi, Seongjin, et al.
Publicado: (2026)

ParFam -- (Neural Guided) Symbolic Regression Based on Continuous Global Optimization
por: Scholl, Philipp, et al.
Publicado: (2023)

Symbolic Recovery of Differential Equations: The Identifiability Problem
por: Scholl, Philipp, et al.
Publicado: (2022)

Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes
por: Truong, Quang, et al.
Publicado: (2023)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
por: Grohe, Martin, et al.
Publicado: (2023)

WILTing Trees: Interpreting the Distance Between MPNN Embeddings
por: Negishi, Masahiro, et al.
Publicado: (2025)

Dataset of Pathloss and ToA Radio Maps With Localization Application
por: Yapar, Çağkan, et al.
Publicado: (2022)

Conflicting Biases at the Edge of Stability: Norm versus Sharpness Regularization
por: Matveev, Maria, et al.
Publicado: (2025)

Adaptive-CaRe: Adaptive Causal Regularization for Robust Outcome Prediction
por: Bhasker, Nithya, et al.
Publicado: (2026)

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
por: Boche, Holger, et al.
Publicado: (2024)

Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent
por: Kummer, Lorenz, et al.
Publicado: (2023)

Revisiting Glorot Initialization for Long-Range Linear Recurrences
por: Bar, Noga, et al.
Publicado: (2025)

Logarithmic Weisfeiler--Leman and Treewidth
por: Levet, Michael, et al.
Publicado: (2023)