Picture for Martin Ritzert

Martin Ritzert

MNIST-Nd: a set of naturalistic datasets to benchmark clustering across dimensions

Add code
Oct 21, 2024
Viaarxiv icon

Distinguished In Uniform: Self Attention Vs. Virtual Nodes

Add code
May 20, 2024
Viaarxiv icon

Boosting, Voting Classifiers and Randomized Sample Compression Schemes

Add code
Feb 05, 2024
Viaarxiv icon

Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark

Add code
Sep 05, 2023
Viaarxiv icon

AdaBoost is not an Optimal Weak to Strong Learner

Add code
Jan 27, 2023
Viaarxiv icon

Optimal Weak to Strong Learning

Add code
Jun 08, 2022
Viaarxiv icon

Graph Machine Learning for Design of High-Octane Fuels

Add code
Jun 01, 2022
Figure 1 for Graph Machine Learning for Design of High-Octane Fuels
Figure 2 for Graph Machine Learning for Design of High-Octane Fuels
Figure 3 for Graph Machine Learning for Design of High-Octane Fuels
Figure 4 for Graph Machine Learning for Design of High-Octane Fuels
Viaarxiv icon

Graph Learning with 1D Convolutions on Random Walks

Add code
Feb 17, 2021
Figure 1 for Graph Learning with 1D Convolutions on Random Walks
Figure 2 for Graph Learning with 1D Convolutions on Random Walks
Figure 3 for Graph Learning with 1D Convolutions on Random Walks
Figure 4 for Graph Learning with 1D Convolutions on Random Walks
Viaarxiv icon

The Effects of Randomness on the Stability of Node Embeddings

Add code
May 20, 2020
Figure 1 for The Effects of Randomness on the Stability of Node Embeddings
Figure 2 for The Effects of Randomness on the Stability of Node Embeddings
Figure 3 for The Effects of Randomness on the Stability of Node Embeddings
Figure 4 for The Effects of Randomness on the Stability of Node Embeddings
Viaarxiv icon

RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems

Add code
Sep 27, 2019
Figure 1 for RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
Figure 2 for RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
Figure 3 for RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
Figure 4 for RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
Viaarxiv icon