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

Generative AI for Deep Reinforcement Learning: Framework, Analysis, and Use Cases

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Mei, Fang Kang, Jiawen Du, Hongyang Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States

As a form of artificial intelligence (AI) technology based on interactive learning, deep reinforcement learning (DRL) has been widely applied across various fields and has achieved remarkable accomplishments. However, DRL faces certain limitations, including low sample efficiency and poor generalization. Therefore, we present how to leverage generative AI (GAI) to address these issues above and enhance the performance of DRL algorithms in this paper. We first introduce several classic GAI and DRL algorithms and demonstrate the applications of GAI-enhanced DRL algorithms. Then, we discuss how to use GAI to improve DRL algorithms from the data and policy perspectives. Subsequently, we introduce a framework that demonstrates an actual and novel integration of GAI with DRL, i.e., GAI-enhanced DRL. Additionally, we provide a case study of the framework on UAV-assisted integrated near-field/far-field communication to validate the performance of the proposed framework. Moreover, we present several future directions. Finally, the related code is available at: https://***/GAI-enhanced-DRL. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning

MagLive: Robust Voice Liveness Detection on Smartphones Using Magnetic Pattern Changes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Xiping Chen, Jing Wu, Cong He, Kun Xu, Haozhe Feng, Yebo Du, Ruiying Chen, Xianhao Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Rizhao Institute of Information Technology Wuhan University Rizhao276800 China School of Computer Science and Engineering Nanyang Technological University Singapore Collaborative Innovation Center of Geospatial Technology Wuhan430079 China The Department of Electrical and Electronic Engineering HKU Musketeers Foundation Institute of Data Science University of Hong Kong Pok Fu Lam Hong Kong

Voice authentication has been widely used on smartphones. However, it remains vulnerable to spoofing attacks, where the attacker replays recorded voice samples from authentic humans using loudspeakers to bypass the voice authentication system. In this paper, we present MagLive, a robust voice liveness detection scheme designed for smartphones to mitigate such spoofing attacks. MagLive leverages the differences in magnetic pattern changes generated by different speakers (i.e., humans or loudspeakers) when speaking for liveness detection, which are captured by the built-in magnetometer on smartphones. To extract effective and robust magnetic features, MagLive utilizes a TF-CNN-SAF model as the feature extractor, which includes a time-frequency convolutional neural network (TF-CNN) combined with a self-attention-based fusion (SAF) model. Supervised contrastive learning is then employed to achieve user-irrelevance, device-irrelevance, and content-irrelevance. MagLive imposes no additional burden on users and does not rely on active sensing or specialized hardware. We conducted comprehensive experiments with various settings to evaluate the security and robustness of MagLive. Our results demonstrate that MagLive effectively distinguishes between humans and attackers (i.e., loudspeakers), achieving an average balanced accuracy (BAC) of 99.01% and an equal error rate (EER) of 0.77%. Copyright © 2024, The Authors. All rights reserved.

关键词： Smartphones

Ready for emerging threats to recommender systems? A graph convolution-based generative shilling attack

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Fan Gao, Min Yu, Junliang Wang, Zongwei Liu, Kecheng Wang, Xu Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education Chongqing401331 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China School of Information Technology and Electrical Engineering The University of Queensland Queensland4072 Australia Informatics Research Centre Henley Business School University of Reading Berkshire ReadingRG6 6UD United Kingdom School of Mechanical Engineering Chongqing University Chongqing400044 China

To explore the robustness of recommender systems, researchers have proposed various shilling attack models and analyzed their adverse effects. Primitive attacks are highly feasible but less effective due to simplistic handcrafted rules, while upgraded attacks are more powerful but costly and difficult to deploy because they require more knowledge from recommendations. In this paper, we explore a novel shilling attack called Graph cOnvolution-based generative shilling ATtack (GOAT) to balance the attacks' feasibility and effectiveness. GOAT adopts the primitive attacks' paradigm that assigns items for fake users by sampling and the upgraded attacks' paradigm that generates fake ratings by a deep learning-based model. It deploys a generative adversarial network (GAN) that learns the real rating distribution to generate fake ratings. Additionally, the generator combines a tailored graph convolution structure that leverages the correlations between co-rated items to smoothen the fake ratings and enhance their authenticity. The extensive experiments on two public datasets evaluate GOAT's performance from multiple perspectives. Our study of the GOAT demonstrates technical feasibility for building a more powerful and intelligent attack model with a much-reduced cost, enables analysis the threat of such an attack and guides for investigating necessary prevention measures. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

