Geometric Mean Pooling for Equal-Weight Multiplicative Coarse-Graining

📅 2026-09-18
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出几何平均池化(GMP)方法,解决传统平均和最大池化的偏置问题,通过保留特征符号信息和乘法尺度,在合成任务、图像分类等中表现良好。
📝 Abstract
As an alternative to the additive and extremal biases of average and max pooling, we introduce Geometric Mean Pooling (GMP), a signed pooling operator that combines the product of feature signs with the geometric mean of feature magnitudes. Motivated by local-to-global composition in quantum many-body physics, GMP retains both joint sign information and a characteristic multiplicative scale without introducing learnable pooling parameters. We show that non-overlapping hierarchical GMP preserves the corresponding global multiplicative statistic and evaluate it on synthetic sequence tasks, iterative coarse-graining, image classification, and molecular lipophilicity regression. On the synthetic tasks, GMP recovers product-based signals more accurately than average and max pooling and maintains predictive performance under the tested levels of multiplicative input noise. On image and molecular data, however, its effectiveness depends on the representation, target parameterization, and placement of local and global pooling. These results position GMP as a complementary, regime-dependent inductive bias for tasks in which equal-weight multiplicative composition is plausible, rather than as a universal replacement for standard pooling operators.
Problem

Research questions and friction points this paper is trying to address.

Geometric Mean Pooling
feature aggregation
multiplicative composition
Innovation

Methods, ideas, or system contributions that make the work stand out.

Geometric Mean Pooling
multiplicative composition
equal-weight
feature signs and magnitudes
no learnable parameters
🔎 Similar Papers
A
Ang-Kun Wu
Department of Physics and Astronomy, University of Tennessee, Knoxville
F
Fangdi Wen
Department of Physics and Astronomy, Rutgers University
J
Jingtao Zhang
Google