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

arXiv 2023年

作者： Li, Yandi Guo, Jianxiong Li, Yupeng Wang, Tian Jia, Weijia Hong Kong Baptist University Hong Kong Guangdong Key Lab of AI and Multi-Modal Data Processing Department of Computer Science BNU-HKBU United International College Zhuhai519087 China Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Zhuhai519087 China Department of Interactive Media Hong Kong Baptist University Hong Kong

The multi-armed bandit (MAB) models have attracted significant research attention due to their applicability and effectiveness in various real-world scenarios such as resource allocation, online advertising, and dynamic pricing. As an important branch, the adversarial MAB problems with delayed feedback have been proposed and studied by many researchers recently where a conceptual adversary strategically selects the reward distributions associated with each arm to challenge the learning algorithm and the agent experiences a delay between taking an action and receiving the corresponding reward feedback. However, the existing models restrict the feedback to be generated from only one user, which makes models inapplicable to the prevailing scenarios of multiple users (e.g. ad recommendation for a group of users). In this paper, we consider that the delayed feedback results are from multiple users and are unrestricted on internal distribution. In contrast, the feedback delay is arbitrary and unknown to the player in advance. Also, for different users in a round, the delays in feedback have no assumption of latent correlation. Thus, we formulate an adversarial MAB problem with multi-user delayed feedback and design a modified EXP3 algorithm MUD-EXP3, which makes a decision at each round by considering the importance-weighted estimator of the received feedback from different users. On the premise of known terminal round index T, the number of users M, the number of arms N, and upper bound of delay dmax, we prove a regret of O(pTM2 ln N(Ne + 4dmax)). Furthermore, for the more common case of unknown T, an adaptive algorithm AMUD-EXP3 is proposed with a sublinear regret with respect to T. Finally, extensive experiments are conducted to indicate the correctness and effectiveness of our algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

A Scope Sensitive and Result Attentive Model for multi-Intent Spoken Language Understanding

arXiv

引用

arXiv 2022年

作者： Cheng, Lizhi Yang, Wenmian Jia, Weijia Shanghai Jiao Tong University Shanghai China Nanyang Technological University Singapore Singapore Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Guang Dong Zhuhai China

multi-Intent Spoken Language Understanding (SLU), a novel and more complex scenario of SLU, is attracting increasing attention. Unlike traditional SLU, each intent in this scenario has its specific scope. Semantic information outside the scope even hinders the prediction, which tremendously increases the difficulty of intent detection. More seriously, guiding slot filling with these inaccurate intent labels suffers error propagation problems, resulting in unsatisfied overall performance. To solve these challenges, in this paper, we propose a novel Scope-Sensitive Result Attention Network (SSRAN) based on Transformer, which contains a Scope Recognizer (SR) and a Result Attention Network (RAN). Scope Recognizer assignments scope information to each token, reducing the distraction of out-of-scope tokens. Result Attention Network effectively utilizes the bidirectional interaction between results of slot filling and intent detection, mitigating the error propagation problem. Experiments on two public datasets indicate that our model significantly improves SLU performance (5.4% and 2.1% on Overall accuracy) over the state-of-the-art baseline. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Look Closer to Your Enemy: Learning to Attack via Teacher-Student Mimicking

arXiv

引用

arXiv 2022年

作者： Wang, Mingjie Guo, Jianxiong Li, Sirui Xiao, Dingwen Tang, Zhiqing The Guangdong Key Lab of AI and Multi-Modal Data Processing Department of Computer Science BNU-HKBU United International College Zhuhai519087 China The Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China

