31 citations · 38 across the 16 of their papers we have counts for
10 papers · 1 filter
Nonlinear Laplacians Improve Signed-Directed Graph Learning
Ali Parviz, Yuichi Yoshida
While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Lapla…
Reassessing Muon for Matrix Factorization
Ali Parviz, Gal Mishne, Alex Cloninger
Muon has recently emerged as a strong optimizer for large-scale deep learning, where it reshapes gradient updates through approximate orthogonalization and has been reported to out…
GraphBench: Next-generation graph learning benchmarking
Timo Stoll, Chendi Qian, Ben Finkelshtein +16
Machine learning on graphs has made substantial progress across domains such as molecular property prediction and chip design. Yet benchmarking practices remain fragmented, often r…
TGM: a Modular and Efficient Library for Machine Learning on Temporal Graphs
Jacob Chmura, Shenyang Huang, Tran Gia Bao Ngo +7
Well-designed open-source software drives progress in Machine Learning (ML) research. While static graph ML enjoys mature frameworks like PyTorch Geometric and DGL, ML for temporal…
TGB 2.0: A Benchmark for Learning on Temporal Knowledge Graphs and Heterogeneous Graphs
Julia Gastinger, Shenyang Huang, Mikhail Galkin +9
Multi-relational temporal graphs are powerful tools for modeling real-world data, capturing the evolving and interconnected nature of entities over time. Recently, many novel model…
: A Parameter-Efficient Foundation Model for Molecular Learning
Kerstin Kläser, Błażej Banaszewski, Samuel Maddrell-Mander +5
In biological tasks, data is rarely plentiful as it is generated from hard-to-gather measurements. Therefore, pre-training foundation models on large quantities of available data a…