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

Attention-Weighted Federated Deep Reinforcement Learning for Device-to-Device Assisted Heterogeneous Collaborative Edge Caching

学校读者我要写书评

暂无评论

Attention-Weighted Federated Deep Reinforcement Learning for...

作者： Wang, Xiaofei Li, Ruibin Wang, Chenyang Li, Xiuhua Taleb, Tarik Leung, Victor C. M. College of Intelligence and Computing Tianjin University Tianjin China Ministry of Education China Department of Communications and Networking School of Electrical Engineering Aalto University Espoo Finland College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Information Technology and Electrical Engineering Oulu University Oulu90570 Finland Department of Computer and Information Security Sejong University Seoul05006 Korea Republic of Department of Electrical and Computer Engineering The University of British Columbia VancouverBCV6T 1Z4 Canada

In order to meet the growing demands for multimedia service access and release the pressure of the core network, edge caching and device-to-device (D2D) communication have been regarded as two promising techniques in next generation mobile networks and beyond. However, most existing related studies lack consideration of effective cooperation and adaptability to the dynamic network environments. In this article, based on the flexible trilateral cooperation among user equipment, edge base stations and a cloud server, we propose a D2D-assisted heterogeneous collaborative edge caching framework by jointly optimizing the node selection and cache replacement in mobile networks. We formulate the joint optimization problem as a Markov decision process, and use a deep Q-learning network to solve the long-term mixed integer linear programming problem. We further design an attention-weighted federated deep reinforcement learning (AWFDRL) model that uses federated learning to improve the training efficiency of the Q-learning network by considering the limited computing and storage capacity, and incorporates an attention mechanism to optimize the aggregation weights to avoid the imbalance of local model quality. We prove the convergence of the corresponding algorithm, and present simulation results to show the effectiveness of the proposed AWFDRL framework in reducing average delay of content access, improving hit rate and offloading traffic. © 1983-2012 IEEE.

关键词： Reinforcement learning

Expedited Block Transmission in Blockchain Network by using Clusters

学校读者我要写书评

暂无评论

Expedited Block Transmission in Blockchain Network by using ...

IEEE International Conference on Systems, Man and Cybernetics

作者： Xiaoqi Hua Jian Chen Peiyun Zhang Zhangjie Fu Haibin Zhu Kezhong Lu Jigang Ren School of Software Nanjing University of Information Science and Technology Nanjing China Engineering Research Center of Digital Forensics of Ministry of Education and the School of Computer Science Nanjing University of Information Science and Technology Nanjing China School of Computer Science Nanjing University of Information Science and Technology Nanjing China Department of Computer Science and Mathematics Nipissing University North Bay ON Canada School of Big Data and Artificial Intelligence Chizhou University Chizhou China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Blockchain technology has garnered increasing attention from researchers. Because blockchain systems may contain malicious or spatially limited nodes that may delay block verification and reduce block transmission rate, this work proposes a block transmission model by designing and using special clusters. This work proposes the cluster formation and selection mechanisms. Nodes are grouped into clusters in a blockchain, and clusters with high fitness values are chosen to transmit blocks by calculating their trust values and block transmission rates. The proposed method is compared with the peers: Layer-Chain, BlockP2P-EP and RNS. According to experimental findings, the proposed method is superior to its peers regarding the time needed for block synchronization and transmission, block occupation storage ratio, transaction throughput, and block transmission success ratio.

关键词： Throughput Blockchains Peer-to-peer computing Delays Synchronization Cybernetics

Quantized Federated Learning under Transmission Delay and Outage Constraints

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Yanmeng Xu, Yanqing Shi, Qingjiang Chang, Tsung-Hui The School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China The Shenzhen Research Institute of Big Data Shenzhen518172 China The School of Software Engineering Tongji University Shanghai201804 China

Federated learning (FL) has been recognized as a viable distributed learning paradigm which trains a machine learning model collaboratively with massive mobile devices in the wireless edge while protecting user privacy. Although various communication schemes have been proposed to expedite the FL process, most of them have assumed ideal wireless channels which provide reliable and lossless communication links between the server and mobile clients. Unfortunately, in practical systems with limited radio resources such as constraint on the training latency and constraints on the transmission power and bandwidth, transmission of a large number of model parameters inevitably suffers from quantization errors (QE) and transmission outage (TO). In this paper, we consider such non-ideal wireless channels, and carry out the first analysis showing that the FL convergence can be severely jeopardized by TO and QE, but intriguingly can be alleviated if the clients have uniform outage probabilities. These insightful results motivate us to propose a robust FL scheme, named FedTOE, which performs joint allocation of wireless resources and quantization bits across the clients to minimize the QE while making the clients have the same TO probability. Extensive experimental results are presented to show the superior performance of FedTOE for deep learning-based classification tasks with transmission latency constraints. Copyright © 2021, The Authors. All rights reserved.

