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

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

学校读者我要写书评

暂无评论

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

A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yandi Gao, Haobo Gao, Yunxuan Guo, Jianxiong Wu, Weili Department of Computer Science BNU-HKBU United International College China Advanced Institute of Natural Sciences Beijing Normal University China Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College China Department of Computer Science The University of Texas Dallas United States

Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely used in mobile networks, social computing, and recommendation systems. It aims at selecting a small number of users such that maximizing the influence spread across the online social network. Because of its potential commercial and academic value, there are a lot of researchers focusing on studying the IM problem from different perspectives. The main challenge comes from the NP-hardness of the IM problem and #P-hardness of estimating the influence spread, thus traditional algorithms for overcoming them can be categorized into two classes: heuristic algorithms and approximation algorithms. However, there is no theoretical guarantee for heuristic algorithms, and the theoretical design is close to the limit. Therefore, it is almost impossible to further optimize and improve their performance. With the rapid development of artificial intelligence, the technology based on Machine Learning (ML) has achieved remarkable achievements in many fields. In view of this, in recent years, a number of new methods have emerged to solve combinatorial optimization problems by using ML-based techniques. These methods have the advantages of fast solving speed and strong generalization ability to unknown graphs, which provide a brand-new direction for solving combinatorial optimization problems. Therefore, we abandon the traditional algorithms based on iterative search and review the recent development of ML-based methods, especially Deep Reinforcement Learning, to solve the IM problem and other variants in social networks. We focus on summarizing the relevant background knowledge, basic principles, common methods, and applied research. Finally, the challenges that need to be solved urgently in future IM research are pointed out. Copyright © 2022, The Authors. All rights reserved.

关键词： Combinatorial optimization

NavCoT: Boosting LLM-Based vision-and-Language Navigation via Learning Disentangled Reasoning

学校读者我要写书评

暂无评论

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5945-5957页

作者： Bingqian Lin Yunshuang Nie Ziming Wei Jiaqi Chen Shikui Ma Jianhua Han Hang Xu Xiaojun Chang Xiaodan Liang Shenzhen Campus Sun Yat-sen University Shenzhen China Shanghai Jiao Tong University Shanghai China University of Hong Kong Pok Fu Lam Hong Kong Dataa Robotics Company Beijing China Huawei Noah's Ark Lab Shanghai China School of Information Science and Technology University of Science and Technology of China Hefei China Department of Computer Vision Mohamed bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi UAE Peng Cheng Laboratory Shenzhen China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

vision-and-Language Navigation (VLN), as a crucial research problem of Embodied AI, requires an embodied agent to navigate through complex 3D environments following natural language instructions. Recent research has highlighted the promising capacity of large language models (LLMs) in VLN by improving navigational reasoning accuracy and interpretability. However, their predominant use in an offline manner usually suffers from substantial domain gap between the VLN task and the LLM training corpus. This paper proposes a novel strategy called Nav igational C hain- o f- T hought (NavCoT), where we fulfill parameter-efficient in-domain training to enable self-guided navigational decision, leading to a significant mitigation of the domain gap in a cost-effective manner. Specifically, at each timestep, the LLM is prompted to forecast the navigational chain-of-thought by: 1) acting as a world model to imagine the next observation according to the instruction, 2) selecting the candidate observation that best aligns with the imagination, and 3) determining the action based on the reasoning from the prior steps. In this way, the action prediction can be effectively simplified benefiting from the disentangled reasoning. Through constructing formalized labels for training, the LLM can learn to generate desired and reasonable chain-of-thought outputs for improving the action decision. Experimental results across various training settings and popular VLN benchmarks (e.g., Room-to-Room (R2R), Room-across-Room (RxR), Room-for-Room (R4R)) show the significant superiority of NavCoT over the direct action prediction variants. Through simple parameter-efficient finetuning, our NavCoT outperforms a recent GPT4-based approach with $\sim$ 7% relative improvement on the R2R dataset. We believe that NavCoT will help unlock more task-adaptive and scalable LLM-based embodied agents, which are helpful for developing real-world robotics applications.

关键词： Navigation Cognition Training Scalability Glass Planning Large language models History Electronic mail Visualization

Multi-Task Diffusion Incentive Design for Mobile Crowdsourcing in Social Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Guo, Jianxiong Ni, Qiufen Wu, Weili Du, Ding-Zhu 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 The School of Computers Guangdong University of Technology Guangzhou510006 China The Department of Computer Science Erik Jonsson School of Engineering and Computer Science The University of Texas at Dallas RichardsonTX75080 United States

Mobile Crowdsourcing (MCS) is a novel distributed computing paradigm that recruits skilled workers to perform location-dependent tasks. A number of mature incentive mechanisms have been proposed to address the worker recruitment problem in MCS systems. However, they all assume that there is a large enough worker pool and a sufficient number of users can be selected. This may be impossible in large-scale crowdsourcing environments. To address this challenge, we consider the MCS system defined on a location-aware social network provided by a social platform. In this system, we can recruit a small number of seed workers from the existing worker pool to spread the information of multiple tasks in the social network, thus attracting more users to perform tasks. In this paper, we propose a Multi-Task Diffusion Maximization (MT-DM) problem that aims to maximize the total utility of performing multiple crowdsourcing tasks under the budget. To accommodate multiple tasks diffusion over a social network, we create a multi-task diffusion model, and based on this model, we design an auction-based incentive mechanism, MT-DM-L. To deal with the high complexity of computing the multi-task diffusion, we adopt Multi-Task Reverse Reachable (MT-RR) sets to approximate the utility of information diffusion efficiently. Through both complete theoretical analysis and extensive simulations by using real-world datasets, we validate that our estimation for the spread of multitask diffusion is accurate and the proposed mechanism achieves individual rationality, truthfulness, computational efficiency, and (1 − 1/√e − Ε) approximation with at least 1 − δ probability. Copyright © 2023, The Authors. All rights reserved.

关键词： Approximation algorithms

LocalViT: Analyzing Locality in vision Transformers

学校读者我要写书评

暂无评论

LocalViT: Analyzing Locality in Vision Transformers

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Yawei Li Kai Zhang Jiezhang Cao Radu Timofte Michele Magno Luca Benini Luc Van Goo Computer Vision Lab D-ITET ETH Zurich Switzerland Center for Artificial Intelligence and Data Science (CAIDAS) University of Wurzburg Germany Center for Project-Based Learning D-ITET ETH Zurich Switzerland Integrated Systems Laboratory D-ITET ETH Zurich Switzerland Department of Electrical Electronic and Information Engineering University of Bologna Italy Processing Speech and Images (PSI) KU Leuven Belgium

The aim of this paper is to study the influence of locality mechanisms in vision transformers. Transformers originated from machine translation and are particularly good at modelling long-range dependencies within a long sequence. Although the global interaction between the token embeddings could be well modelled by the self-attention mechanism of transformers, what is lacking is a locality mechanism for infor-mation exchange within a local region. In this paper, locality mechanism is systematically investigated by carefully designed controlled experiments. We add locality to vision transformers into the feed-forward network. This seemingly simple solution is inspired by the comparison between feed-forward networks and inverted residual blocks. The importance of locality mechanisms is validated in two ways: 1) A wide range of design choices (activation function, layer placement, expansion ratio) are available for incorporating locality mechanisms and proper choices can lead to a performance gain over the baseline, and 2) The same locality mechanism is successfully applied to vision transformers with different architecture designs, which shows the generalization of the locality concept. For ImageNet2012 classification, the locality-enhanced transformers outperform the baselines Swin-T [1], DeiT-T [2] and PVT-T [3] by 1.0%, 2.6 % and 3.1 % with a negligible increase in the number of parameters and computational effort. Code is available at https://***/ofsoundof/LocalViT.

关键词：

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3DAD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

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

学校读者我要写书评

暂无评论

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

Class-Imbalanced Semi-Supervised Learning for Large-Scale Point Cloud Semantic Segmentation Via Decoupling Optimization

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Li, Mengtian Lin, Shaohui Wang, Zihan Shen, Yunhang Zhang, Baochang Ma, Lizhuang Visual Media Intelligent Processing Research Group Department of Film and Television Engineering Shanghai University Shanghai200072 China School of Computer Science and Technology East China Normal University Shanghai200062 China Key Laboratory of Advanced Theory and Application in Statistics and Data Science Ministry of Education China School of Automation Science and Electrical Engineering Beihang University Beijing100191 China Youtu Lab Tencent China

Semi-supervised learning (SSL), thanks to the significant reduction of data annotation costs, has been an active research topic for large-scale 3D scene understanding. However, the existing SSL-based methods suffer from severe training bias, mainly due to class imbalance and long-tail distributions of the point cloud data. As a result, they lead to a biased prediction for the tail class segmentation. In this paper, we introduce a new decoupling optimization framework, which disentangles feature representation learning and classifier in an alternative optimization manner to shift the bias decision boundary effectively. In particular, we first employ two-round pseudo-label generation to select unlabeled points across head-to-tail classes. We further introduce multi-class imbalanced focus loss to adaptively pay more attention to feature learning across head-to-tail classes. We fix the backbone parameters after feature learning and retrain the classifier using ground-truth points to update its parameters. Ex-✩Fully documented templates are available in the elsarticle package on CTAN. © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

DQPS: An Intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge Computing Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Consumer Electronics 2024年

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge Computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal State update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading