Showing 1–17 of 17 results
/ Date/ Name
Oct 4, 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural NetworksJan 27, 2023AdaBoost is not an Optimal Weak to Strong LearnerJun 3, 2022Optimal Weak to Strong LearningFeb 24, 2021On the Parameterized Complexity of Learning First-Order LogicOct 21, 2024MNIST-Nd: a set of naturalistic datasets to benchmark clustering across dimensionsFeb 5, 2024Boosting, Voting Classifiers and Randomized Sample Compression SchemesMay 20, 2024Distinguished In Uniform: Self Attention Vs. Virtual NodesMay 20, 2020The Effects of Randomness on the Stability of Node EmbeddingsJun 1, 2022Graph Machine Learning for Design of High-Octane FuelsSep 1, 2023Where Did the Gap Go? Reassessing the Long-Range Graph BenchmarkSep 24, 2019Learning definable hypotheses on treesSep 18, 2019Graph Neural Networks for Maximum Constraint SatisfactionMar 19, 2025Hierarchical clustering with maximum density paths and mixture modelsAug 27, 2017Learning MSO-definable hypotheses on stringFeb 17, 2021Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message PassingFeb 28, 2025Internal Evaluation of Density-Based Clusterings with NoiseJan 19, 2017Learning first-order definable concepts over structures of small degree