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

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Rao, Wenjie Zhong, Sheng-Hua Zhang, Zhi Liu, Yan Shenzhen University Guangdong Laboratory of Artificial Intelligence and Digital Economy College of Computer Science and Software Shenzhen China Hong Kong Polytechnic University Department of Computer Science Hong Kong

ISBN: (纸本)9798350337488

With the development of deep learning in EEG-related tasks, the complexity of learning models has gradually increased. These complex models often result in long inference times, high energy consumption, and an increased risk of overfitting. Therefore, model compression has become an important consideration. Although some EEG models have used lightweight techniques, such as separable convolution, no existing work has directly attempted to compress EEG models to reduce their complexity. In this paper, we integrate neuroscience knowledge into EEG model pruning recovery, and innovatively propose two loss functions in the learning process, the knowledge-guided region-wise loss that enforces the classification evidence consistent with the importance of the prefrontal lobe, and the knowledge-guided sample-wise loss that constrains the learning process by distinguishing the importance of different samples. © 2023 IEEE.

关键词： EEG-based emotion recognition knowledge-guided network pruning model compression

来源：评论

学校读者我要写书评

暂无评论

Hyperautomation for Air Quality Evaluations: A Perspective of Evidential Three-way Decision-making

引用

Cognitive Computation 2024年第5期16卷 2437-2453页

作者： Ding, Juanjuan Zhang, Chao Li, Deyu Sangaiah, Arun Kumar School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Shanxi Taiyuan030006 China International Graduate Institute of Artificial Intelligence National Yunlin University of Science and Technology Douliou64002 Taiwan Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon

Hyperautomation acts as a real digital transformation with the support of several cutting-edge cognitive computation methods that include robotic process automation, natural language processing, artificial intelligence, and other emerging ones, which is conducive to processing complex industrial processes via extending the range of various data-driven cognitive decision-making algorithms. The study of air quality evaluations (AQE) plays a significant role in ensuring healthy atmospheric environments. In view of the objective existence of uncertainties, AQE can be modeled and addressed by a typical data-driven automated decision-making problem, and hyperautomation can provide a reasonable solution via associating with a variety of techniques. This article explores hyperautomation for AQE via evidential three-way large-scale group decision-making (LSGDM) in an intuitionistic fuzzy (IF) setting. First, the notion of intuitionistic fuzzy sets (IFSs) is incorporated into the paradigm of multi-granularity (MG) three-way decisions (TWD), and the model of adjustable MG IF probabilistic rough sets (PRSs) is developed. Second, an IF clustering analysis with the improved technique for order preference by similarity to ideal solution (TOPSIS) method is conducted to affirm representative members within a decision group. Third, a novel IF LSGDM method is built via adjustable MG IF PRSs and the evidence reasoning (ER) method. Finally, a case study in the setting of AQE is studied by using the presented evidential three-way LSGDM method. Corresponding experimental analyses are carried out for illustrating the efficiency of hyperautomation for AQE. In general, the proposed method improves the performance of information fusion by virtue of adjustable MG IF PRSs, and the TOPSIS method avoids the influence of subjective factors on decision results. Meanwhile, the evaluation information of decision-makers (DMs) is fully analyzed by means of the ER method, which can provide more explaina

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Multi-Metric Based Client Selection for Backdoor Defense in Federated Learning 1

Multi-Metric Based Client Selection for Backdoor Defense in ...

引用

1st International Conference on Intelligent Manufacturing and Cloud Computing, ICIMCC 2024

作者： Yuan, Changjiang Li, Yidong Chen, Naiyue Zhang, Zikai Key Laboratory of Big Data & Artificial Intelligence in Transportation Beijing Jiaotong University Ministry of Education China School of Computer Science and Technology Beijing Jiaotong University Beijing100044 China

ISBN: (纸本)9781643685779

The distributed nature of federated learning makes it highly susceptible to backdoor attacks, which aim to induce the model to produce incorrect results when specific data is input. Existing defense methods based on distance calculations mostly use one single distance, which can be easily circumvented by backdoor attacks. Therefore, we conducted research on the combination of multiple distances. Based on this, we propose a backdoor defense algorithm based on multi metrics, which evaluates models through distance calculation and normalization to select benign models for aggregation. To verify the effectiveness of our method, we conducted experiments on three datasets, and the results prove that our method can provide good defense without reducing the model's main task accuracy. © 2025 The Authors.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Partially Observable Task and Motion Planning with Uncertainty and Risk Awareness

arXiv

引用

arXiv 2024年

作者： Curtis, Aidan Matheos, George Gothoskar, Nishad Mansinghka, Vikash Tenenbaum, Joshua Lozano-Pérez, Tomás Kaelbling, Leslie Pack MIT Computer Science and Artificial Intelligence Laboratory United States

Integrated task and motion planning (TAMP) has proven to be a valuable approach to generalizable long-horizon robotic manipulation and navigation problems. However, the typical TAMP problem formulation assumes full observability and deterministic action effects. These assumptions limit the ability of the planner to gather information and make decisions that are risk-aware. We propose a strategy for TAMP with Uncertainty and Risk Awareness (TAMPURA) that is capable of efficiently solving long-horizon planning problems with initial-state and action outcome uncertainty, including problems that require information gathering and avoiding undesirable and irreversible outcomes. Our planner reasons under uncertainty at both the abstract task level and continuous controller level. Given a set of closed-loop goal-conditioned controllers operating in the primitive action space and a description of their preconditions and potential capabilities, we learn a high-level abstraction that can be solved efficiently and then refined to continuous actions for execution. We demonstrate our approach on several robotics problems where uncertainty is a crucial factor and show that reasoning under uncertainty in these problems outperforms previously proposed determinized planning, direct search, and reinforcement learning strategies. Lastly, we demonstrate our planner on two real-world robotics problems using recent advancements in probabilistic perception. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Multi-Blockchain Based Data Trading Markets With Novel Pricing Mechanisms

引用

IEEE/CAA Journal of Automatica Sinica 2023年第12期10卷 2222-2232页

作者： Juanjuan Li Junqing Li Xiao Wang Rui Qin Yong Yuan Fei-Yue Wang IEEE the State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China the College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao 266590China the School of Artificial Intelligence Anhui UniversityHefei 266114 the Qingdao Academy of Intelligent Industries Qingdao 230031China the School of Mathematics Renmin University of ChinaBeijing 100872China the State Key Laboratory for Management and Control of Complex Systems Chinese Academy of SciencesBeijing 100190 the Faculty of Innovation Engineering Macao University of Science and TechnologyMacao 999078China

In the era of big data,there is an urgent need to establish data trading markets for effectively releasing the tremendous value of the drastically explosive *** security and data pricing,however,are still widely regarded as major challenges in this respect,which motivate this research on the novel multi-blockchain based framework for data trading markets and their associated pricing *** this context,data recording and trading are conducted separately within two separate blockchains:the data blockchain(DChain) and the value blockchain(VChain).This enables the establishment of two-layer data trading markets to manage initial data trading in the primary market and subsequent data resales in the secondary ***,pricing mechanisms are then proposed to protect these markets against strategic trading behaviors and balance the payoffs of both suppliers and ***,in regular data trading on VChain-S2D,two auction models are employed according to the demand scale,for dealing with users’ strategic *** incentive-compatible Vickrey-Clarke-Groves(VCG)model is deployed to the low-demand trading scenario,while the nearly incentive-compatible monopolistic price(MP) model is utilized for the high-demand trading *** temporary data trading on VChain-D2S,a reverse auction mechanism namely two-stage obscure selection(TSOS) is designed to regulate both suppliers’ quoting and users’ valuation ***,experiments are carried out to demonstrate the strength of this research in enhancing data security and trading efficiency.

关键词： Auction data trading markets multi-blockchain pricing mechanisms

来源：评论

学校读者我要写书评

暂无评论

Factor Graph Neural Network Meets Max-Sum: A Real-Time Route Planning Algorithm for Massive-Scale Trips 23

Factor Graph Neural Network Meets Max-Sum: A Real-Time Route...

引用

23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024

作者： Li, Yixuan Wang, Wanyuan Xu, Weiyi Deng, Yanchen Wu, Weiwei Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications School of Computer Science and Engineering Southeast University Nanjing China School of Computer Science and Engineering Nanyang Technological University Singapore School of Computer Science and Engineering Southeast University Nanjing China

Global route planning (GRP) is a typical combinatorial optimization problem that has been solved for a variety of industrial purposes, such as traffic flow management, network routing, and conflict prevention. The goal of the GRP is to find a route for each trip query such that all queries have a minimum global travel time. The GRP problem is NP-hard and computationally challenging, even for medium-sized instances. However, in real-world GRP applications, such as Google Maps-based vehicle route guidance systems, there are always massive-scale trips issued simultaneously, and real-time response is required. Existing mathematical programming-based exact methods and heuristics struggle to balance the extremes of optimality and scalability. Considering that many closed-related GRP instances must be solved repeatedly, this paper explores a deep learning approach to learn real-time and efficient solutions for GRP. This paper first proposes a novel route-query factor graph (RQ-FG) to model the GRP problem, where the message-passing damped Max-sum (DMS) algorithm can be exploited to generate high-quality approximate solutions. A hybrid pruning method is proposed to accelerate solving the DMS. We further devise a route-query factor graph neural network (RQ-FGNN) based on the RQ-FG, which has the ability to return solutions in milliseconds. Experiments demonstrate that our method can generate high-quality solutions in massive-scale GRP instances in real-time. © 2024 International Foundation for Autonomous Agents and Multiagent Systems.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

LLaVA-Endo:a large language-and-vision assistant for gastrointestinal endoscopy

引用

Frontiers of computer science 2025年第4期19卷 121-123页

作者： Jieru YAO Xueran LI Qiang XIE Longfei HAN Yiwen JIA Nian LIU Dingwen ZHANG Junwei HAN School of Automation Northwestern Polytechnical UniversityXi’an 710072China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China AHU-IAI AI Joint Laboratory Anhui UniversityHefei 230039China Institute of Advanced Technology University of Science and Technology of ChinaHefei 230026China School of Computer and Artificial Intelligence Beijing Technology and Business UniversityBeijing 100048China Department of Gastroenterology The Third Affiliated Hospital of Anhui Medical University(Hefei First People’s Hospital)Hefei 230061China The Computer Vision Department Mohamed Bin Zayed University of Artificial IntelligenceMasdarAbu Dhabi 200120United Arab Emirates Xijing Hospital The Fourth Military Medical UniversityXi’an 710032China

1 Introduction Endoscopy plays a crucial role in the diagnoses and treatment of gastrointestinal(GI)diseases[1],as it helps to identify abnormalities,classify lesion,and determine treatment *** GI endoscopic examinations,physicians may encounter practical hindrances,i.e.,fatigue,stress,or limited experience,which can lead to erroneous *** intelligence(AI)-assisted GI endoscopy technology has emerged to address these limitations[2].

关键词： stress giendoscopy fatigue identify abnormalitiesclassify lesionidentification artificialintelligence

来源：评论

学校读者我要写书评

暂无评论

BAYESDIFF: ESTIMATING PIXEL-WISE UNCERTAINTY IN DIFFUSION VIA BAYESIAN INFERENCE 12

BAYESDIFF: ESTIMATING PIXEL-WISE UNCERTAINTY IN DIFFUSION VI...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Kou, Siqi Gan, Lei Wang, Dequan Li, Chongxuan Deng, Zhijie Qing Yuan Research Institute SEIEE Shanghai Jiao Tong University China Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods China School of Computer Science Fudan University China Shanghai Artificial Intelligence Laboratory China

