检索结果-内蒙古大学图书馆

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Ying Yuan, Ye Luo, Xin The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module;b) Building the residual connection and weighted representation propagation to obtain high representation capacity;and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

PointCA: Evaluating the Robustness of 3D Point Cloud Completion Models Against Adversarial Examples

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hu, Shengshan Zhang, Junwei Liu, Wei Hou, Junhui Li, Minghui Zhang, Leo Yu Jin, Hai Sun, Lichao School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China Cluster and Grid Computing Lab China National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Services Computing Technology and System Lab China City University of Hong Kong Hong Kong Deakin University Australia Lehigh University United States

Point cloud completion, as the upstream procedure of 3D recognition and segmentation, has become an essential part of many tasks such as navigation and scene understanding. While various point cloud completion models have demonstrated their powerful capabilities, their robustness against adversarial attacks, which have been proven to be fatally malicious towards deep neural networks, remains unknown. In addition, existing attack approaches towards point cloud classifiers cannot be applied to the completion models due to different output forms and attack purposes. In order to evaluate the robustness of the completion models, we propose PointCA, the first adversarial attack against 3D point cloud completion models. PointCA can generate adversarial point clouds that maintain high similarity with the original ones, while being completed as another object with totally different semantic information. Specifically, we minimize the representation discrepancy between the adversarial example and the target point set to jointly explore the adversarial point clouds in the geometry space and the feature space. Furthermore, to launch a stealthier attack, we innovatively employ the neighbourhood density information to tailor the perturbation constraint, leading to geometry-aware and distribution-adaptive modification for each point. Extensive experiments against different premier point cloud completion networks show that PointCA can cause a performance degradation from 77.9% to 16.7%, with the structure chamfer distance kept below 0.01. We conclude that existing completion models are severely vulnerable to adversarial examples, and state-of-the-art defenses for point cloud classification will be partially invalid when applied to incomplete and uneven point cloud data. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep neural networks

PreZ-DGGAN: A Drug Graph GAN Based on Pre-Learning of Implicit Variables 2nd

学校读者我要写书评

暂无评论

PreZ-DGGAN: A Drug Graph GAN Based on Pre-Learning of Implic...

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Liu, Yixin Fan, Yueqin Li, Zhipeng Zhang, Qinhu Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China School of Mechanical Engineering Guangxi University Nanning530004 China Ningbo Institute of Digital Twin Eastern Institute of Technology Ningbo315201 China Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology School of Medicine Shanghai East Hospital Tongji University Shanghai200123 China College of Advanced Agricultural Sciences Zhejiang Agriculture and Forestry University Hangzhou311300 China

ISBN: (纸本)9789819619061

In the field of drug discovery and development, deep learning techniques have become a powerful tool to accelerate the discovery and development of new drugs. In the design and optimization of lead molecules, generative adversarial network and graph neural network are one of the prime techniques for accelerating research and development, because the former is based on the idea of two-player game to learn drug features to generate effective molecules, while the unstructured inputs of the latter are well-suited for the analysis of molecular data. Therefore, this study develops a new graph generative adversarial model, called PreZ-DGGAN, by inserting the graph neural network layer into the generative adversarial network. Within PreZ-DGGAN, the latent variable input of the generator is pre-learned by an improved graph variational autoencoder, which effectively avoids the mode collapse of the generative adversarial network, whereas the hidden layer of the discriminator is graph neural network layer, which is able to better learn the real molecules and judge the generated molecules as true or false. Experiments on two molecule datasets show that the molecules generated by PreZ-DGGAN have higher validity (100% on average) and uniqueness (91.5% on average), and the generated molecules are more diverse in structure. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

EEGMatch: Learning with Incomplete Labels for Semi-Supervised EEG-based Cross-Subject Emotion Recognition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhou, Rushuang Ye, Weishan Zhang, Zhiguo Luo, Yanyang Zhang, Li Li, Linling Huang, Gan Dong, Yining Zhang, Yuan-Ting Liang, Zhen The School of Biomedical Engineering Medical School Shenzhen University Shenzhen518060 China The Guangdong Provincial Key Laboratory of Biomedical Measurements and Ultrasound Imaging Shenzhen518060 China Department of Biomedical Engineering City University of Hong Kong Hong Kong Hong Kong Science and Technology Park Hong Kong Institute of Computing and Intelligence Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory Shenzhen China School of Data Science City University of Hong Kong Hong Kong Science and Technology Park Hong Kong

Electroencephalography (EEG) is an objective tool for emotion recognition and shows promising performance. However, the label scarcity problem is a main challenge in this field, which limits the wide application of EEG-based emotion recognition. In this paper, we propose a novel semi-supervised transfer learning framework (EEGMatch) to leverage both labeled and unlabeled EEG data. First, an EEG-Mixup based data augmentation method is developed to generate more valid samples for model learning. Second, a semi-supervised two-step pairwise learning method is proposed to bridge prototype-wise and instance-wise pairwise learning, where the prototype-wise pairwise learning measures the global relationship between EEG data and the prototypical representation of each emotion class and the instance-wise pairwise learning captures the local intrinsic relationship among EEG data. Third, a semi-supervised multi-domain adaptation is introduced to align the data representation among multiple domains (labeled source domain, unlabeled source domain, and target domain), where the distribution mismatch is alleviated. Extensive experiments are conducted on two benchmark databases (SEED and SEED-IV) under a cross-subject leave-one-subject-out cross-validation evaluation protocol. The results show the proposed EEGMatch performs better than the state-of-the-art methods under different incomplete label conditions (with 6.89% improvement on SEED and 1.44% improvement on SEED-IV), which demonstrates the effectiveness of the proposed EEGMatch in dealing with the label scarcity problem in emotion recognition using EEG signals. The source code is available at https://***/KAZABANA/EEGMatch. Copyright © 2023, The Authors. All rights reserved.

