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

arXiv 2024年

作者： Zhang, Yedi Song, Fu Chen, Taolue Wu, Xuzhi Department of Computing Science National University of Singapore Singapore State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom College of Computer Science and Software Engineering Shenzhen University China

Reasoning about strategic abilities is key to AI systems comprising multiple agents, which provide a unified framework for formalizing various problems in game theory, social choice theory, etc. In this work, we propose a probabilistic extension of the alternating-time μ-calculus (AMC), named PAMC, for reasoning about the strategic abilities of agents in stochastic multi-agent systems. We show that PAMC subsumes two existing logics AMC and PμTL (a probabilistic extension of the modal μ-calculus), but is incomparable with the probabilistic alternating-time temporal logic (PATL). We study the problems of model checking and satisfiability checking for PAMC. We first give a model checking algorithm by leveraging algorithms for solving normal-form games and AMC model checking. We establish that the model checking problem of PAMC remains in UP∩co-UP, the same complexity class as the model checking problem for AMC and PμTL. We also provide a new reduction from the satisfiability problem of PAMC to solving parity games, by which we obtain an EXPTIME decision procedure, as well as the small model property which allows to construct a model for each satisfiable PAMC formula. Satisfiability in PAMC has the same complexity as in the modal μ-calculus, unlike PCTL and PATL whose satisfiability checking problems remain open. We have implemented both the model checking and satisfiability checking algorithms as open-source tools. Experimental results are reported, showcasing the practical applications and effectiveness of our approaches. © 2024, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

UR4NNV: Neural Network Verification, Under-approximation Reachability Works!

arXiv

引用

arXiv 2024年

作者： Liang, Zhen Wu, Taoran Zhao, Ran Xue, Bai Wang, Ji Yang, Wenjing Deng, Shaojun Liu, Wanwei College of Computer Science and Technology National University of Defense Technology China Institute of Software Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology China

Recently, formal verification of deep neural networks (DNNs) has garnered considerable attention, and over-approximation based methods have become popular due to their effectiveness and efficiency. However, these strategies face challenges in addressing the "unknown dilemma" concerning whether the exact output region or the introduced approximation error violates the property in question. To address this, this paper introduces the UR4NNV verification framework, which utilizes under-approximation reachability analysis for DNN verification for the first time. UR4NNV focuses on DNNs with Rectified Linear Unit (ReLU) activations and employs a binary tree branch-based under-approximation algorithm. In each epoch, UR4NNV under-approximates a sub-polytope of the reachable set and verifies this polytope against the given property. Through a trial-and-error approach, UR4NNV effectively falsifies DNN properties while providing confidence levels when reaching verification epoch bounds and failing falsifying properties. Experimental comparisons with existing verification methods demonstrate the effectiveness and efficiency of UR4NNV, significantly reducing the impact of the "unknown dilemma".MSC Codes 68Q60, 68T07 Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Mixture of Attention Heads: Selecting Attention Heads Per Token

Mixture of Attention Heads: Selecting Attention Heads Per To...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Zhang, Xiaofeng Shen, Yikang Huang, Zeyu Zhou, Jie Rong, Wenge Xiong, Zhang State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University China Sino-French Engineer School Beihang University China Mila University of Montreal Canada Wechat AI Tencent China

Mixture-of-Experts (MoE) networks have been proposed as an efficient way to scale up model capacity and implement conditional computing. However, the study of MoE components mostly focused on the feedforward layer in Transformer architecture. This paper proposes the Mixture of Attention Heads (MoA), a new architecture that combines multi-head attention with the MoE mechanism. MoA includes a set of attention heads that each has its own set of parameters. Given an input, a router dynamically selects a subset of k attention heads per token. This conditional computation schema allows MoA to achieve stronger performance than the standard multi-head attention layer. Furthermore, the sparsely gated MoA can easily scale up the number of attention heads and the number of parameters while preserving computational efficiency. In addition to the performance improvements, MoA also automatically differentiates heads' utilities, providing a new perspective to discuss the model's interpretability. We conducted experiments on several important tasks, including Machine Translation and Masked Language Modeling. Experiments have shown promising results on several tasks against strong baselines that involve large and very deep models. © 2022 Association for Computational Linguistics.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