Diffusion models have impressive image generation capability, but low-quality generations still exist, and their identification remains challenging due to the lack of a proper sample-wise metric. To address this, we propose BayesDiff, a pixel-wise uncertainty estimator for generations from diffusion models based on Bayesian inference. In particular, we derive a novel uncertainty iteration principle to characterize the uncertainty dynamics in diffusion, and leverage the last-layer Laplace approximation for efficient Bayesian inference. The estimated pixel-wise uncertainty can not only be aggregated into a sample-wise metric to filter out low-fidelity images but also aids in augmenting successful generations and rectifying artifacts in failed generations in text-to-image tasks. Extensive experiments demonstrate the efficacy of BayesDiff and its promise for practical applications. Our code is available at https://***/karrykkk/BayesDiff. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

MEMORY-ASSISTED SUB-PROTOTYPE MINING FOR UNIVERSAL DOMAIN ADAPTATION 12

MEMORY-ASSISTED SUB-PROTOTYPE MINING FOR UNIVERSAL DOMAIN AD...

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Lai, Yuxiang Zhou, Yi Liu, Xinghong Zhou, Tao School of Computer Science and Engineering Southeast University China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China School of Computer Science and Engineering Nanjing University of Science and Technology China

Universal domain adaptation aims to align the classes and reduce the feature gap between the same category of the source and target domains. The target private category is set as the unknown class during the adaptation process, as it is not included in the source domain. However, most existing methods overlook the intra-class structure within a category, especially in cases where there exists significant concept shift between the samples belonging to the same category. When samples with large concept shifts are forced to be pushed together, it may negatively affect the adaptation performance. Moreover, from the interpretability aspect, it is unreasonable to align visual features with significant differences, such as fighter jets and civil aircraft, into the same category. Unfortunately, due to such semantic ambiguity and annotation cost, categories are not always classified in detail, making it difficult for the model to perform precise adaptation. To address these issues, we propose a novel Memory-Assisted Sub-Prototype Mining (MemSPM) method that can learn the differences between samples belonging to the same category and mine sub-classes when there exists significant concept shift between them. By doing so, our model learns a more reasonable feature space that enhances the transferability and reflects the inherent differences among samples annotated as the same category. We evaluate the effectiveness of our MemSPM method over multiple scenarios, including UniDA, OSDA, and PDA. Our method achieves state-of-the-art performance on four benchmarks in most cases. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Matching Gains with Pays: Effective and Fair Learning in Multi-Agent Public Goods Dilemmas 27

Matching Gains with Pays: Effective and Fair Learning in Mul...

引用

27th European Conference on artificial intelligence, ECAI 2024

作者： Chen, Yitian Liu, Xuan Zhang, Shigeng Chen, Xinning Guo, Song School of Computer Science and Engineering Central South University China College of Computer Science and Electronic Engineering Hunan University China The Ministry of Education Key Laboratory of "Fusion Computing of Supercomputing and Artificial Intelligence" China Department of Computer Science and Engineering Hong Kong University of Science and Technology China

ISBN: (纸本)9781643685489

The training of multi-agent reinforcement learning (MARL) tasks with the public goods dilemma (PGD) is difficult because the selfish actions of individual agents for high personal rewards may reduce the collective utility of the whole group. Existing solutions to this problem, e.g., reward gifting or intrinsic rewards, although inducing cooperation among agents in small groups, cannot guarantee fairness among agents’ policies and fail to achieve optimal group utility in large-scale systems. In this paper, we propose F4PGD, an effective method to train large-scale MARL tasks with PGD in a decentralized manner, which is inspired by Adam’s equity theory that the match between a person’s payoff and his contribution is the key incentive for people to contribute to the common good. In F4PGD, a mechanism is designed to match an agent’s reward with its contribution, which suppresses agents from taking a free ride and meanwhile encourages well-learned agents to contribute to public goods. Experimental results show that F4PGD effectively learns optimal policies for the whole group and guarantees fairness among agents in several typical MARL tasks with PGD. © 2024 The Authors.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：