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

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wang, Jihe Wu, Ying Wang, Danghui School of Computer Science Northwestern Polytechnical University Xi'an China Engineering Research Center of Embedded System Integration Ministry of Education Northwestern Polytechnical University Xi'an China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9798400706011

Training big graph neural networks (GNNs) in distributed systems is quite time-consuming mainly because of the ubiquitous aggregate operations that involve a large amount of cross-partition communication for collecting embeddings/gradients during the forward and backward propagation. To reduce the volume of the communication, some recent approaches focused on decaying each of connections via sampling, quantifying, or delaying until satisfactory trade-off are obtained between volume and accuracy. However, when applied to popular GNNs, those approaches are found to be bounded by a common volume/accuracy Pareto frontier which shows that the decaying for individual connection cannot further accelerate the aggregate of training. In this work, SC-GNN, a semantic compression of the cross-partition communication, is proposed to concentrate a group of connections as a high-level semantics and transmit to a target partition. Since carrying the overall intent of a group, the semantics can keep transferring the interactions, i.e., embeddings/gradients, between a pair of remote partitions until GNN models converge. In addition, a connection-pattern based differential optimization is proposed to further prune those weak connections, while guaranteeing the training accuracy. The results show that, for multi-field datasets, the compression rate of SC-GNN is 40.8 × higher than SOTA methods and the epoch time is reduced to 31.8% on average. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Research of Improved TD3 Robotic Arm Path Planning using Evolutionary Algorithm 5

Research of Improved TD3 Robotic Arm Path Planning using Evo...

引用

5th World Robot Conference Symposium on Advanced Robotics and Automation, WRC SARA 2023

作者： Zhang, Feng Xiong, Jianqiang Yuan, Shuai Wen, Ke Shenyang Jianzhu University Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center School of Electrical and Control Engineering Shenyang110168 China Shenyang Jianzhu University School of Electrical and Control Engineering Shenyang110168 China Shenyang Jianzhu University School of Computer Science and Engineering Shenyang110168 China

ISBN: (纸本)9798350307320

Nowadays, application of automated intelligent robot arm devices to improve industrial production efficiency has become a popular research field in the world. The previous off-line path planning method of robotic arm has the inadequacies of low efficiency and slow speed. Although the deep reinforcement learning has accomplished many achievements in the path planning of control manipulator, there are still some problems such as long training time and low planning accuracy. To solve the abovementioned issues, we propose an improved Twin Delayed Deep Deterministic policy gradient (TD3) algorithm (Improved Cross-Entropy Method-TD3: ICEM-TD3) for the path planning of the robotic arm. First, this paper combines evolutionary strategies with TD3 to generate action networks. Then the exploration of TD3 algorithm in the action space is replaced by the exploration in the parameter space. In addition, this paper designs a new reward function to weaken the redundancy of planning and accelerate the convergence speed of training. Finally, the Gazebo simulator is adopted to verify the proposed algorithm, and the results illustrate that the proposed algorithm can greatly improve the accuracy of the path planning of the manipulator using deep reinforcement learning. © 2023 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Survey on Evolutionary Feature Selection in Multi-Label Classification

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Hancer, Emrah Xue, Bing Zhang, Mengjie Victoria University of Wellington Center for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Burdur Mehmet Akif Ersoy University Department of Software Engineering Burdur15039 Turkey

Multi-label classification (MLC) involves assigning multiple labels to each instance from a predefined set of labels. With the increasing prevalence of multi-label datasets in real-world problems, MLC has become a popular area of research. These datasets frequently contain irrelevant, redundant, or noisy features, highlighting the importance of feature selection in MLC tasks. As a result, numerous multi-label feature selection (MLFS) approaches have been introduced in the literature. Given their effective search capabilities, evolutionary computation (EC) techniques have been adopted to develop MLFS approaches. However, there is a notable absence of a comprehensive survey dedicated to EC-based MLFS approaches to MLC tasks. Although few attempts have been made to address this gap, they do not provide detailed discussions on EC-based approaches. They also tend to overlook the strengths and weaknesses of existing approaches, especially regarding search, optimization, and evaluation processes. This paper aims to fill this gap by presenting a comprehensive survey of EC-based MLFS approaches, focusing on the latest advancements, current challenges, and future directions. To be specific, we categorize EC-based MLFS approaches based on different criteria and provide detailed descriptions for each category. © 1997-2012 IEEE.