Deep neural networks have significantly advanced person re-identification (ReID) applications in the realm of the industrial internet, yet they remain vulnerable. Thus, it is crucial to study the robustness of ReID systems, as there are risks of adversaries using these vulnerabilities to compromise industrial surveillance systems. Current adversarial methods focus on generating attack samples using misclassification feedback from victim models (VMs), neglecting VM’s cognitive processes. We seek to address this by producing authentic ReID attack instances through VM cognition decryption. This approach boasts advantages like better transferability to open-set ReID tests, easier VM misdirection, and enhanced creation of realistic and undetectable assault images. However, the task of deciphering the cognitive mechanism in VM is widely considered to be a formidable challenge. In this paper, we propose a novel inconspicuous and controllable ReID attack baseline, LCYE (Look Closer to Your Enemy), to generate adversarial query images. Specifically, LCYE first distills VM’s knowledge via teacher-student memory mimicking the proxy task. This knowledge prior serves as an unambiguous cryptographic token, encapsulating elements deemed indispensable and plausible by the VM, with the intent of facilitating precise adversarial misdirection. Further, benefiting from the multiple opposing task framework of LCYE, we investigate the interpretability and generalization of ReID models from the view of the adversarial attack, including cross-domain adaption, cross-model consensus, and online learning process. Extensive experiments on four ReID benchmarks show that our method outperforms other state-of-the-art attackers with a large margin in white-box, black-box, and target attacks. The source code can be found at https://***/MingjieWang0606/LCYE-attack_reid. Copyright © 2022, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Joint Task Scheduling and Container Image Caching in Edge Computing

arXiv

引用

arXiv 2023年

作者： Mou, Fangyi Tang, Zhiqing Lou, Jiong Guo, Jianxiong Wang, Wenhua Wang, Tian Institute of Artificial Intelligence and Future Networks Beijing Normal University China Department of Computer Science and Engineering Shanghai Jiao Tong University China Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College China

In Edge Computing (EC), containers have been increasingly used to deploy applications to provide mobile users services. Each container must run based on a container image file that exists locally. However, it has been conspicuously neglected by existing work that effective task scheduling combined with dynamic container image caching is a promising way to reduce the container image download time with the limited bandwidth resource of edge nodes. To fill in such gaps, in this paper, we propose novel joint Task Scheduling and Image Caching (TSIC) algorithms, specifically: 1) We consider the joint task scheduling and image caching problem and formulate it as a Markov Decision Process (MDP), taking the communication delay, waiting delay, and computation delay into consideration;2) To solve the MDP problem, a TSIC algorithm based on deep reinforcement learning is proposed with the customized state and action spaces and combined with an adaptive caching update algorithm. 3) A real container system is implemented to validate our algorithms. The experiments show that our strategy outperforms the existing baseline approaches by 23% and 35% on average in terms of total delay and waiting delay, respectively. Copyright © 2023, The Authors. All rights reserved.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Maximization in RISs-Assisted UAVs-Based Edge Computing Network Using Deep Reinforcement Learning

引用

Big data Mining and Analytics 2024年第4期7卷 1065-1083页

作者： Chuanwen Luo Jian Zhang Jianxiong Guo Yi Hong Zhibo Chen Shuyang Gu School of Information Science and Technology Beijing Forestry UniversityBeijing 100083Chinaand also with the Engineering Research Center for Forestry-Oriented Intelligent Information Processing of National Forestry and Grassland AdministrationBeijing 100083China Advanced Institute of Natural Sciences Beijing Normal UniversityZhuhai 519087Chinaand also with the Guangdong Key Lab of AI and Multi-Modal Data ProcessingBNU-HKBU United International CollegeZhuhai 519087China Department of Computer Information Systems Texas A&M University-Central TexasKilleenTX 76549USA

Edge Computing(EC)pushes computational capability to the Terrestrial Devices(TDs),providing more efficient and faster computing *** Aerial Vehicles(UAVs)equipped with EC servers can be flexibly deployed,even in complex terrains,to provide mobile computing services at all ***,UAVs can establish an air-to-ground line-of-sight link with TDs to improve the quality of communication ***,the UAV-to-TD link may be obstructed by ground obstacles such as buildings or trees,leading to sub-optimal data transmission *** surmount this issue,Reconfigurable Intelligent Surfaces(RISs)emerge as a promising technology capable of intelligently reflecting signals to enhance communication quality between UAVs and *** this paper,we consider the RISs-assisted multi-UAVs collaborative edge Computing Network(RUCN)in urban environment,in which we study the computational offloading *** goal is to maximize the overall energy efficiency of UAVs by jointly optimizing the flight duration and trajectories of UAVs,and the phase shifts of *** is worth noting that this problem has been formally established as ***,we propose the Deep Deterministic Policy Gradients based UAV Trajectory and RIS Phase shift optimization algorithm(UTRP-DDPG)to solve this complex optimization *** results of extensive numerical experiments show that the proposed algorithm outperforms the other benchmark algorithms under various parameter ***,the UTRP-DDPG algorithm improves the UAV energy efficiency by at least 2%compared to DQN algorithm.

