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

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

来源：评论

学校读者我要写书评

暂无评论

A Tutorial on Movable Antennas for Wireless Networks

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Zhu, Lipeng Ma, Wenyan Mei, Weidong Zeng, Yong Wu, Qingqing Ning, Boyu Xiao, Zhenyu Shao, Xiaodan Zhang, Jun Zhang, Rui National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore National Key Laboratory of Wireless Communications Chengdu611731 China Southeast University National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and Security Nanjing210096 China Purple Mountain Laboratories Nanjing211111 China Shanghai Jiao Tong University Department of Electronic Engineering Shanghai200240 China Beihang University School of Electronic and Information Engineering Beijing100191 China University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada Beijing Institute of Technology State Key Laboratory of CNS/ATM Miit Key Laboratory of Complex-field Intelligent Sensing Beijing100081 China The Chinese University of HongKong School of Science and Engineering Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China

Movable antenna (MA) has been recognized as a promising technology to enhance the performance of wireless communication and sensing by enabling antenna movement. Such a significant paradigm shift from conventional fixed antennas (FAs) to MAs offers tremendous new opportunities towards realizing more versatile, adaptive and efficient next-generation wireless networks such as 6G. In this paper, we provide a comprehensive tutorial on the fundamentals and advancements in the area of MA-empowered wireless networks. First, we overview the historical development and contemporary applications of MA technologies. Next, to characterize the continuous variation in wireless channels with respect to antenna position and/or orientation, we present new field-response channel models tailored for MAs, which are applicable to narrowband and wideband systems as well as far-field and near-field propagation conditions. Subsequently, we review the state-of-the-art architectures for implementing MAs and discuss their practical constraints. A general optimization framework is then formulated to fully exploit the spatial degrees of freedom (DoFs) in antenna movement for performance enhancement in wireless systems. In particular, we delve into two major design issues for MA systems. First, we address the intricate antenna movement optimization problem for various communication and/or sensing systems to maximize the performance gains achievable by MAs. Second, we deal with the challenging channel acquisition issue in MA systems for reconstructing the channel mapping between arbitrary antenna positions inside the transmitter and receiver regions. Moreover, we show existing prototypes developed for MA-aided communication/sensing and the experimental results based on them. Finally, the extension of MA design to other wireless systems and its synergy with other emerging wireless technologies are discussed. We also highlight promising research directions in this area to inspire future investigatio

关键词： Antenna arrays

来源：评论

学校读者我要写书评

暂无评论

PSSPR: A Source Location Privacy Protection Scheme Based on Sector Phantom Routing in WSNs

PSSPR: A Source Location Privacy Protection Scheme Based on ...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Jing Sun Yuling Chen Tao Li Jia Liu Yixian Yang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Air Force Engineering University Xi'an China School of Cyberspace Security Beijing University of Posts and Telecommnuications Beijing China

ISBN: (纸本)9781665421751

Source location privacy, occupying an unshakable status in wireless sensor networks, has a profound influence on the widespread application of wireless sensor networks (WSNs). Most privacy policies that introduce phantom nodes to the source location have the problem that the transmission path between the phantom node and the source is not diversified enough, and the phantom node area is close to the source. For this reason, a source location privacy protection scheme based on sector domain phantom routing is proposed. The scheme uses the sector domain and the coordinates of the central node $V$ to increase the geographical position diversity of the phantom node, which completely avoids the visible and protects the security of the source location. Theoretical analysis and simulation results show that our scheme can enhance the security of source position.

关键词： Wireless communication Wireless sensor networks Privacy Simulation Phantoms Position measurement Routing

来源：评论

学校读者我要写书评

暂无评论

Learning Task-aware Robust Deep Learning Systems

arXiv

引用

arXiv 2020年

作者： Han, Keji Li, Yun Long, Xianzhong Ge, Yao Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing

Many works demonstrate that deep learning system is vulnerable to adversarial attack. A deep learning system consists of two parts: the deep learning task and the deep model. Nowadays, most existing works investigate the impact of the deep model on robustness of deep learning systems, ignoring the impact of the learning task. In this paper, we adopt the binary and interval label encoding strategy to redefine the classification task and design corresponding loss to improve robustness of the deep learning system. Our method can be viewed as improving the robustness of deep learning systems from both the learning task and deep model. Experimental results demonstrate that our learning task-aware method is much more robust than traditional classification while retaining the accuracy. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Review of Multimodal Explainable Artificial Intelligence: Past, Present and Future

arXiv

引用

arXiv 2024年

作者： Sun, Shilin An, Wenbin Tian, Feng Nan, Fang Liu, Qidong Liu, Jun Shah, Nazaraf Chen, Ping School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an710049 China Faculty of Electronic and Information Engineering Xi’an Jiaotong University Xi’an710049 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an710049 China Institute for Future Transport and Cities Coventry University Priory Street CoventryCV1 5FB United Kingdom Department of Engineering University of Massachusetts Boston BostonMA02125 United States

