Scalable Graph Coreset Selection via Greedy Sampling

arXiv:2607.27602 · math.NA, stat.ML · Submitted 2026-07-30 · Read on arXiv

Zhaiming Shen, Alexander Cloninger

math.NA, stat.ML

Submitted: 2026-07-30

Code: https://github.com/zzzzms/GreedyGraphCoresetSelection

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Clustering — 5× in this paper · explained in 2 episodes
• Spectral Gap — 4× in this paper · explained in 6 episodes
• Benchmark — 2× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 3 episodes
• Class Imbalance — 1× in this paper · explained in 3 episodes
• GNNs — 1× in this paper · explained in 2 episodes
• Graph Neural Networks (GNNs) — 1× in this paper · explained in 13 episodes
• Greedy Graph Coreset Selection — 1× in this paper
• International Conference on Machine Learning — 1× in this paper
• Redundancy — 1× in this paper · explained in 2 episodes
• Representation Learning — 1× in this paper · explained in 3 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• Spectral Greedy Coresets for Graph Neural Networks
• Pitfalls of Graph Neural Network Evaluation

Related papers

• Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
• A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
• Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
• Operator learning meets inverse problems: A probabilistic perspective
• Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
• Windowed thinning and query complexity for the bouncy particle and Zigzag samplers