关键词： edge computing computing offloading Unmanned Aerial Vehicle(UAV) Reconfigurable Intelligent Surface(RIS) deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Combinatorial resources auction in decentralized edge-thing systems using blockchain and differential privacy

arXiv

引用

arXiv 2021年

作者： Guo, Jianxiong Ding, Xingjian Jia, Weijia BNU-UIC Institute of Artificial Intelligence and Future Networks Beijing Normal University at Zhuhai Guangdong Zhuhai519087 China Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Guangdong Zhuhai519087 China School of Software Engineering Beijing University of Technology Beijing100124 China

With the continuous expansion of Internet of Things (IoT) devices, edge computing mode has emerged in recent years to overcome the shortcomings of traditional cloud computing mode, such as high delay, network congestion, and large resource consumption. Thus, edge-thing systems will replace the classic cloud-thing/cloud-edge-thing systems and become mainstream gradually, where IoT devices can offload their tasks to neighboring edge nodes. A common problem is how to utilize edge computing resources. For the sake of fairness, double auction can be used in the edge-thing system to achieve an effective resource allocation and pricing mechanism. Due to the lack of third-party management agencies and mutual distrust between nodes, in our edge-thing systems, we introduce blockchains to prevent malicious nodes from tampering with transaction records and smart contracts to act as an auctioneer to realize resources auction. Since the auction results stored in this blockchain-based system are transparent, they are threatened with inference attacks. Thus in this paper, we design a differentially private combinatorial double auction mechanism by exploring the exponential mechanism such that maximizing the revenue of edge computing platform, in which each IoT device requests a resource bundle and edge nodes compete with each other to provide resources. It can not only guarantee approximate truthfulness and high revenue, but also ensure privacy security. Through necessary theoretical analysis and numerical simulations, the effectiveness of our proposed mechanisms can be validated. Copyright © 2021, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Fed-Credit: Robust Federated Learning with Credibility Management

arXiv

引用

arXiv 2024年

作者： Chen, Jiayan Qian, Zhirong Meng, Tianhui Gao, Xitong Wang, Tian Jia, Weijia Beijing Normal University Zhuhai China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China Beijing Normal University Zhuhai and Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Beijing Normal University Zhuhai China

aiming at privacy preservation, Federated Learning (FL) is an emerging machine learning approach enabling model training on decentralized devices or data sources. The learning mechanism of FL relies on aggregating parameter updates from individual clients. However, this process may pose a potential security risk due to the presence of malicious devices. Existing solutions are either costly due to the use of compute-intensive technology, or restrictive for reasons of strong assumptions such as the prior knowledge of the number of attackers and how they attack. Few methods consider both privacy constraints and uncertain attack scenarios. In this paper, we propose a robust FL approach based on the credibility management scheme, called Fed-Credit. Unlike previous studies, our approach does not require prior knowledge of the nodes and the data distribution. It maintains and employs a credibility set, which weighs the historical clients’ contributions based on the similarity between the local models and global model, to adjust the global model update. The subtlety of Fed-Credit is that the time decay and attitudinal value factor are incorporated into the dynamic adjustment of the reputation weights and it boasts a computational complexity of o(n) (n is the number of the clients). We conducted extensive experiments on the MNIST and CIFAR-10 datasets under 5 types of attacks. The results exhibit superior accuracy and resilience against adversarial attacks, all while maintaining comparatively low computational complexity. Among these, on the Non-IID CIFAR-10 dataset, our algorithm exhibited performance enhancements of 19.5% and 14.5%, respectively, in comparison to the state-of-the-art algorithm when dealing with two types of data poisoning attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Collaborative Edge Service Placement for Maximizing QoS with Distributed data Cleaning 31