关键词： Self-supervised learning

Multi-objective Optimization for Multi-UAV-assisted Mobile Edge computing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Wang, Yixian Sun, Zemin Wu, Qingqing Kang, Jiawen Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China School of Automation Guangdong University of Technology Guangzhou510006 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Recent developments in unmanned aerial vehicles (UAVs) and mobile edge computing (MEC) have provided users with flexible and resilient computing services. However, meeting the computing-intensive and latency-sensitive demands of users poses a significant challenge due to the limited resources of UAVs. To address this challenge, we present a multi-objective optimization approach for multi-UAV-assisted MEC systems. First, we formulate a multi-objective optimization problem aiming at minimizing the total task completion delay, reducing the total UAV energy consumption, and maximizing the total amount of offloaded tasks by jointly optimizing task offloading, computation resource allocation, and UAV trajectory control. Since the problem is a mixed-integer non-linear programming (MINLP) and NP-hard problem which is challenging, we propose a joint task offloading, computation resource allocation, and UAV trajectory control (JTORATC) approach to solve the problem. However, since the decision variables of task offloading, computation resource allocation, and UAV trajectory control are coupled with each other, the original problem is split into three sub-problems, i.e., task offloading, computation resource allocation, and UAV trajectory control, which are solved individually to obtain the corresponding decisions. Moreover, the sub-problem of task offloading is solved by using distributed splitting and threshold rounding methods, the sub-problem of computation resource allocation is solved by adopting the Karush-Kuhn-Tucker (KKT) method, and the sub-problem of UAV trajectory control is solved by employing the successive convex approximation (SCA) method. Simulation results show that the proposed JTORATC has superior performance compared to the other benchmark methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

Opara: Exploiting Operator Parallelism for Expediting DNN Inference on GPUs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Aodong Xu, Fei Han, Li Dong, Yuan Chen, Li Zhou, Zhi Liu, Fangming The Shanghai Key Laboratory of Multidimensional Information Processing School of Computer Science and Technology East China Normal University 3663 N. Zhongshan Road Shanghai200062 China The School of Software Engineering East China Normal University 3663 N. Zhongshan Road Shanghai200062 China The School of Computing and Informatics University of Louisiana at Lafayette 301 East Lewis Street LafayetteLA70504 United States The Guangdong Key Laboratory of Big Data Analysis and Processing School of Computer Science and Engineering Sun Yat-sen University 132 E. Waihuan Road Guangzhou510006 China Peng Cheng Laboratory Huazhong University of Science and Technology China

GPUs have become the defacto hardware devices for accelerating Deep Neural Network (DNN) inference workloads. However, the conventional sequential execution mode of DNN operators in mainstream deep learning frameworks cannot fully utilize GPU resources, even with the operator fusion enabled, due to the increasing complexity of model structures and a greater diversity of operators. Moreover, the inadequate operator launch order in parallelized execution scenarios can lead to GPU resource wastage and unexpected performance interference among operators. In this paper, we propose Opara, a resource- and interference-aware DNN Operator parallel scheduling framework to accelerate DNN inference on GPUs. Specifically, Opara first employs CUDA Streams and CUDA Graph to parallelize the execution of multiple operators automatically. To further expedite DNN inference, Opara leverages the resource demands of operators to judiciously adjust the operator launch order on GPUs, overlapping the execution of compute-intensive and memory-intensive operators. We implement and open source a prototype of Opara based on PyTorch in a non-intrusive manner. Extensive prototype experiments with representative DNN and Transformer-based models demonstrate that Opara outperforms the default sequential CUDA Graph in PyTorch and the state-of-the-art operator parallelism systems by up to 1.68× and 1.29×, respectively, yet with acceptable runtime overhead. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

Spiking Neural Networks for Temporal Processing: Status Quo and Future Prospects

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Ma, Chenxiang Chen, Xinyi Li, Yanchen Yang, Qu Wu, Yujie Li, Guoqi Pan, Gang Tang, Huajin Tan, Kay Chen Wu, Jibin Department of Data Science and Artificial Intelligence The Hong Kong Polytechnic University Hong Kong Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore Institute of Automation Chinese Academy of Sciences Beijing100045 China State Key Laboratory of Brain-Machine Intelligence College of Computer Science and Technology MOE Frontier Science Center for Brain Science and Brain-Machine Integration Zhejiang University Hangzhou310027 China

Temporal processing is fundamental for both biological and artificial intelligence systems, as it enables the comprehension of dynamic environments and facilitates timely responses. Spiking Neural Networks (SNNs) excel in handling such data with high efficiency, owing to their rich neuronal dynamics and sparse activity patterns. Given the recent surge in the development of SNNs, there is an urgent need for a comprehensive evaluation of their temporal processing capabilities. In this paper, we first conduct an in-depth assessment of commonly used neuromorphic benchmarks, revealing critical limitations in their ability to evaluate the temporal processing capabilities of SNNs. To bridge this gap, we further introduce a benchmark suite consisting of three temporal processing tasks characterized by rich temporal dynamics across multiple timescales. Utilizing this benchmark suite, we perform a thorough evaluation of recently introduced SNN approaches to elucidate the current status of SNNs in temporal processing. Our findings indicate significant advancements in recently developed spiking neuron models and neural architectures regarding their temporal processing capabilities, while also highlighting a performance gap in handling long-range dependencies when compared to state-of-the-art non-spiking models. Finally, we discuss the key challenges and outline potential avenues for future research. Copyright © 2025, The Authors. All rights reserved.

关键词： Spatio-temporal data