:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhou, Junru, Feng, Jiarui, Wang, Xiyuan, Zhang, Muhan
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2309.04941
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman
por: Feng, Jiarui, et al.
Publicado: (2023)

An Efficient Subgraph GNN with Provable Substructure Counting Power
por: Yan, Zuoyu, et al.
Publicado: (2023)

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

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)

Towards Stable, Globally Expressive Graph Representations with Laplacian Eigenvectors
por: Zhou, Junru, et al.
Publicado: (2024)

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

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

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

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

Is Distance Matrix Enough for Geometric Deep Learning?
por: Li, Zian, et al.
Publicado: (2023)

Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning
por: Paolino, Raffaele, et al.
Publicado: (2024)

Using Random Noise Equivariantly to Boost Graph Neural Networks Universally
por: Wang, Xiyuan, et al.
Publicado: (2025)

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

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

Unifying Generation and Prediction on Graphs with Latent Graph Diffusion
por: Zhou, Cai, et al.
Publicado: (2024)

Improving Graph Neural Networks on Multi-node Tasks with the Labeling Trick
por: Wang, Xiyuan, et al.
Publicado: (2023)

Graph as Point Set
por: Wang, Xiyuan, et al.
Publicado: (2024)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

OCN: Effectively Utilizing Higher-Order Common Neighbors for Better Link Prediction
por: Wang, Juntong, et al.
Publicado: (2025)

Neural Common Neighbor with Completion for Link Prediction
por: Wang, Xiyuan, et al.
Publicado: (2023)

Meta Pruning via Graph Metanetworks : A Universal Meta Learning Framework for Network Pruning
por: Liu, Yewei, et al.
Publicado: (2025)

Branching Strategies Based on Subgraph GNNs: A Study on Theoretical Promise versus Practical Reality
por: Zhou, Junru, et al.
Publicado: (2025)

Round-trip Reinforcement Learning: Self-Consistent Training for Better Chemical LLMs
por: Kong, Lecheng, et al.
Publicado: (2025)

Reconsidering the Performance of GAE in Link Prediction
por: Ma, Weishuo, et al.
Publicado: (2024)

On the Completeness of Invariant Geometric Deep Learning Models
por: Li, Zian, et al.
Publicado: (2024)

Edged Weisfeiler-Lehman Algorithm
por: Yue, Xiao, et al.
Publicado: (2025)

Geometric Representation Condition Improves Equivariant Molecule Generation
por: Li, Zian, et al.
Publicado: (2024)

Efficient Neural Common Neighbor for Temporal Graph Link Prediction
por: Zhang, Xiaohui, et al.
Publicado: (2024)

How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step?
por: Cui, Guanyu, et al.
Publicado: (2024)

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

Do Graph Diffusion Models Accurately Capture and Generate Substructure Distributions?
por: Wang, Xiyuan, et al.
Publicado: (2025)

Provably Efficient Action-Manipulation Attack Against Continuous Reinforcement Learning
por: Luo, Zhi, et al.
Publicado: (2024)

GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning
por: Ma, Weishuo, et al.
Publicado: (2025)

LMC: Fast Training of GNNs via Subgraph Sampling with Provable Convergence
por: Shi, Zhihao, et al.
Publicado: (2023)

Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs
por: Scholkemper, Michael, et al.
Publicado: (2024)

The Iteration Number of the Weisfeiler-Leman Algorithm
por: Grohe, Martin, et al.
Publicado: (2023)

The Weisfeiler-Leman Dimension of Conjunctive Queries
por: Göbel, Andreas, et al.
Publicado: (2023)