Collaborative Edge Service Placement for Maximizing QoS with...

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Liang, Yuzhu Wang, Wenhua Zheng, Xi Liu, Qin Wang, Liang Wang, Tian School of Artificial Intelligence Beijing Normal University Beijing100875 China School of Computing Macquarie University NSW2109 Australia College of Computer Science and Electronic Engineering Hunan University Changsha410082 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China BNU-UIC Institute of Artificial Intelligence and Future Networks Beijing Normal University Zhuhai519000 China BNU-HKBU United International College Guangdong Key Lab of Ai and Multi-Modal Data Processing Zhuhai519000 China

ISBN: (纸本)9798350399738

The proliferation of dirty data on Internet of Things (IoT) devices can undermine the accuracy of data-driven decision-making by affecting the distribution of original data. The Quality of Service (QoS) of data cleaning on these devices is heavily impacted by processing delay and accuracy. In this paper, we find that edge service placement is a key step aligned with data cleaning and consider the collaborative edge service placement with distributed data cleaning (SPDC) problem. To address this issue, we propose a novel distributed collaborative edge-based architecture that effectively balances the demands of storage, communication, computation, and load constraints. Experimental results show that the proposed approach significantly improves the accuracy of data cleaning by 0.31%-86.07% and reduces delay by 2.73%-58.71% compared to state-of-the-art baselines. © 2023 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning

arXiv

引用

arXiv 2022年

作者： Chen, Tiantian Yan, Siwen Guo, Jianxiong Wu, Weili The Department of Computer Science The University of Texas at Dallas RichardsonTX75080 United States The Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China The Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Zhuhai519087 China

aiming at selecting a small subset of nodes with maximum influence on networks, the Influence Maximization (IM) problem has been extensively studied. Since it is #P-hard to compute the influence spread given a seed set, the state-of-the-art methods, including heuristic and approximation algorithms, faced with great difficulties such as theoretical guarantee, time efficiency, generalization, etc. This makes it unable to adapt to large-scale networks and more complex applications. On the other side, with the latest achievements of Deep Reinforcement Learning (DRL) in artificial intelligence and other fields, lots of works have been focused on exploiting DRL to solve combinatorial optimization problems. Inspired by this, we propose a novel end-to-end DRL framework, ToupleGDD, to address the IM problem in this paper, which incorporates three coupled graph neural networks for network embedding and double deep Q-networks for parameters learning. Previous efforts to solve IM problem with DRL trained their models on subgraphs of the whole network, and then tested on the whole graph, which makes the performance of their models unstable among different networks. However, our model is trained on several small randomly generated graphs with a small budget, and tested on completely different networks under various large budgets, which can obtain results very close to IMM and better results than OPIM-C on several datasets, and shows strong generalization ability. Finally, we conduct a large number of experiments on synthetic and realistic datasets, and experimental results prove the effectiveness and superiority of our model. Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Joint Task Scheduling and Container Image Caching in Edge Computing

Joint Task Scheduling and Container Image Caching in Edge Co...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Fangyi Mou Zhiqing Tang Jiong Lou Jianxiong Guo Wenhua Wang Tian Wang Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College China Institute of Artificial Intelligence and Future Networks Beijing Normal University China Yunnan Key Laboratory of Software Engineering Kunming Yunnan China Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (数字)9798350358261

ISBN: (纸本)9798350358278

In Edge Computing (EC), containers have been increasingly used to deploy applications to provide mobile users services. Each container must run based on a container image file that exists locally. However, it has been conspicuously neglected by existing work that effective task scheduling combined with dynamic container image caching is a promising way to reduce the container image download time with the limited bandwidth resource of edge nodes. To fill in such gaps, in this paper, we propose novel joint Task Scheduling and Image Caching (TSIC) algorithms, specifically: 1) We consider the joint task scheduling and image caching problem and formulate it as a Markov Decision Process (MDP), taking the communication delay, waiting delay, and computation delay into consideration; 2) To solve the MDP problem, a TSIC algorithm based on deep reinforcement learning is proposed with the customized state and action spaces and combined with an adaptive caching update algorithm. 3) A real container system is implemented to validate our algorithms. The experiments show that our strategy outperforms the existing baseline approaches by 23% and 35% on average in terms of total delay and waiting delay, respectively.

关键词： Processor scheduling Computational modeling Markov decision processes Image edge detection Containers Dynamic scheduling Delays

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：