Graph Neural Networks (GNNs) have achieved strong performance across a range of graph representation learning tasks, yet their adversarial robustness in graph classification remains underexplored compared to node classification. While most existing defenses focus on the message-passing component, this work investigates the overlooked role of pooling operations in shaping robustness. We present a theoretical analysis of standard flat pooling methods (sum, average and max), deriving upper bounds on their adversarial risk and identifying their vulnerabilities under different attack scenarios and graph structures. Motivated by these insights, we propose \textit{Robust Singular Pooling (RS-Pool)}, a novel pooling strategy that leverages the dominant singular vector of the node embedding matrix to construct a robust graph-level representation. We theoretically investigate the robustness of RS-Pool and interpret the resulting bound leading to improved understanding of our proposed pooling operator. While our analysis centers on Graph Convolutional Networks (GCNs), RS-Pool is model-agnostic and can be implemented efficiently via power iteration. Empirical results on real-world benchmarks show that RS-Pool provides better robustness than the considered pooling methods when subject to state-of-the-art adversarial attacks while maintaining competitive clean accuracy. Our code is publicly available at:\href{https://github.com/king/rs-pool}{https://github.com/king/rs-pool}.
Enhancing Satellite Object Localization with Dilated Convolutions and Attention-aided Spatial Pooling
Department of Information Systems, University of Maryland, Baltimore County（信息系统系，马里兰大学巴尔的摩分校）；Department of Physics, Catholic University of America（物理系，天主教美国大学）；NASA Goddard Space Flight Center（NASA戈达德空间飞行中心）
Pooling is an essential component of a wide variety of sentence representation and embedding models. This paper explores generalized pooling methods to enhance sentence embedding. We propose vector-based multi-head attention that includes the widely used max pooling, mean pooling, and scalar self-attention as special cases. The model benefits from properly designed penalization terms to reduce redundancy in multi-head attention. We evaluate the proposed model on three different tasks: natural language inference (NLI), author profiling, and sentiment classification. The experiments show that th…
In recent years, the fast rise in number of studies on graph neural network (GNN) has put it from the theories research to reality application stage. Despite the encouraging performance achieved by GNN, less attention has been paid to the privacy-preserving training and inference over distributed graph data in the related literature. Due to the particularity of graph structure, it is challenging to extend the existing private learning framework to GNN. Motivated by the idea of split learning, we propose a \textbf{S}erver \textbf{A}ided \textbf{P}rivacy-preserving \textbf{GNN} (SAPGNN) for the …
Enhancing Hyperspace Analogue to Language (HAL) Representations via Attention-Based Pooling for Text Classification
Undergraduate Students, Department of Computer and Automatic Control Engineering, Faculty of Mechanical and Electrical Engineering, Lattakia University（本科生，计算机与自动控制工程系，机械与电气工程学院，拉塔基亚大学）
MaxPoolBERT: Enhancing BERT Classification via Layer- and Token-Wise Aggregation
Heinrich Heine University Düsseldorf（海因里希·海涅大学多特蒙德分校）；Lamarr Institute for Machine Learning and AI（拉马尔机器学习与人工智能研究所）；Technical University Dortmund（技术大学多特蒙德）
Enhancing Robustness of Human Detection Algorithms in Maritime SAR through Augmented Aerial Images to Simulate Weather Conditions
Jakarta Intercultural School（雅加达国际学校）；Busan Foreign School（釜山外国语学校）；SMPK 8 Penabur Tanjung Duren（丹戎杜伦佩纳布尔8号初中（基督教学校））；Avon High School（雅芳高中）；Algoverse AI Research（Algoverse人工智能研究院）
Enhancing Cloud Network Resilience via a Robust LLM-Empowered Multi-Agent Reinforcement Learning Framework
State Key Laboratory of Mathematical Engineering and Advanced Computing（数学工程与先进计算国家重点实验室）；Henan Key Laboratory of Information Security（河南省信息安全重点实验室）；National Engineering Research Center for Mobile Network Technologies（移动网络技术国家工程研究中心）；Beijing University of Posts and Telecommunications（北京邮电大学）；Institute of Information Engineering, Chinese Academy of Sciences（中国科学院信息工程研究所）
Data to Decisions Cooperative Research Centre（数据决策合作研究中心）
Extracting textual features from tweets is a challenging process due to the noisy nature of the content and the weak signal of most of the words used. In this paper, we propose using singular value decomposition (SVD) with clustering to enhance the signals of the textual features in the tweets to improve the correlation with events. The proposed technique applies SVD to the time series vector for each feature to factorize the matrix of feature/day counts, in order to ensure the independence of the feature vectors. Afterwards, the k-means clustering is applied to build a look-up table that maps…