Predicting Large-scale Protein-protein Interactions by Extracting Coevolutionary Patterns with MapReduce Paradigm

学校读者我要写书评

暂无评论

Predicting Large-scale Protein-protein Interactions by Extra...

IEEE International Conference on Systems, Man and Cybernetics

作者： Lun Hu Bo-Wei Zhao Shicheng Yang Xin Luo MengChu Zhou Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of Sciences Urumqi China School of Computer Science and Technology Wuhan University of Technology Wuhan China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China Hengrui (Chongqing) Artificial Intelligence Research Center Cloudwalk China New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781665442084

Protein-protein interactions are of great significance for us to understand the functional mechanisms of proteins. With the rapid development of high-throughput genomic technology, the amount of protein-protein interaction data has become so big that most of existing prediction algorithms are no longer applicable. To address this problem, we develop a distributed framework by reimplementing one of state-of-the-art algorithms, i.e., CoFex, by using MapReduce. In particular, we adopt a novel tree-based data structure to reduce the heavy memory consumption cased by the huge sequence information of proteins. After that, the procedure of CoFex is modified by following the paradigm of MapReduce such that the prediction task can be completed in a distributed manner, thus fulfilling the demanding requirements of large-scale protein-protein interaction prediction. A series of experiments have been conducted to evaluate the performance of the proposed distributed framework in terms of both efficiency and effectiveness. Experimental results demonstrate that the proposed framework can considerably improve the efficiency of CoFex by achieving more than two-orders-of-magnitude improvement in computational efficiency while retaining a comparable level of accuracy.

关键词： Proteins Memory management Genomics Predictive models Prediction algorithms data structures Computational efficiency

Uplink-downlink duality between multiple-access and broadcast channels with compressing relays

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Liang Liu, Ya-Feng Patil, Pratik Yu, Wei the Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong the State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Edward S. Rogers Sr. Department of Electrical and Computer Engineering the University of Toronto the Department of Statistics and Data Science and the Machine Learning Department Carnegie Mellon University PittsburghPA15213 United States The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto 10 King’s College Road TorontoONM5S3G4 Canada

—Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers;the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink. Copyright © 2020, The Authors. All rights reserved.

关键词： Linear programming

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

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

Not just privacy: Improving performance of private deep learning in mobile cloud

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wang, Ji Zhang, Jianguo Bao, Weidong Zhu, Xiaomin Cao, Bokai Yu, Philip S. College of Systems Engineering National University of Defense Technology Changsha China Department of Computer Science University of Illinois at Chicago Chicago United States College of Systems Engineering State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China Facebook Inc. Menlo Park United States Department of Computer Science University of Illinois at Chicago Chicago United States Institute for Data Science Tsinghua University Beijing China

The increasing demand for on-device deep learning services calls for a highly efficient manner to deploy deep neural networks (DNNs) on mobile devices with limited capacity. The cloud-based solution is a promising approach to enabling deep learning applications on mobile devices where the large portions of a DNN are offloaded to the cloud. However, revealing data to the cloud leads to potential privacy risk. To benefit from the cloud data center without the privacy risk, we design, evaluate, and implement a cloud-based framework Arden which partitions the DNN across mobile devices and cloud data centers. A simple data transformation is performed on the mobile device, while the resource-hungry training and the complex inference rely on the cloud data center. To protect the sensitive information, a lightweight privacy-preserving mechanism consisting of arbitrary data nullification and random noise addition is introduced, which provides strong privacy guarantee. A rigorous privacy budget analysis is given. Nonetheless, the private perturbation to the original data inevitably has a negative impact on the performance of further inference on the cloud side. To mitigate this influence, we propose a noisy training method to enhance the cloud-side network robustness to perturbed data. Through the sophisticated design, Arden can not only preserve privacy but also improve the inference performance. To validate the proposed Arden, a series of experiments based on three image datasets and a real mobile application are conducted. The experimental results demonstrate the effectiveness of Arden. Finally, we implement Arden on a demo system to verify its practicality. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

A Tent Lévy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Qinwen Gao, Yuelin Song, Yanjie School of Computer Science and Engineering North Minzu University Yinchuan750021 China School of Mathematics and Information Science North Minzu University Yinchuan750021 China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021 China Ningxia Province Cooperative Innovation Center of Scientific Computing and Intelligent in Formation Processing North Minzu University Yinchuan750021 China College of Systems Engineering National University of Defense Technology Changsha410073 China

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent Lévy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： COVID-19