Martin Grohe: The Descriptive Complexity of Graph Neural Networks

preview_player
Показать описание
Talk given by Martin Grohe to the Formal Languages and Neural Networks discord on Jan 9th 2023. Thank you, Martin!

Please find the link to their paper here:
  1. Formal Languages and Neural Networks Seminar
Рекомендации по теме
Martin Grohe: The 0:52:42

Martin Grohe: The Descriptive Complexity of Graph Neural Networks

Learning Logically Defined 0:45:13

Learning Logically Defined Hypotheses - Martin Grohe, RWTH Aachen University

Martin Grohe - 0:55:45

Martin Grohe - Symmetry and Similarity

Martin Grohe - 0:56:30

Martin Grohe - A Deep Dive into the Weisfeiler-Leman Algorithm

KR 2021 Invited 1:01:23

KR 2021 Invited talk by Martin Grohe: The Logic of Graph Neural Networks

Martin Grohe, RWTH 0:26:03

Martin Grohe, RWTH Aachen: First-Order Query Evaluation with Cardinality Conditions

B2.3 Logarithmic Weisfeiler-Leman 0:25:01

B2.3 Logarithmic Weisfeiler-Leman Identifies All Planar Graphs

Combinatorics Today Series 1:44:15

Combinatorics Today Series #8: Prof. Martin Grohe

A Finite-Model-Theoretic View 0:38:03

A Finite-Model-Theoretic View on Propositional Proof Complexity

Towards Capturing Order-Independent 0:30:53

Towards Capturing Order-Independent P

Graph Neural Networks 0:16:56

Graph Neural Networks for Prediction of Fuel Ignition Quality

'Symmetrie und Ähnlichkeit' 1:14:31

'Symmetrie und Ähnlichkeit' - Vortrag von Prof. Martin Grohe

F5.F — On 0:23:39

F5.F — On the Weisfeiler-Leman Dimension of Finite Groups

Near-Optimal Lower Bounds 0:21:32

Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

J.A. Makowsky. Model 0:55:24

J.A. Makowsky. Model theory in computer science: My own recurrent themes

4.13 Bennett's Logical 0:07:20

4.13 Bennett's Logical Depth: A Measure of Sophistication

That's All, LEININGERLAND 0:11:54

That's All, LEININGERLAND BAND feat. Alexander Schindler, Martin Grohe, Uwe Martin

The Graph Isomorphism 1:09:45

The Graph Isomorphism Story by Prof. V. Arvind

STOC 2021 - 0:46:45

STOC 2021 - Knuth Prize talk: Logic and Computation – A Match Made in Heaven

Finite and Algorithmic 1:07:19

Finite and Algorithmic Model Theory III

Pascal Schweitzer, Deep 0:59:00

Pascal Schweitzer, Deep Weisfeiler-Leman for graphs and other structures

Prof. Dr. Kristian 1:25:18

Prof. Dr. Kristian Kersting - Statistical Relational AI

NeurIPS 2021 || 0:15:16

NeurIPS 2021 || DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks Paper

Andrea Montanari - 0:36:11

Andrea Montanari - Full replica symmetry breaking and computational complexity