关键词： Evolutionary Computation Multi-Label Classification Multi-Label Feature Selection Multi-Objective Optimization

来源：评论

学校读者我要写书评

暂无评论

The KIND dataset: A Social Collaboration Approach for Nuanced Dialect data Collection 18

The KIND Dataset: A Social Collaboration Approach for Nuance...

引用

18th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2024 - Student Research Workshop, SRW 2024

作者： Yamani, Asma Z. Alziyady, Raghad AlYami, Reem Albelali, Salma A. Abouhagar, Leina Almulhim, Jawharah Alsulami, Amjad Alfarraj, Motaz Al-Zaidy, Rabeah Department of Information and Computer Science King Fahd University of Petroleum & Minerals Saudi Arabia Center for Integrative Petroleum Research CIPR King Fahd University of Petroleum & Minerals Saudi Arabia Department of Electrical Engineering King Fahd University of Petroleum & Minerals Saudi Arabia SDAIA-KFUPM Joint Research Center for AI King Fahd University of Petroleum & Minerals Saudi Arabia Preparatory Year Program King Fahd University of Petroleum & Minerals Saudi Arabia Department of Computer Science Imam Abdulrahman Bin Faisal University Saudi Arabia Saudi Data & AI Authority Saudi Arabia

ISBN: (纸本)9798891760905

Nuanced dialects are a linguistic variant that pose several challenges for NLP models and techniques. One of the main challenges is the limited amount of datasets to enable extensive research and experimentation. We propose an approach for efficiently collecting nuanced dialectal datasets that are not only of high quality, but are versatile enough to be multipurpose as well. To test our approach we collect the KIND corpus, which is a collection of fine-grained Arabic dialect data. The data is short texts, and unlike many nuanced dialectal datasets, it is curated manually through social collaboration efforts as opposed to being crawled from social media. The collaborative approach is incentivized through educational gamification and competitions for which the community itself benefits from the open source dataset. Our approach aims to achieve: (1) coverage of dialects from under-represented groups and fine-grained dialectal varieties, (2) provide aligned parallel corpora for translation between Modern Standard Arabic (MSA) and multiple dialects to enable translation and comparison studies, (3) promote innovative approaches for nuanced dialect data collection. We explain the steps for the competition as well as the resulting datasets and the competing data collection systems. The KIND dataset is shared with the research community. © 2024 Association for Computational Linguistics.

关键词： data acquisition

来源：评论

学校读者我要写书评

暂无评论

Graph Prompt Clustering

引用

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

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning530219 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Beijing100816 China South China Technology Commercialization Center Guangzhou510006 China Guangdong University of Technology School of Information Engineering Guangzhou510006 China Guangdong Key Laboratory of Information Security Technology Guangzhou510033 China Ministry of Education Beijing100044 China

