Thomas Gärtner
10 papers · 2011–2025 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (19) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (2)
🏃
Academic Marathon
(14)
🐝
Cross-Pollinator
(14)
🌈
Renaissance Researcher
(6)
📈
Trend Setter
💎
Century Club
(10)
Conferences
ICML (6)
NIPS (4)
Top co-authors
Keywords
low-rank approximation
(2)
graph neural network
(2)
online learning
(1)
scalable learning
(1)
supervised learning
(1)
ridge regression
(1)
sample complexity
(1)
message passing
(1)
graph embedding
(1)
kernel matrix
(1)
linear regression
(1)
nystrom method
(1)
feature construction
(1)
dynamic difficulty
(1)
game difficulty
(1)
exponential update
(1)
partially ordered sets
(1)
dynamic difficulty adjustment
(1)
exponential update algorithm
(1)
nyström method
(1)
Papers
WILTing Trees: Interpreting the Distance Between MPNN Embeddings
ICML 2025
Probably Approximately Global Robustness Certification
ICML 2025
The Expressive Power of Path-Based Graph Neural Networks
ICML 2024
Expectation-Complete Graph Representations with Homomorphisms
ICML 2023
Expressivity-Preserving GNN Simulation
NIPS 2023
Scalable Learning in Reproducing Kernel Krein Spaces
ICML 2019
Nyström Method with Kernel K-means++ Samples as Landmarks
ICML 2017
Effective Parallelisation for Machine Learning
NIPS 2017
Greedy Feature Construction
NIPS 2016
Predicting Dynamic Difficulty
NIPS 2011