关键词： Outages

AutoMix: Mixup Networks for Sample Interpolation via Cooperative Barycenter Learning 16th

学校读者我要写书评

暂无评论

AutoMix: Mixup Networks for Sample Interpolation via Coopera...

16th European Conference on Computer Vision, ECCV 2020

作者： Zhu, Jianchao Shi, Liangliang Yan, Junchi Zha, Hongyuan School of Software Engineering East China Normal University Shanghai China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9783030586065

This paper proposes new ways of sample mixing by thinking of the process as generation of barycenter in a metric space for data augmentation. First, we present an optimal-transport-based mixup technique to generate Wasserstein barycenter which works well on images with clean background and is empirically shown complementary to existing mixup methods. Then we generalize mixup to an AutoMix technique by using a learnable network to fit barycenter in a cooperative way between the classifier (a.k.a. discriminator) and generator networks. Experimental results on both multi-class and multi-label prediction tasks show the efficacy of our approach, which is also verified in the presence of unseen categories (open set) and noise. © 2020, Springer Nature Switzerland AG.

关键词： Image classification

Multi-modal Multi-kernel Graph Learning for Autism Prediction and Biomarker Discovery

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liu, Jin Mao, Junbin Lin, Hanhe Kuang, Hulin Pan, Shirui Wu, Xusheng Xie, Shan Liu, Fei Pan, Yi Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Xinjiang Engineering Research Center of Big Data and Intelligent Software School of software Xinjiang University Wulumuqi830000 China Hunan Province Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Science and Engineering University of Dundee DundeeDD1 4HN United Kingdom School of Information and Communication Technology Griffith University Gold CoastQLD4215 Australia Shenzhen Health Development Research and Data Management Center Shenzhen518109 China

Graph learning-based multi-modal integration and classification is one of the most challenging tasks for disease prediction. To effectively offset the negative impact among modalities in the process of multi-modal integration and heterogeneous information extractions from graphs, we propose a novel method called Multi-modal Multi-Kernel Graph Learning (MMKGL). To solve the problem of negative impact among modalities, we propose a multi-modal graph embedding module to construct a multi-modal graph. Different from conventional methods that manually construct static graphs for all modalities, each modality generates a separate graph by adaptive learning, where a function graph and a supervision graph are introduced for optimization during the multi-graph fusion embedding process. We then propose a multi-kernel graph learning module to extract heterogeneous information from the multi-modal graph. The information in the multi-modal graph at different levels is aggregated by convolutional kernels with different receptive field sizes, followed by generating a cross-kernel discovery tensor for disease prediction. Our method is evaluated on the benchmark Autism Brain Imaging data Exchange (ABIDE) dataset and outperforms the state-of-the-art methods. In addition, discriminative brain regions associated with autism are identified by our model, providing guidance for the study of autism pathology. The source code will be available at https://***/yutian0315/MMKGL. © 2023, CC BY-NC-ND.

关键词： Graph embeddings

MTGAN: Mask and Texture-driven Generative Adversarial Network for Lung Nodule Segmentation

学校读者我要写书评

暂无评论

MTGAN: Mask and Texture-driven Generative Adversarial Networ...

International Conference on Pattern Recognition

作者： Wei Chen Qiuli Wang Kun Wang Dan Yang Xiaohong Zhang Chen Liu Yucong Li School of Big Data and Software Engineering Chongqing University Chongqing China The First Affiliated Hospital of Army Medical University Chongqing China Chongqing University Cancer Hospital Chongqing China

Accurate segmentation for lung nodules in lung computed tomography (CT) scans plays a key role in the early diagnosis of lung cancer. Many existing methods, especially U-Net, have made significant progress in lung nodule segmentation. However, due to the complex shapes of lung nodules and the similarity of visual characteristics between nodules and lung tissues, an accurate segmentation with low false positives of lung nodules is still a challenging problem. Considering the fact that both boundary and texture information of lung nodules are important for obtaining an accurate segmentation result, we propose a novel Mask and Texture-driven Generative Adversarial Network (MTGAN) with a joint multi-scale L1 loss for lung nodule segmentation, which takes full advantages of U-Net and adversarial training. The proposed MTGAN leverages adversarial learning strategy guided by the boundary and texture information of lung nodules to generate more accurate segmentation results with lesser false positives. We validate our model with the LIDC-IDRI dataset, and experimental results show that our method achieves excellent segmentation results for a variety of lung nodules, especially for juxtapleural nodules and low-dense nodules. Without any bells and whistles, the proposed MTGAN achieves significant segmentation performance with the Dice similarity coefficient (DSC) of 85.24% on the LIDC-IDRI dataset.

关键词： Training Visualization Shape Computed tomography Lung Lung cancer Benchmark testing

