Revisiting Global Pooling through the Lens of Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Global pooling is one of the most significant operations in many machine learning models and tasks, whose implementation, however, is often empirical in practice. In this study, we develop a novel and solid global pooling framework through the lens of optimal transport. We demonstrate that most existing global pooling methods are equivalent to solving some specializations of an unbalanced optimal transport (UOT) problem. Making the parameters of the UOT problem learnable, we unify various global pooling methods in the same framework, and accordingly, propose a generalized global pooling layer called UOT-Pooling (UOTP) for neural networks. Besides implementing the UOTP layer based on the classic Sinkhorn-scaling algorithm, we design a new model architecture based on the Bregman ADMM algorithm, which has better numerical stability and can reproduce existing pooling layers more effectively. We test our UOTP layers in several application scenarios, including multi-instance learning, graph classification, and image classification. Our UOTP layers can either imitate conventional global pooling layers or learn some new pooling mechanisms leading to better performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 50 references that are in the map. First posted on arXiv 23 Jan 2022.
Builds on
32 of 50 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Deep Setscited by 1,394
- 2018Attention-based Deep Multiple Instance Learningcited by 1,077
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2013Network In Networkcited by 600
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2019Self-Attention Graph Poolingcited by 421
20 more
- 2017Wasserstein Auto-Encoderscited by 371
- 2020Sparse Sinkhorn Attentioncited by 250
- 2020DeeperGCN: All You Need to Train Deeper GCNscited by 249
- 2015Order Matters: Sequence to sequence for setscited by 236
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
- 2015Learning with a Wasserstein Losscited by 194
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 172
- 2019ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representationscited by 156
- 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 136
- 2017Smooth and Sparse Optimal Transportcited by 83
- 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
- 2020On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithmcited by 61
- 2020Wasserstein Embedding for Graph Learningcited by 56
- 2015Generalizing Pooling Functions in Convolutional Neural Networks: Mixed, Gated, and Treecited by 36
- 2013Learned-Norm Pooling for Deep Feedforward and Recurrent Neural Networkscited by 32
- 2015Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Supportcited by 30
- 2019Gromov-Wasserstein Factorization Models for Graph Clusteringcited by 25
- 2013Bregman Alternating Direction Method of Multiplierscited by 19
- 2021Learning to Pool in Graph Neural Networks for Extrapolationcited by 4
Built on by
Not cited yet.