Cover Image

Almost Surely Asymptotically Constant Graph Neural Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Adam-Day, Sam, Benedikt, Michael, Ceylan, İsmail İlkan, Finkelshtein, Ben
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cooperative Graph Neural Networks
by: Finkelshtein, Ben, et al.
Published: (2023)

Zero-One Laws of Graph Neural Networks
by: Adam-Day, Sam, et al.
Published: (2023)

What are the Right Symmetries for Formal Theorem Proving?
by: Olejniczak, Krzysztof, et al.
Published: (2026)

Learning on Large Graphs using Intersecting Communities
by: Finkelshtein, Ben, et al.
Published: (2024)

Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
by: Finkelshtein, Ben, et al.
Published: (2025)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
by: Benedikt, Michael, et al.
Published: (2026)

From learnable objects to learnable random objects
by: Anderson, Aaron, et al.
Published: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
by: Adam-Day, Sam, et al.
Published: (2025)

Bringing Graphs to the Table: Zero-shot Node Classification via Tabular Foundation Models
by: Hayler, Adrian, et al.
Published: (2025)

Lecture Notes on Verifying Graph Neural Networks
by: Schwarzentruber, François
Published: (2025)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

The Descriptive Complexity of Graph Neural Networks
by: Grohe, Martin
Published: (2023)

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)

Nazrin: Atomic Tactics for Graph Neural Networks for Theorem Proving in Lean 4
by: Aniva, Leni, et al.
Published: (2026)

How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
by: Soeteman, Arie, et al.
Published: (2026)

Space Explanations of Neural Network Classification
by: Labbaf, Faezeh, et al.
Published: (2025)

Verifying Quantized Graph Neural Networks is PSPACE-complete
by: Sälzer, Marco, et al.
Published: (2025)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
by: Suilen, Marnix, et al.
Published: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

A Hybrid Real-Time Framework for Efficient Fussell-Vesely Importance Evaluation Using Virtual Fault Trees and Graph Neural Networks
by: Xiao, Xingyu, et al.
Published: (2024)

Proof Minimization in Neural Network Verification
by: Isac, Omri, et al.
Published: (2025)

The Logical Expressiveness of Topological Neural Networks
by: Akbari, Amirreza, et al.
Published: (2026)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Logic Gate Neural Networks are Good for Verification
by: Kresse, Fabian, et al.
Published: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
by: Kassing, Jan-Christoph, et al.
Published: (2026)

TLINet: Differentiable Neural Network Temporal Logic Inference
by: Li, Danyang, et al.
Published: (2024)

The Polynomial Counting Capabilities of Message Passing Neural Networks
by: Sälzer, Marco, et al.
Published: (2026)

Branch and Bound for Piecewise Linear Neural Network Verification
by: Bunel, Rudy, et al.
Published: (2019)

A Logic for Reasoning About Aggregate-Combine Graph Neural Networks
by: Nunn, Pierre, et al.
Published: (2024)

PICID: Proof-Driven Clause Learning in Neural Network Verification
by: Isac, Omri, et al.
Published: (2025)

Neural Model Checking
by: Giacobbe, Mirco, et al.
Published: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Homomorphism Counts for Graph Neural Networks: All About That Basis
by: Jin, Emily, et al.
Published: (2024)

Slice and Explain: Logic-Based Explanations for Neural Networks through Domain Slicing
by: Queiroz, Luiz Fernando Paulino, et al.
Published: (2026)