Due to the wide existence of unlabeled graph-structured data (e.g., molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods. © 1979-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of VADER and RoBERTa Methods for Smart Retail Customer Sentiment on Amazon Go Store

Performance Analysis of VADER and RoBERTa Methods for Smart ...

引用

Modeling & E-Information Research, Artificial Learning and Digital Applications (ICMERALDA), International Conference on

作者： Rissa Rahmania Husni Iskandar Pohan Annisa Istiqomah Arrahmah Suryo Adhi Wibowo Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia AI Center School of Electrical Engineering Telkom University Bandung Indonesia

The implementation of intelligent systems in the retail industry is still limited in various regions of the world. Amazon Go currently has four stores, located in the Seattle area, and has received customer reviews based on ratings that can be seen in the Google Maps feature. This paper aims to analyze Amazon Go customer sentiment through reviews and star ratings obtained from Google Maps reviews. First, we collect and prepare data from Google Maps Review. Second, we perform experiments and analysis of the VADER and Robustly Optimized BERT Pretraining Approach (RoBERTa) and compare both methods, which are represented by graphs. Lastly, both methods are evaluated in terms of precision, recall, F1-Score, and accuracy. Sentiment analysis from Amazon Go shows that most customers give it a rating of 5.0. Supported by text data from customer comments containing positive, neutral, and negative sentiments showing the relation between the rating given and the sentiment of the comment by the compound score from the results of the VADER method. Sentiment analysis on smart retail from the Amazon Go Store has provided insight and future challenges in the scope of smart retail implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FDGLib: A Communication Library for Efficient Large-Scale Graph Processing in FPGA-Accelerated data centers

引用

Journal of computer science & Technology 2021年第5期36卷 1051-1070页

作者： Yu-Wei Wu Qing-Gang Wang Long Zheng Xiao-Fei Liao Hai Jin Wen-Bin Jiang Ran Zheng Kan Hu National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

With the rapid growth of real-world graphs,the size of which can easily exceed the on-chip(board)storage capacity of an accelerator,processing large-scale graphs on a single Field Programmable Gate Array(FPGA)becomes *** multi-FPGA acceleration is of great necessity and *** cloud providers(e.g.,Amazon,Microsoft,and Baidu)now expose FPGAs to users in their data centers,providing opportunities to accelerate large-scale graph *** this paper,we present a communication library,called FDGLib,which can easily scale out any existing single FPGA-based graph accelerator to a distributed version in a data center,with minimal hardware engineering *** provides six APIs that can be easily used and integrated into any FPGA-based graph accelerator with only a few lines of code *** the torus-based FPGA interconnection in data centers,FDGLib also improves communication efficiency using simple yet effective torus-friendly graph partition and placement *** interface FDGLib into AccuGraph,a state-of-the-art graph *** results on a 32-node Microsoft Catapult-like data center show that the distributed AccuGraph can be 2.32x and 4.77x faster than a state-of-the-art distributed FPGA-based graph accelerator ForeGraph and a distributed CPU-based graph system Gemini,with better scalability.

关键词： data center accelerator graph processing distributed architecture communication optimization

来源：评论

学校读者我要写书评

暂无评论

AgentGroupChat: An Interactive Group Chat Simulacra For Better Eliciting Emergent Behavior

arXiv

引用

arXiv 2024年

作者： Gu, Zhouhong Zhu, Xiaoxuan Guo, Haoran Zhang, Lin Cai, Yin Shen, Hao Chen, Jiangjie Ye, Zheyu Dai, Yifei Gao, Yan Hu, Yao Feng, Hongwei Xiao, Yanghua Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China Rhine AI China School of Electric and Electronic Engineering Shanghai University of Engineering and Science China Xiaohongshu Inc. China Fudan-Aishu Cognitive Intelligence Joint Research Center China

Language significantly influences the formation and evolution of Human emergent behavior, which is crucial in understanding collective intelligence within human societies. Considering that the study of how language affects human behavior needs to put it into the dynamic scenarios in which it is used, we introduce AGENTGROUPCHAT in this paper, a simulation that delves into the complex role of language in shaping collective behavior through interactive debate scenarios. Central to this simulation are characters engaging in dynamic conversation interactions. To enable simulation, we introduce the Verbal Strategist Agent, utilizing large language models to enhance interaction strategies by incorporating elements of persona and action. We set four narrative scenarios based on AGENTGROUPCHAT to demonstrate the simulation’s capacity to mimic complex language use in group dynamics. Evaluations focus on aligning agent behaviors with human expectations and the emergence of collective behaviors within the simulation. Results reveal that emergent behaviors materialize from a confluence of factors: a conducive environment for extensive information exchange, characters with diverse traits, high linguistic comprehension, and strategic adaptability. During discussions on "the impact of ai on humanity" in AGENTGROUPCHAT simulation, philosophers commonly agreed that "ai could enhance societal welfare with judicious limitations" and even come to a conclusion that "the essence of true intelligence encompasses understanding the necessity to constrain self abilities". Additionally, in the competitive domain of casting for primary roles in films in AGENTGROUPCHAT, certain actors were ready to reduce their remuneration or accept lesser roles, motivated by their deep-seated desire to contribute to the project. These behaviors often lead to unanticipated yet coherent perspectives on topics like ai’s societal impact, underscoring the simulation’s effectiveness in capturing the nuanced role of

关键词： Philosophical aspects

来源：评论

学校读者我要写书评

暂无评论

The Other Side of the Coin: Unveiling the Downsides of Model Aggregation in Federated Learning from a Layer-peeled Perspective

arXiv

引用

arXiv 2025年

作者： Zhu, Guogang Liu, Xuefeng Niu, Jianwei Tang, Shaojie Wu, Xinghao School of Computer Science and Engineering Beihang University Beijing China Department of Management Science and Systems School of Management Center for AI Business Innovation University at Buffalo BuffaloNY United States

In federated learning (FL), model aggregation is a critical step by which multiple clients share their knowledge with one another. However, it is also widely recognized that the aggregated model, when sent back to each client, performs poorly on local data until after several rounds of local training. This temporary performance drop can potentially slow down the convergence of the FL model. Most research in FL regards this performance drop as an inherent cost of knowledge sharing among clients and does not give it special attention. While some studies directly focus on designing techniques to alleviate the issue, an in-depth investigation of the reasons behind this performance drop has yet to be conducted. To address this gap, we conduct a layer-peeled analysis of model aggregation across various datasets and model architectures. Our findings reveal that the performance drop can be attributed to two major consequences of the aggregation process: (1) it disrupts feature variability suppression in deep neural networks (DNNs), and (2) it weakens the coupling between features and subsequent parameters. Based on these findings, we propose several simple yet effective strategies to mitigate the negative impacts of model aggregation while still enjoying the benefit it brings. To the best of our knowledge, our work is the first to conduct a layer-peeled analysis of model aggregation, potentially paving the way for the development of more effective FL algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Tensor Levenberg-Marquardt Algorithm for Multi-Relational Traffic Prediction

引用

IEEE Transactions on Vehicular Technology 2023年第9期72卷 11275-11290页

作者： Chang, Shih Yu Wu, Hsiao-Chun Kuan, Yen-Cheng Wu, Yiyan San Jose State University Department of Applied Data Science San JoseCA95192 United States Louisiana State University School of Electrical Engineering and Computer Science Baton RougeLA70803 United States Yuan Ze University Innovation Center for AI Applications Chungli32003 Taiwan International College of Semiconductor Technology Hsinchu30010 Taiwan Communications Research Centre Canada OttawaONK2H 8S2 Canada

Traffic prediction serves as a crucial role in intelligent transportation systems for applications including routing planning and traffic control. With the advances of sensor technologies and Internet of Things (IoTs), the exploitation of traffic data motivates us to reformulate the traffic-state prediction problem based on the big-data characteristics. In order to infer multifarious traffic information, the standard one/two-relational traffic data in the vector/matrix form needs to be expanded to multi-relational traffic data in an arbitrary tensor form. However, none of the existing approaches is capable of performing traffic prediction by characterizing and tracking the inherent multi-relational nonlinear dynamics which are often encountered in the realistic time-series analysis. Furthermore, there hardly exist convergence studies on convergence condition and convergence speed pertinent to the existing traffic-prediction methods. In order to combat the aforementioned challenges, we propose a new tensor Levenberg-Marquadt algorithm (TLMA) to conduct the multi-relational nonlinear regression for traffic prediction involving tensorized data. Meanwhile, we also derive the lower-bound of the number of iterations required to make the error-norm below a specified tolerance for global convergence. Besides, we derive the conditions for our proposed TLMA to converge to the optimal solution. The convergence rates with respect to different nonlinear cost functions have been derived theoretically. The computational- and memory-complexities of our proposed new TLMA are studied as well. Finally, numerical experiments are conducted to evaluate the traffic prediction performance of our proposed new TLMA over real traffic data in comparison with other existing multi-relational prediction methods. © 1967-2012 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：