Proposes α-integration pooling for CNNs to improve performance.
problem Finding optimal pooling method for CNNs is challenging.
method Introduces α-integration pooling with a trainable parameter α. result Demonstrates α-integration pooling outperforms other pooling methods in image recognition. New image classifier uses hierarchical max-pooling with local pooling.
problem Improving image classification accuracy with variable spatial relationships.
method Introduces a hierarchical max-pooling model with additional local pooling for convolutional neural networks.
result Demonstrates improved performance in estimating image features.
EdgePool improves GNN performance by pooling edges, not nodes.
problem Lack of effective graph pooling methods in GNNs.
method Edge contraction pooling approach.
result EdgePool outperforms alternative pooling methods.
SAN replaces global pooling layers, improving accuracy and reducing overfitting.
problem Improving accuracy and reducing overfitting in deep neural networks.
method Introducing Set Aggregation Network (SAN) as a trainable global pooling layer.
result SAN improves classification accuracy and is less prone to overfitting.
Graph neural network framework learns graph representations from node features and local structures.
problem Lack of hierarchical pooling to preserve graph structure in graph neural networks.
method Introduces a pooling operator based on graph Fourier transform to combine node features and local structures.
result Framework $\m$ improves graph classification performance on 6 benchmarks.
We seek to improve deep neural networks by generalizing the pooling operations that play a central role in current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in (1) learning a pooling function via (…
A new spectral pooling method reduces loss in CNNs for better performance.
problem Lossy downsampling in CNNs reduces discriminability.
method Hartley Spectral Pooling using Hartley Transform.
result Hartley Spectral Pooling preserves more structure features than max/average pooling.
Proposes clique pooling for graph classification.
problem Graph classification challenges.
method Clique-based graph pooling within GCN and GraphSAGE.
result Competitive performance on graph classification benchmarks.
HGP-SL pools and learns graph structure for hierarchical representation learning.
problem Graph pooling is overlooked in GNN models, limiting hierarchical representation learning.
method Integrates graph pooling and structure learning into a unified module.
result HGP-SL improves graph classification performance on benchmarks.
We propose a max-pooling based loss function for training Long Short-Term Memory (LSTM) networks for small-footprint keyword spotting (KWS), with low CPU, memory, and latency requirements. The max-pooling loss training can be further guided by initializing with a cross-entropy loss trained network. A posterior smoothin…
The paper introduces a pooling mechanism for graph CNNs using NMF.
problem Pooling in graph structured data for efficient computation.
method Non-negative matrix factorization for node pooling.
result The pooling mechanism improves graph classification performance.
A new method pools graph vertex representations into a function space for better graph classification.
problem Pooling graph vertex representations for graph-centric tasks.
method Proposes a novel function space pooling method for graph neural networks.
result The proposed method generally outperforms existing pooling methods in graph classification.
Pooling is not essential for image classification stability.
problem The necessity of pooling for image classification stability.
method Rigorous empirical testing of CNNs without pooling.
result Pooling is neither necessary nor sufficient for optimal deformation stability in CNNs.
Improved vehicle classification using ResNets and spatial pooling.
problem Fine-grained vehicle classification using ResNet architectures.
method Training ResNet-18, -34, and -50 on Comprehensive Cars dataset. Adding Spatially Weighted Pooling and localisation.
result Combining Spatially Weighted Pooling and localisation increases top-1 accuracy to 96.351%.
SpaPool combines dense and sparse techniques for efficient graph pooling.
problem Efficiently processing large graphs in graph neural networks.
method Adaptive clustering of graph vertices into clusters.
result SpaPool outperforms existing methods on small-scale graphs.
ASAP improves graph pooling for hierarchical graph representations.
problem Pooling in graphs fails to effectively capture substructure or scale to large graphs.
method ASAP uses self-attention and modified GNN to capture node importance and learn sparse soft cluster assignments.
result Combining ASAP with GNN architectures leads to state-of-the-art results on graph classification benchmarks.
Predicts student performance in interactive online question pools using GNNs.
problem Predicting student performance in interactive online question pools with evolving knowledge.
method Proposes R^2GCN, a GNN model for heterogeneous networks to predict student performance.
result Achieves higher accuracy in student performance prediction than traditional methods.
We introduce a simple and effective method for regularizing large convolutional neural networks. We replace the conventional deterministic pooling operations with a stochastic procedure, randomly picking the activation within each pooling region according to a multinomial distribution, given by the activities within th…
Proposes SimPool for graph pooling using structural similarity features.
problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.
Graph pooling method uses GNN to cluster graphs efficiently.
problem Efficiently cluster graphs for graph pooling.
method Formulates a continuous relaxation of minCUT, trains GNN to minimize it.
result GNN-based clustering learns fast and performs well.
Max-pooling architectures are theoretically analyzed and shown to be globally optimized and generalize well.
problem Theoretical understanding and optimization of max-pooling in deep learning architectures.
method Theoretical analysis of a convolutional max-pooling architecture, focusing on a pattern detection problem.
result Max-pooling architectures can be globally optimized and generalize well, even for highly over-parameterized models.
In this work we compute lower Lipschitz bounds of ℓp pooling operators for p=1,2,∞ as well as ℓp pooling operators preceded by half-rectification layers. These give sufficient conditions for the design of invertible neural network layers. Numerical experiments on MNIST and image patches confirm tha…
This paper tracks coin circulation in Bitcoin to identify miners and analyze mining pool structures.
problem Identifying and understanding Bitcoin miners and their profit distribution schemes.
method Constructs fresh coin circulation networks and uses a heuristic algorithm to compare networks from different mining pools.
result Infers common profit distribution schemes of Bitcoin mining pools and observes an increasing trend in miner numbers.
PiNet improves graph classification efficiency and accuracy.
problem Graph level classification challenges.
method Attention-based pooling mechanism for graph convolution operations.
result Superior performance and high sample efficiency.
Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.
problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.
Moment Pooling reduces latent space dimensions in machine learning models.
problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.
Faster CNN training with downsampling and pooling.
problem Reducing training time in CNNs.
method Interleaved training with downsampling and pooling.
result Up to 23% reduction in training time with minimal loss.
A new graph pooling method using self-attention improves graph classification performance.
problem Challenges in applying downsampling to graphs in graph neural networks.
method Proposes a self-attention-based graph pooling method.
result Our method achieves superior graph classification performance on benchmark datasets.
iPool selects informative nodes for pooling in arbitrary graphs.
problem Pooling in graph neural networks is often overlooked.
method iPool uses a criterion based on neighborhood conditional entropy to select nodes for pooling.
result iPool achieves state-of-the-art performance on graph classification tasks.
PR-GNN identifies salient brain regions for ASD biomarkers.
problem Identifying brain regions associated with neurological disorders.
method Pooling Regularized Graph Neural Network (PR-GNN) with novel salient region selection.
result PR-GNN outperforms baseline methods in ASD classification accuracy.
Graphon pooling preserves spectral properties in GNNs, reducing overfitting.
problem Unclear pooling and sampling strategies in GNNs that alter graph structure.
method Modeling graph layers as elements of a sequence converging to a graphon.
result Graphon pooling GNNs reduce overfitting and improve performance.
MeshCNN analyzes 3D shapes using edges, overcoming irregularities.
problem Irregularities in mesh representations hinder neural network analysis.
method MeshCNN uses specialized convolution and pooling layers on mesh edges, collapsing them to focus on important features.
result MeshCNN effectively analyzes 3D shapes, learning which edges to collapse.
Bayesian framework for federated learning of neural networks without data pooling.
problem Scattered data across servers in federated learning problems.
method Bayesian nonparametric framework for neural networks, inference approach.
result Synthesize a more expressive global network with a single communication round.
Proposes a new pooling operator for CNNs to handle spatially varying information.
problem Need to treat spatial locations in non-uniform manner for better image classification.
method Introduces an extended pooling operator that can learn different weights for each pixel location.
result The proposed pooling operator improves generalization and robustness in image classification tasks.
ASTPN improves video-based person re-identification by jointly attending to spatial and temporal features.
problem Video-based person re-identification in surveillance and HCI.
method Joint Spatial and Temporal Attention Pooling Network (ASTPN).
result ASTPN outperforms state-of-the-art methods on multiple datasets.
LaPool improves molecular graph representation learning by capturing interaction importance.
problem Lack of efficient intermediate pooling steps in GNNs leads to poor molecular substructure representation.
method LaPool is a novel, data-driven, and interpretable hierarchical graph pooling method that considers node features and graph structure.
result LaPool outperforms recent GNNs on molecular graph prediction and understanding tasks.
We propose an extended public goods interaction model to study the evolution of cooperation in heterogeneous population. The investors are arranged on the well known scale-free type network, the Barabási-Albert model. Each investor is supposed to preferentially distribute capital to pools in its portfolio based on the …
Adaptive pooling operators improve sound event detection with weak labels.
problem Efficiently label audio recordings with weakly annotated sound sources.
method Developed adaptive pooling operators for multiple instance learning.
result Adaptive pooling operators outperform non-adaptive methods on static predictions and nearly match strong annotations.
Global covariance pooling improves deep CNNs' representation and generalization.
problem Capturing richer statistics of deep features for better representation and generalization.
method Integrates global covariance pooling into deep CNNs, addressing challenges with robust covariance estimation and geometry exploitation.
result Proposes MPN-COV Pooling and a Gaussian embedding network, achieving state-of-the-art performance.
Enhances graph neural networks with Relational Pooling for better graph classification.
problem Improving graph neural networks for better graph classification.
method Relational Pooling (RP) based on finite partial exchangeability theory.
result Improved performance on graph classification tasks.
DAGCN improves graph classification by learning neighbor importance and pooling.
problem Loss of early-stage information and loss of node characteristics in GCNs.
method Dual attention graph convolution and self-attention pooling.
result DAGCN outperforms state-of-the-art methods in graph classification.
This paper explores vulnerabilities in hierarchical graph pooling neural networks for graph classification.
problem Vulnerability of hierarchical graph pooling neural networks in graph classification tasks.
method Proposes an adversarial attack framework using a surrogate model to generate adversarial samples.
result Adversarial samples can fool hierarchical GNN-based graph classification models, demonstrating their vulnerability.
PAN uses path integrals for graph convolution and pooling, improving GNN performance.
problem Designing efficient graph convolution and pooling for graph neural networks.
method Path integral based graph convolution and pooling using learnable weights for path lengths.
result PAN achieves state-of-the-art performance on various graph classification/regression tasks.
New lower bounds on embedding dimensions for neural network architectures.
problem Ensuring neural networks can handle symmetries like permutations in high dimensions.
method Novel technique to prove lower bounds on embedding dimensions.
result Proves new lower bounds on embedding dimensions for Deep Sets and Janossy pooling.
A new neural network learns from acoustic scenes by suppressing irrelevant patterns.
problem Acoustic scenes are rich and redundant, making classification challenging.
method Spatio-temporal attention pooling layer coupled with a convolutional recurrent neural network.
result The method outperforms a strong convolutional neural network baseline and sets new state-of-the-art performance.
Deep convolutional networks can be understood through kernel methods, providing insights into their inductive bias.
problem Understanding the functional space and inductive bias of deep convolutional networks.
method Using kernel methods to analyze simple hierarchical kernels with convolution and pooling layers.
result The RKHS consists of additive models of interaction terms between patches, and pooling layers encourage spatial similarities.
NDP improves GNN efficiency by coarsening graphs without losing structure.
problem Efficiently summarize graph data for deep learning models.
method Node Decimation Pooling (NDP) reduces graph density while preserving topology.
result NDP achieves comparable performance to state-of-the-art pooling methods but with improved efficiency.
WavPool improves deep neural networks with wavelet-based pooling.
problem Improving efficiency and performance of deep neural networks.
method Introducing WavPool, a wavelet-transform-based pooling layer.
result WavPool outperforms existing network architectures by 10% on CIFAR-10.