Artificial intelligence (AI) has rapidly developed through advancements in computational power and the growth of massive datasets. However, this progress has also heightened challenges in interpreting the "black-box" nature of AI models. To address these concerns, eXplainable AI (XAI) has emerged with a focus on transparency and interpretability to enhance human understanding and trust in AI decision-making processes. In the context of multimodal data fusion and complex reasoning scenarios, the proposal of Multimodal eXplainable AI (MXAI) integrates multiple modalities for prediction and explanation tasks. Meanwhile, the advent of Large Language Models (LLMs) has led to remarkable breakthroughs in natural language processing, yet their complexity has further exacerbated the issue of MXAI. To gain key insights into the development of MXAI methods and provide crucial guidance for building more transparent, fair, and trustworthy AI systems, we review the MXAI methods from a historical perspective and categorize them across four eras: traditional machine learning, deep learning, discriminative foundation models, and generative LLMs. We also review evaluation metrics and datasets used in MXAI research, concluding with a discussion of future challenges and directions. A project related to this review has been created at https://***/ShilinSun/mxai_review. Copyright © 2024, The Authors. All rights reserved.

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Domain generalization for document authentication against practical recapturing attacks

arXiv

引用

arXiv 2021年

作者： Chen, Changsheng Zhang, Shuzheng Lan, Fengbo Huang, Jiwu The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Recapturing attack can be employed as a simple but effective anti-forensic tool for digital document images. Inspired by the document inspection process that compares a questioned document against a reference sample, we proposed a document recapture detection scheme by employing Siamese network to compare and extract distinct features in a recapture document image. The proposed algorithm takes advantages of both metric learning and image forensic techniques. Instead of adopting Euclidean distance-based loss function, we integrate the forensic similarity function with a triplet loss and a normalized softmax loss. After training with the proposed triplet selection strategy, the resulting feature embedding clusters the genuine samples near the reference while pushes the recaptured samples apart. In the experiment, we consider practical domain generalization problems, such as the variations in printing/imaging devices, substrates, recapturing channels, and document types. To evaluate the robustness of different approaches, we benchmark some popular off-the-shelf machine learning-based approaches, a state-of-the-art document image detection scheme, and the proposed schemes with different network backbones under various experimental protocols. Experimental results show that the proposed schemes with different network backbones have consistently outperformed the state-of-the-art approaches under different experimental settings. Specifically, under the most challenging scenario in our experiment, i.e., evaluation across different types of documents that produced by different devices, we have achieved less than 5.00% APCER (Attack Presentation Classification Error Rate) and 5.56% BPCER (Bona Fide Presentation Classification Error Rate) by the proposed network with ResNeXt101 backbone at 5% BPCER decision *** Codes 94A08 Copyright © 2021, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based forgery attack on document images

arXiv

引用

arXiv 2021年

作者： Zhao, Lin Chen, Changsheng Huang, Jiwu the Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

With the ongoing popularization of online services, the digital document images have been used in various applications. Meanwhile, there have emerged some deep learning-based text editing algorithms which alter the textual information of an image in an end-to-end fashion. In this work, we present a low-cost document forgery algorithm by the existing deep learning-based technologies to edit practical document images. To achieve this goal, the limitations of existing text editing algorithms towards complicated characters and complex background are addressed by a set of network design strategies. First, the unnecessary confusion in the supervision data is avoided by disentangling the textual and background information in the source images. Second, to capture the structure of some complicated components, the text skeleton is provided as auxiliary information and the continuity in texture is considered explicitly in the loss function. Third, the forgery traces induced by the text editing operation are mitigated by some post-processing operations which consider the distortions from the print-and-scan channel. Quantitative comparisons of the proposed method and the exiting approach have shown the advantages of our design by reducing the about 2/3 reconstruction error measured in MSE, improving reconstruction quality measured in PSNR and in SSIM by 4 dB and 0.21, respectively. Qualitative experiments have confirmed that the reconstruction results of the proposed method are visually better than the existing approach in both complicated characters and complex texture. More importantly, we have demonstrated the performance of the proposed document forgery algorithm under a practical scenario where an attacker is able to alter the textual information in an identity document using only one sample in the target domain. The forged-and-recaptured samples created by the proposed text editing attack and recapturing operation have successfully fooled some existing document authenticat

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Algorithms Design and Implementation Based on Differential Privacy 3rd

Deep Learning Algorithms Design and Implementation Based on ...

引用

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

作者： Xu, Xuefeng Yao, Yanqing Cheng, Lei Key Laboratory of Aerospace Network Security Ministry of industry and information technology School of Cyberspace Science and Technology Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Beijing Key Laboratory of Network Technology Beihang University Beijing China Shenzhen Research Institute of Big Data Shenzhen518000 China

ISBN: (纸本)9783030622220

Deep learning models bear the risks of privacy leakage. Attackers can obtain sensitive information contained in training data with some techniques. However, existing differentially private methods such as Differential Privacy-Stochastic Gradient Descent (DP-SGD) and Differential Privacy-Generative Adversarial Network (DP-GAN) are not very efficient as they require to perform sampling multiple times. More importantly, DP-GAN algorithm need public data to set gradient clipping threshold. In this paper, we introduce our refined algorithms to tackle these problems. First, we employ random shuffling instead of random sampling to improve training efficiency. We also test Gaussian and Laplace Mechanisms for clipping gradients and injecting noise. Second, we employ zero Concentrated Differential Privacy (zCDP) to compute overall privacy budget. Finally, we adopt dynamical gradient clipping in DP-GAN algorithm. During each iteration, we random sample training examples and set the average gradients norm as the new threshold. This not only makes the algorithm more robust but also doesn’t increase the overall privacy budget. We experiment with our algorithms on MNIST data sets and demonstrate the accuracies. In our refined DP-SGD algorithm, we achieve test accuracy of 96.58%. In our refined DP-GAN algorithm, we adopt the synthetic data to train models and reach test accuracy of 91.64%. The results show that our approach ensures model usability and provides the capability of privacy protection. © 2020, Springer Nature Switzerland AG.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：