BIG-MOE: BYPASS ISOLATED GATING MOE FOR GENERALIZED MULTIMODAL FACE ANTI-SPOOFING

arXiv

引用

arXiv 2024年

作者： Ma, Yingjie Yu, Zitong Lin, Xun Xie, Weicheng Shen, Linlin Great Bay University China 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

In the domain of facial recognition security, multimodal Face Anti-Spoofing (FAS) is essential for countering presentation attacks. However, existing technologies encounter challenges due to modality biases and imbalances, as well as domain shifts. Our research introduces a Mixture of Experts (MoE) model to address these issues effectively. We identified three limitations in traditional MoE approaches to multimodal FAS: (1) Coarse-grained experts’ inability to capture nuanced spoofing indicators;(2) Gated networks’ susceptibility to input noise affecting decision-making;(3) MoE’s sensitivity to prompt tokens leading to overfitting with conventional learning methods. To mitigate these, we propose the Bypass Isolated Gating MoE (BIG-MoE) framework, featuring: (1) Fine-grained experts for enhanced detection of subtle spoofing cues;(2) An isolation gating mechanism to counteract input noise;(3) A novel differential convolutional prompt bypass enriching the gating network with critical local features, thereby improving perceptual capabilities. Extensive experiments on four benchmark datasets demonstrate significant generalization performance improvement in multimodal FAS task. The code is released at https://***/murInJ/BIGMoE. Copyright © 2024, The Authors. All rights reserved.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

A hybrid equilibrium optimizer with differential evolution algorithm

A hybrid equilibrium optimizer with differential evolution a...

引用

computer, Internet of Things and Smart City (CIoTSC), International Conference on

作者： Meijun Duan Chao Zhang Bo Li School of Computer and Software Engineering Xihua University Chengdu China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou China

ISBN: (数字)9798350306569

ISBN: (纸本)9798350306576

For the population diversity decreasing rapidly in differential evolution (DE), a novel hybrid algorithm based on Equilibrium Optimizer (EO) and DE (HEODE) is presented. Firstly, a sharing learning mutation strategy is introduced in DE based on the sharing individual. By learning from the sharing individual, information exchange among the whole population can be achieved. Secondly, an effective hybridization mechanism is proposed to combine the advantages of two algorithms. A serial of experiments are used for effectiveness verification among 12 DEs and 5 none-DE based algorithms. The test results validate that HEODE outperforms all competitors.

关键词： Sequential analysis Smart cities Path planning Internet of Things Aircraft Optimization Information exchange Electo-optic effects Convergence

来源：评论

学校读者我要写书评

暂无评论

Exploring Communication-efficient Federated Learning via Stateless In-network Aggregation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xia, Junxu Cheng, Geyao Wu, Wenfei Luo, Lailong Guo, Deke National University of Defense Technology National Key Laboratory of Information Systems Engineering Changsha Hunan410073 China National University of Defense Technology State Key Laboratory of Complex & Critical Software Environment College of Information and Communication Changsha Hunan410073 China Peking University School of Computer Science Beijing100091 China

As an ambitious training paradigm, federated learning has garnered increasing attention in recent years, which enables collaborative training of a global model without accessing users' private data. However, due to the simultaneous and constant model updates gathering from massive distributed clients, the central server generally becomes a performance bottleneck. Additionally, the stateful aggregation (retaining all the updates from each client) conducted by the central server further poses potential threats to privacy, since it may recover the raw data based on such model updates inversely. The state-of-the-art methodologies, however, fail to address these two problems concurrently and efficiently. To this end, we propose GAIN, a secure aggregation acceleration service for federated learning. At its core, GAIN leverages programmable switches deployed at the edge network to aggregate model updates in a stateless manner before transmitting them to the central server. Consequently, GAIN can accelerate the transmission and aggregation of model updates while eliminating the chance of recovering private data. We evaluate the performance of GAIN through FPGA-based experiments and large-scale simulations. The results show that GAIN can effectively reduce bandwidth overhead and achieve up to 4.11× training throughput acceleration while prioritizing privacy protection. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need 38

Unlearnable 3D Point Clouds: Class-wise Transformation Is Al...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ESR: Optimizing Gene Feature Selection for scRNA-seq Data

ESR: Optimizing Gene Feature Selection for scRNA-seq Data

引用

IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)

作者： Tao Huang Xiang Chen Li Peng School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan Hunan China Hunan Key Laboratory for Service computing and Novel Software Technology

The rapid development of single-cell RNA sequencing (scRNA-seq) technology has enabled researchers to explore gene expression differences at the level of individual cells, revealing more refined cell types and states. However, due to the low expression and high noise of scRNA-seq data, feature selection has become particularly important in the analysis of single-cell data. Here, we introduce the Entropy Stepwise Regression (ESR) method for feature selection. This method utilizes the correlation between genes and the entropy values of each feature to filter out genes that are conducive to downstream analysis. In mouse kidney samples, we compared the performance of three methods in terms of Adjusted Rand Index and achieved good results. This indicates that the method can improve the accuracy of downstream analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IOMatch: Simplifying Open-Set Semi-Supervised Learning with Joint Inliers and Outliers Utilization

IOMatch: Simplifying Open-Set Semi-Supervised Learning with ...

引用

International Conference on computer Vision (ICCV)

作者： Zekun Li Lei Qi Yinghuan Shi Yang Gao State Key Laboratory for Novel Software Technology and National Institute of Healthcare Data Science Nanjing University School of Computer Science and Engineering Southeast University

Semi-supervised learning (SSL) aims to leverage massive unlabeled data when labels are expensive to obtain. Unfortunately, in many real-world applications, the collected unlabeled data will inevitably contain unseen-class outliers not belonging to any of the labeled classes. To deal with the challenging open-set SSL task, the mainstream methods tend to first detect outliers and then filter them out. However, we observe a surprising fact that such approach could result in more severe performance degradation when labels are extremely scarce, as the unreliable outlier detector may wrongly exclude a considerable portion of valuable inliers. To tackle with this issue, we introduce a novel open-set SSL framework, IOMatch, which can jointly utilize inliers and outliers, even when it is difficult to distinguish exactly between them. Specifically, we propose to employ a multi-binary classifier in combination with the standard closed-set classifier for producing unified open-set classification targets, which regard all outliers as a single new class. By adopting these targets as open-set pseudo-labels, we optimize an open-set classifier with all unlabeled samples including both inliers and outliers. Extensive experiments have shown that IOMatch significantly outperforms the baseline methods across different benchmark datasets and different settings despite its remarkable simplicity. Our code and models are available at https://***/nukezil/IOMatch.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Intelligent Beam Configuration for Neighbor Discovery in Ad Hoc Networks with Directional Antennas

Intelligent Beam Configuration for Neighbor Discovery in Ad ...

引用

IEEE International Conference on Communications (ICC)

作者： Jian Wang Gang Feng Shuang Qin Yijing Liu Jianhong Zhou Youkun Peng National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China School of Computer and Software Engineering Xihua University Chengdu China

High frequency directional communication is considered as a key technology to improve the performance of mobile Ad Hoc networks owing to its advantages in terms of communication distance and interference. Neighbor discovery plays a key role for efficient routing and topology control in mobile Ad Hoc networks. It is also a very challenging issue due to the use of directional antennas and movement of mobile nodes. Beam configuration is the key step of neighbor discovery in mobile Ad Hoc networks with directional antennas. Therefore, it is imperative to develop an efficient beam configuration algorithm to reduce the neighbor discovery latency. In this paper, we propose a novel beam configuration algorithm based on personalized federated learning. Considering the characteristics of mobile Ad Hoc networks (e.g., dynamic topology and directional communication), we use Deep Deterministic Policy Gradient (DDPG) as the local model of federated learning. Since the local data of ad hoc network nodes is heterogeneous, Model Agnostic Meta Learning (MAML) is applied to personalize the federated learning. Numerical results demonstrate that our proposed algorithm has better performance than some baseline algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：