Search Results for author: Jan Toenshoff

Found 3 papers, 1 papers with code

Some Might Say All You Need Is Sum

no code implementations22 Feb 2023 Eran Rosenbluth, Jan Toenshoff, Martin Grohe

We prove that under certain restrictions, every Mean or Max GNN can be approximated by a Sum GNN, but even there, a combination of (Sum, [Mean/Max]) is more expressive than Sum alone.

Stable Tuple Embeddings for Dynamic Databases

1 code implementation11 Mar 2021 Jan Toenshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld

We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database.

Knowledge Graphs Databases

Graph Neural Networks for Maximum Constraint Satisfaction

no code implementations18 Sep 2019 Jan Toenshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe

Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems.

Combinatorial Optimization

Cannot find the paper you are looking for? You can Submit a new open access paper.