Fog Server Placement for Multimodality data Fusion in Neuroimaging 3rd

学校读者我要写书评

暂无评论

Fog Server Placement for Multimodality Data Fusion in Neuroi...

3rd International Conference on Machine Learning for Cyber Security, ML4CS 2020

作者： Yan, Xuan Xu, Xiaolong Zheng, Yu Dai, Fei School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Engineering Research Center of Digital Forensics Ministry of Education Nanjing China School of Big Data and Intelligence Engineering Southwest Forestry University KunmingYunnan China

ISBN: (纸本)9783030622220

Since the findings of the single modality data are unable to provide sufficient sensitivity and specificity for diagnostic measures, multimodality data fusion is adopted in the neuroimaging to detect the important differences between patients and healthy people. Applying fog computing contributes to reducing the redundant modality data transmission and processing brought by the multimodality data fusion. Due to the budget, the scale and the storage space of the fog servers are limited. What’s more, the proper location of the fog servers depends on the distribution of the data fusion points and the detailed contents of the data fusion tasks. Therefore, a fog server placement strategy for multimodality data fusion in neuroimaging, named FSPF, is put forward to determine the proper scale and location of the fog servers. Technically, the performance of the fog server location is evaluated by the data fusion time and the hit rate. Then, non-dominated sorting genetic algorithm-III (NSGA-III) is adopted in FSPF to obtain the proper solutions of the next generation and a reference solution is applied to optimize the initial population of the evolution. Finally, adequate experiments have been conducted to testify the efficiency and reliability of our method. © 2020, Springer Nature Switzerland AG.

关键词： Fog

Pre-training for ad-hoc retrieval: Hyperlink is also you need

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Zhengyi Dou, Zhicheng Xu, Wei Zhang, Xinyu Jiang, Hao Cao, Zhao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Beijing China Distributed and Parallel Software Lab Huawei Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

Designing pre-training objectives that more closely resemble the downstream tasks for pre-trained language models can lead to better performance at the fine-tuning stage, especially in the ad-hoc retrieval area. Existing pre-training approaches tailored for IR tried to incorporate weak supervised signals, such as query-likelihood based sampling, to construct pseudo query-document pairs from the raw textual corpus. However, these signals rely heavily on the sampling method. For example, the query likelihood model may lead to much noise in the constructed pre-training data. In this paper, we propose to leverage the large-scale hyperlinks and anchor texts to pre-train the language model for ad-hoc retrieval. Since the anchor texts are created by webmasters and can usually summarize the target document, it can help to build more accurate and reliable pre-training samples than a specific algorithm. Considering different views of the downstream ad-hoc retrieval, we devise four pre-training tasks based on the hyperlinks. We then pre-train the Transformer model to predict the pair-wise preference, jointly with the Masked Language Model objective. Experimental results on two large-scale ad-hoc retrieval datasets show the significant improvement of our model compared with the existing methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Hypertext systems

Model-enhanced Vector Index

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Hailin Wang, Yujing Chen, Qi Chang, Ruiheng Zhang, Ting Miao, Ziming Hou, Yingyan Ding, Yang Miao, Xupeng Wang, Haonan Pang, Bochen Zhan, Yuefeng Sun, Hao Deng, Weiwei Zhang, Qi Yang, Fan Xie, Xing Yang, Mao Cui, Bin School of Computer Science Key Lab of High Confidence Software Technologies Peking University China Microsoft United States Aerospace Information Research Institute Key Laboratory of Target Cognition and Application Technology Chinese Academy of Sciences China Institute of Information Engineering Chinese Academy of Sciences China Carnegie Mellon University United States National University of Singapore Singapore National Engineering Laboratory for Big Data Analysis and Applications Peking University China

Embedding-based retrieval methods construct vector indices to search for document representations that are most similar to the query representations. They are widely used in document retrieval due to low latency and decent recall performance. Recent research indicates that deep retrieval solutions offer better model quality, but are hindered by unacceptable serving latency and the inability to support document updates. In this paper, we aim to enhance the vector index with endto- end deep generative models, leveraging the differentiable advantages of deep retrieval models while maintaining desirable serving efficiency. We propose Modelenhanced Vector Index (MEVI), a differentiable model-enhanced index empowered by a twin-tower representation model. MEVI leverages a Residual Quantization (RQ) codebook to bridge the sequence-to-sequence deep retrieval and embeddingbased models. To substantially reduce the inference time, instead of decoding the unique document ids in long sequential steps, we first generate some semantic virtual cluster ids of candidate documents in a small number of steps, and then leverage the well-adapted embedding vectors to further perform a fine-grained search for the relevant documents in the candidate virtual clusters. We empirically show that our model achieves better performance on the commonly used academic benchmarks MSMARCO Passage and Natural Questions, with comparable serving latency to dense retrieval solutions. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings