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

Frequency-driven Imperceptible Adversarial Attack on Semantic Similarity

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Luo, Cheng Lin, Qinliang Xie, Weicheng Wu, Bizhu Xie, Jinheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University2Shenzhen Institute of Artificial Intelligence & Robotics for Society3Guangdong Key Laboratory of Intelligent Information Processing

Current adversarial attack research reveals the vulnerability of learning-based classifiers against carefully crafted perturbations. However, most existing attack methods have inherent limitations in cross-dataset generalization as they rely on a classification layer with a closed set of categories. Furthermore, the perturbations generated by these methods may appear in regions easily perceptible to the human visual system (HVS). To circumvent the former problem, we propose a novel algorithm that attacks semantic similarity on feature representations. In this way, we are able to fool classifiers without limiting attacks to a specific dataset. For imperceptibility, we introduce the low-frequency constraint to limit perturbations within high-frequency components, ensuring perceptual similarity between adversarial examples and originals. Extensive experiments on three datasets (CIFAR-10, CIFAR-100, and ImageNet-1K) and three public online platforms indicate that our attack can yield misleading and transferable adversarial examples across architectures and datasets. Additionally, visualization results and quantitative performance (in terms of four different metrics) show that the proposed algorithm generates more imperceptible perturbations than the state-of-the-art methods. Code is made available at https://***/LinQinLiang/SSAH-adversarial-attack. © 2022, CC BY.

关键词： Classification (of information)

F2A2: flexible fully-decentralized approximate actor-critic for cooperative multi-agent reinforcement learning

学校读者我要写书评

暂无评论

The Journal of Machine Learning Research

The Journal of Machine Learning Research 2023年第1期24卷 8447-8521页

作者： Wenhao Li Bo Jin Xiangfeng Wang Junchi Yan Hongyuan Zha School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a exible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multi-agent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods.

关键词： cooperative MARL decentralized actor-critic primal-dual method

SMedBERT: A knowledge-enhanced pre-trained language model with structured semantics for medical text mining 59

学校读者我要写书评

暂无评论

SMedBERT: A knowledge-enhanced pre-trained language model wi...

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Zhang, Taolin Cai, Zerui Wang, Chengyu Qiu, Minghui Yang, Bite He, Xiaofeng School of Software Engineering East China Normal University China Alibaba Group Shanghai Key Laboratory of Trsustworthy Computing China School of Computer Science and Technology East China Normal University China DXY Shanghai Research Institute for Intelligent Autonomous Systems China

ISBN: (纸本)9781954085527

Recently, the performance of Pre-trained Language Models (PLMs) has been significantly improved by injecting knowledge facts to enhance their abilities of language understanding. For medical domains, the background knowledge sources are especially useful, due to the massive medical terms and their complicated relations are difficult to understand in text. In this work, we introduce SMedBERT, a medical PLM trained on large-scale medical corpora, incorporating deep structured semantics knowledge from neighbours of linked-entity. In SMedBERT, the mention-neighbour hybrid attention is proposed to learn heterogeneous-entity information, which infuses the semantic representations of entity types into the homogeneous neighbouring entity structure. Apart from knowledge integration as external features, we propose to employ the neighbors of linked-entities in the knowledge graph as additional global contexts of text mentions, allowing them to communicate via shared neighbors, thus enrich their semantic representations. Experiments demonstrate that SMedBERT significantly outperforms strong baselines in various knowledge-intensive Chinese medical tasks. It also improves the performance of other tasks such as question answering, question matching and natural language inference. © 2021 Association for Computational Linguistics

关键词： Knowledge graph

The Parables of the Mustard Seed and the Yeast: Extremely Low-Budget, High-Performance Nighttime Semantic Segmentation 39

学校读者我要写书评

暂无评论

The Parables of the Mustard Seed and the Yeast: Extremely Lo...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Shiqin Xu, Xin Chen, Haoyang Jiang, Kui Wang, Zheng School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University China School of Computer Science and Technology Harbin Institute of Technology Harbin150001 China

ISBN: (纸本)157735897X

Nighttime Semantic Segmentation (NSS) is essential to many cutting-edge vision applications. However, existing technologies overly rely on massive labeled data, whose annotation is time-consuming and laborious. In this paper, we pioneer a new task focusing on exploring the potential of training strategy and framework design with limited annotation to achieve high-performance NSS. Insufficient information at very low labeling budgets can easily lead to under-optimization or overfitting of the model. Our solution comprises two main components: i) a novel region-based active sampling strategy called Contextual-Aware Region Query (CARQ), which identifies highly informative target nighttime regions for labeling;and ii) an innovative Fragmentation Synergy Active Domain Adaptation framework (FS-ADA), which progressively broadcasts the limited annotation to the unlabeled regions, achieving high performance with a minimal annotation budget. Extensive experiments demonstrate that our method outperforms state-of-the-art UDA-NSS & ADA-SS methods across four day-to-nighttime benchmarks, and generalizes well to foggy, rainy, & snowy scenes. In particular only with 1% target nighttime data annotation, our method is on par with the mainstream fully-supervised methods on the BDD100K-Night val dataset. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Budget control

How Deep is Love in LLMs’ Hearts? Exploring Semantic Size in Human-like Cognition

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yao, Yao Yang, Yifei Ma, Xinbei Yang, Dongjie Zhang, Zhuosheng Li, Zuchao Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan University Wuhan430072 China

How human cognitive abilities are formed has long captivated researchers. However, a significant challenge lies in developing meaningful methods to measure these complex processes. With the advent of large language models (LLMs), which now rival human capabilities in various domains, we are presented with a unique testbed to investigate human cognition through a new lens. Among the many facets of cognition, one particularly crucial aspect is the concept of semantic size—the perceived magnitude of both abstract and concrete words or concepts. This study seeks to investigate whether LLMs exhibit similar tendencies in understanding semantic size, thereby providing insights into the underlying mechanisms of human cognition. We begin by exploring metaphorical reasoning, comparing how LLMs and humans associate abstract words with concrete objects of varying sizes. Next, we examine LLMs’ internal representations to evaluate their alignment with human cognitive processes. Our findings reveal that multi-modal training is crucial for LLMs to achieve more human-like understanding, suggesting that real-world, multi-modal experiences are similarly vital for human cognitive development. Lastly, we examine whether LLMs are influenced by attention-grabbing headlines with larger semantic sizes in a real-world web shopping scenario. The results show that multi-modal LLMs are more emotionally engaged in decision-making, but this also introduces potential biases, such as the risk of manipulation through clickbait headlines. Ultimately, this study offers a novel perspective on how LLMs interpret and internalize language, from the smallest concrete objects to the most profound abstract concepts like ‘love’. The insights gained not only improve our understanding of LLMs but also provide new avenues for exploring the cognitive abilities that define human intelligence. Our code and dataset is publicly available at https://***/Zoeyyao27/LLM-Semantic-Size-Understanding. © 2025, CC BY.

关键词： Semantics

State-Aware Perturbation Optimization for Robust Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Zongyuan Duan, Tianyang Lin, Zheng Huang, Dong Fang, Zihan Sun, Zekai Xiong, Ling Liang, Hongbin Cui, Heming Cui, Yong Department of Computer Science The University of Hong Kong Hong Kong Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Department of Computer Science City University of Hong Kong Hong Kong School of Computer and Software Engineering Xihua University Chengdu610039 China National United Engineering Laboratory of Integrated and Intelligent Transportation The National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Department of Computer Science and Technology Ts-inghua University Beijing100084 China

Recently, deep reinforcement learning (DRL) has emerged as a promising approach for robotic control. However, the deployment of DRL in real-world robots is hindered by its sensitivity to environmental perturbations. While existing white-box adversarial attacks rely on local gradient information and apply uniform perturbations across all states to evaluate DRL robustness, they fail to account for temporal dynamics and state-specific vulnerabilities. To combat the above challenge, we first conduct a theoretical analysis of white-box attacks in DRL by establishing the adversarial victim-dynamics Markov decision process (AVD-MDP), to derive the necessary and sufficient conditions for a successful attack. Based on this, we propose a selective state-aware reinforcement adversarial attack method, named STAR, to optimize perturbation stealthiness and state visitation dispersion. STAR first employs a soft mask-based state-targeting mechanism to minimize redundant perturbations, enhancing stealthiness and attack effectiveness. Then, it incorporates an information-theoretic optimization objective to maximize mutual information between perturbations, environmental states, and victim actions, ensuring a dispersed state-visitation distribution that steers the victim agent into vulnerable states for maximum return reduction. Extensive experiments demonstrate that STAR outperforms state-of-the-art benchmarks. Copyright © 2025, The Authors. All rights reserved.

关键词： Markov processes

Multi-Grained Query-Guided Set Prediction Network for Grounded Multimodal Named Entity Recognition 39

学校读者我要写书评

暂无评论

Multi-Grained Query-Guided Set Prediction Network for Ground...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Tang, Jielong Wang, Zhenxing Gong, Ziyang Yu, Jianxing Zhu, Xiangwei Yin, Jian School of Artificial Intelligence Sun Yat-sen University Zhuhai China School of Atmospheric Sciences Sun Yat-sen University Zhuhai China School of Electronics and Communication Engineering Sun Yat-sen University Guangzhou China State Key Laboratory of Intelligent Game Institute of Software Chinese Academy of Sciences Beijing China Pazhou Lab Guangzhou510330 China

ISBN: (纸本)157735897X

Grounded Multimodal Named Entity Recognition (GMNER) is an emerging information extraction (IE) task, aiming to simultaneously extract entity spans, types, and corresponding visual regions of entities from given sentence-image pairs data. Recent unified methods employing machine reading comprehension or sequence generation-based frameworks show limitations in this difficult task. The former, utilizing human-designed type queries, struggles to differentiate ambiguous entities, such as Jordan (Person) and off-White x Jordan (Shoes). The latter, following the one-by-one decoding order, suffers from exposure bias issues. We maintain that these works misunderstand the relationships of multimodal entities. To tackle these, we propose a novel unified framework named Multi-grained Query-guided Set Prediction Network (MQSPN) to learn appropriate relationships at intra-entity and inter-entity levels. Specifically, MQSPN explicitly aligns textual entities with visual regions by employing a set of learnable queries to strengthen intra-entity connections. Based on distinct intra-entity modeling, MQSPN reformulates GMNER as a set prediction, guiding models to establish appropriate inter-entity relationships from a optimal global matching perspective. Additionally, we incorporate a query-guided Fusion Net (QFNet) as a glue network to boost better alignment of two-level relationships. Extensive experiments demonstrate that our approach achieves state-of-the-art performances in widely used benchmarks. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

FaceBench: A Multi-View Multi-Level Facial Attribute VQA Dataset for Benchmarking Face Perception MLLMs

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wang, Xiaoqin Ma, Xusen Hou, Xianxu Ding, Meidan Li, Yudong Chen, Junliang Chen, Wenting Peng, Xiaoyang Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China AIAC Xi’an Jiaotong-Liverpool University China Tsinghua University China The Hong Kong Polytechnic University Hong Kong City University of Hong Kong Hong Kong Sun Yat-sen University China

Multimodal large language models (MLLMs) have demonstrated remarkable capabilities in various tasks. However, effectively evaluating these MLLMs on face perception remains largely unexplored. To address this gap, we introduce FaceBench, a dataset featuring hierarchical multi-view and multi-level attributes specifically designed to assess the comprehensive face perception abilities of MLLMs. Initially, we construct a hierarchical facial attribute structure, which encompasses five views with up to three levels of attributes, totaling over 210 attributes and 700 attribute values. Based on the structure, the proposed FaceBench consists of 49,919 visual question-answering (VQA) pairs for evaluation and 23,841 pairs for fine-tuning. Moreover, we further develop a robust face perception MLLM baseline, Face-LLaVA, by training with our proposed face VQA data. Extensive experiments on various mainstream MLLMs and Face-LLaVA are conducted to test their face perception ability, with results also compared against human performance. The results reveal that, the existing MLLMs are far from satisfactory in understanding the fine-grained facial attributes, while our Face-LLaVA significantly outperforms existing open-source models with a small amount of training data and is comparable to commercial ones like GPT-4o and Gemini. The dataset will be released at https://***/CVI-SZU/FaceBench. Copyright © 2025, The Authors. All rights reserved.

关键词：

Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering for Recommendation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Kang Xue, Feng He, Xiangnan Guo, Dan Hong, Richang The School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The School of Software Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei China The University of Science and Technology of China Anhui Hefei China

Graph Convolution Networks (GCNs), with their efficient ability to capture high-order connectivity in graphs, have been widely applied in recommender systems. Stacking multiple neighbor aggregation is the major operation in GCNs. It implicitly captures popularity features because the number of neighbor nodes reflects the popularity of a node. However, existing GCN-based methods ignore a universal problem: users’ sensitivity to item popularity is differentiated, but the neighbor aggregations in GCNs actually fix this sensitivity through Graph Laplacian Normalization, leading to suboptimal personalization. In this work, we propose to model multi-grained popularity features and jointly learn them together with high-order connectivity, to match the differentiation of user preferences exhibited in popularity features. Specifically, we develop a Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering model, short for JMP-GCF, which uses a popularity-aware embedding generation to construct multi-grained popularity features, and uses the idea of joint learning to capture the signals within and between different granularities of popularity features that are relevant for modeling user preferences. Additionally, we propose a multistage stacked training strategy to speed up model convergence. We conduct extensive experiments on three public datasets to show the state-of-the-art performance of JMP-GCF. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution