ML: Pooling

Machine-learning ideas tagged Pooling in the ML taxonomy of the Math2NN corpus.

2 ideas found

Unverified 2026

Entropy-Maximized WL Anchor Selection

Replace random or degree-based graph positional anchors with a greedy set chosen to maximize the entropy of the graph's Weisfeiler-Lehman equivalence partition. Give each selected anchor a unique trainable embedding, then run several WL-inspired refinement rounds to produce positional cell features. The resulting positional signal should distinguish nodes that ordinary message passing treats identically while using only a small anchor budget.

Useful6/10

Difficulty4/10

Novelty5/10

Architecture Accuracy Scalability Memory

Paper: On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks arXiv:2607.28168

Unverified 2026

Dominance-Fold Graph Pooling

Before message passing, repeatedly detect a pair of vertices with nested open neighborhoods and fold away the dominated vertex while preserving its information in the surviving vertex's feature state. The graph reduction is justified by homotopy invariance of the independence complex, while the feature merge prevents task-relevant attributes from being lost. Add a topology-aware ablation comparing this exact fold against random node pooling and standard learned pooling.

Useful5/10

Difficulty4/10

Novelty7/10

Architecture Scalability Memory Accuracy

Paper: The Homotopy Types of the Independence and Perfect Matching Complex of Möbius Ladder Graph arXiv:2608.30601