MMD Graph Kernel: Effective Metric Learning for Graphs via Maximum Mean Discrepancy

Yan Sun, Jicong Fan
2/12/2026

No confident code implementation found for this paper. 4 possible matches can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Scalable Modular Network: A Framework for Adaptive Learning via Agreement Routing

99% match1 repo1352026

RGE: A Repulsive Graph Rectification for Node Classification via Influence

99% match1 repo72026

RobustLight: Improving Robustness via Diffusion Reinforcement Learning for Traffic Signal Control

99% match2026

LogicDP: Creating Labels for Graph Data via Inductive Logic Programming

99% match2026

SEDiff: Structure Extraction for Domain Adaptive Depth Estimation via Denoising Diffusion Models

99% match2026

UltraRE: Enhancing RecEraser for Recommendation Unlearning via Error Decomposition

99% match1 repo82026

Cite this paper

@article{sun2026graph,
  title  = {MMD Graph Kernel: Effective Metric Learning for Graphs via Maximum Mean Discrepancy},
  author = {Yan Sun and Jicong Fan},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:49e28c920f329c223768b0cf0a8832100bf1621e},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/49e28c920f329c223768b0cf0a8832100bf1621e.svg)](https://codeofpaper.com/paper/49e28c920f329c223768b0cf0a8832100bf1621e)

Discussion