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

IEEE International Conference on Robotics and Automation (ICRA)

作者： Xiao Ma Wu-Jun Li Department of Computer Science and Technology National Key Laboratory for Novel Software Technology Nanjing University Nanjing PRC

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Offline reinforcement learning (RL) has been shown to be successfully modeled as a sequence modeling problem, drawing inspiration from the success of Transformers. Offline RL is often limited by the quality of the offline dataset, so offline-to-online RL is a more realistic setting. Online decision transformer (ODT) is an effective and representative sequence modeling-based offline-to-online RL method. Despite its effectiveness, ODT still suffers from the sample inefficiency problem during the online fine-tuning phase. This sample inefficiency problem arises because the agent treats all state-action pairs in the replay buffer equally when trying to learn from the replay buffer. In this paper, we propose a simple yet effective method, called weighting online decision transformer with episodic memory (WODTEM), to improve sample efficiency. We first attempt to introduce an episodic memory (EM) mechanism into the sequence modeling-based RL methods. By utilizing the EM mechanism, we propose a novel training objective with a weighting function, based on ODT, to improve sample efficiency. Experimental results on multiple tasks show that WODTEM can improve sample efficiency.

关键词： Training Memory management Reinforcement learning Transformers Task analysis Robotics and automation

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey on Communication-Efficient Federated Learning in Mobile Edge Environments

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Jia, Ninghui Qu, Zhihao Ye, Baoliu Wang, Yanyan Hu, Shihong Guo, Song Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Nanjing211100 China Nanjing University State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing210023 China The Hong Kong University of Science and Technology Department of Computer Science and Engineering Kowloon Hong Kong

In traditional centralized machine learning, transmitting raw data to a cloud center incurs high communication costs and raises privacy concerns. This is particularly challenging in mobile edge environments, where devices are dynamic and resource-constrained. Federated Learning (FL) addresses these issues by allowing devices to train models locally and upload parameters to a central server without sharing local data. However, limited wireless channel resources and dynamic transmission performance make communication overhead a major bottleneck of FL in mobile edge environments. Concerning this challenge, this survey provides a comprehensive summary of methods to improve communication efficiency in FL, focusing on: 1) minimizing communication complexity to reduce total transmission volume, 2) scheduling resources appropriately to improve training efficiency, 3) utilizing over-the-air computation (OTA) to integrate computation into communication for accommodating the computation/communication characteristics of FL in mobile edge environments. Thus, this work analyzes research from the perspective of convergence and data heterogeneity to reduce communication rounds by optimizing algorithm performance. We hope that this survey could offer insights into communication-efficient FL for future research. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic and Attentive Network for Unsupervised Video Summarization

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2022年第2期18卷 1–21页

作者： Zhong, Sheng-Hua Lin, Jingxu Lu, Jianglin Fares, Ahmed Ren, Tongwei College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical Engineering Computer Systems Engineering Program Faculty of Engineering at Shoubra Benha University Cairo Egypt State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

With the rapid growth of video data, video summarization is a promising approach to shorten a lengthy video into a compact version. Although supervised summarization approaches have achieved state-of-the-art performance, they require frame-level annotated labels. Such an annotation process is time-consuming and tedious. In this article, we propose a novel deep summarization framework named Deep Semantic and Attentive Network for Video Summarization (DSAVS) that can select the most semantically representative summary by minimizing the distance between video representation and text representation without any frame-level labels. Another challenge associated with video summarization tasks mainly originates from the difficulty of considering temporal information over a long time. Long Short-Term Memory (LSTM) performs well for temporal dependencies modeling but does not work well with long video clips. Therefore, we introduce a self-attention mechanism into our summarization framework to capture the long-range temporal dependencies among the frames. Extensive experiments on two popular benchmark datasets, i.e., SumMe and TVSum, show that our proposed framework outperforms other state-of-the-art unsupervised approaches and even most supervised methods. © 2022 Association for Computing Machinery.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PFedCS: A Personalized Federated Learning Method for Enhancing Collaboration among Similar Classifiers 39

PFedCS: A Personalized Federated Learning Method for Enhanci...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wu, Siyuan Jia, Yongzhe Liu, Bowen Xiang, Haolong Xu, Xiaolong Dou, Wanchun State Key Laboratory for Novel Software Technology School of Computer Science Nanjing University China School of Software Nanjing University of Information Science and Technology China

ISBN: (纸本)157735897X

Personalized federated learning (PFL) has recently gained significant attention for its capability to address the poor convergence performance on highly heterogeneous data and the lack of personalized solutions of traditional federated learning (FL). Existing mainstream approaches either perform personalized aggregation based on a specific model architecture to leverage global knowledge or achieve personalization by exploiting client similarities. However, the former overlooks the discrepancies in client data distributions by indiscriminately aggregating all clients, while the latter lacks fine-grained collaboration of classifiers relevant to local tasks. In view of this challenge, we propose a Personalized Federated learning method for Enhancing Collaboration among Similar Classifiers (PFedCS), which aims at improving the client’s accuracy on local tasks. Concretely, it is achieved by leveraging awareness of the client classifier similarities to address the above problems. By iteratively measuring the distance of the classifier parameters between clients and clustering with each client as a cluster center, the central server adaptively identifies the collaborating clients with similar data distributions. In addition, a distance-constrained aggregation method is designed to generate customized collaborative classifiers to guide local training. As a result, extensive experimental evaluations conducted on various datasets demonstrate that our method achieves state-of-the-art performance. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第3期4卷 1-23页

作者： Liu, Shengcai Lu, Ning Hong, Wenjing Qian, Chao Tang, Ke Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen College of Engineering South Tower 1088 Xueyuan Avenue Guangdong Shenzhen518055 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong999077 Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 10F Zhizhen Building Canghai Campus 3688 Nanhai Avenue Guangdong Shenzhen China National Key Laboratory for Novel Software Technology School of Artificial Intelligence Nanjing University Nanjing International College Area Xianlin Campus 163 Xianlin Avenue Jiangsu Nanjing China

The field of adversarial textual attack has significantly grown over the past few years, where the commonly considered objective is to craft adversarial examples (AEs) that can successfully fool the target model. However, the imperceptibility of attacks, which is also essential for practical attackers, is often left out by previous studies. In consequence, the crafted AEs tend to have obvious structural and semantic differences from the original human-written text, making them easily perceptible. In this work, we advocate leveraging multi-objectivization to address such an issue. Specifically, we reformulate the problem of crafting AEs as a multi-objective optimization problem, where the attack imperceptibility is considered as an auxiliary objective. Then, we propose a simple yet effective evolutionary algorithm, dubbed HydraText, to solve this problem. HydraText can be effectively applied to both score-based and decision-based attack settings. Exhaustive experiments involving 44,237 instances demonstrate that HydraText consistently achieves competitive attack success rates and better attack imperceptibility than the recently proposed attack approaches. A human evaluation study also shows that the AEs crafted by HydraText are more indistinguishable from human-written text. Finally, these AEs exhibit good transferability and can bring notable robustness improvement to the target model by adversarial training. © 2024 Copyright held by the owner/author(s).

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Practical, Automated Scenario-based Mobile App Testing

arXiv

引用

arXiv 2024年

作者： Yu, Shengcheng Fang, Chunrong Du, Mingzhe Ding, Zimin Chen, Zhenyu Su, Zhendong The State Key Laboratory for Novel Software Technology Nanjing University China The Department of Computer Science ETH Zurich Switzerland

The importance of mobile application (app) quality assurance is increasing with the rapid development of the mobile Internet. Automated test generation approaches, as a dominant direction of app quality assurance, follow specific models or strategies, targeting at optimizing the code coverage. Such approaches lead to a huge gap between testing execution and app business logic. Test scripts developed by human testers consider business logic by focusing on testing scenarios. Due to the GUI-intensive feature of mobile apps, human testers always understand app GUI to organize test scripts for scenarios. This inspires us to utilize domain knowledge from app GUI understanding for scenario-based test generation. In this paper, we propose a novel approach, SCENTEST, for scenario-based mobile app testing with event knowledge graph (EKG) via GUI image understanding. SCENTEST tries to start automated testing by imitating human practices and integrating domain knowledge into scenario-based mobile app testing, realizing fully automated testing on target testing scenarios for the first time. SCENTEST extracts four kinds of entities and five kinds of corresponding relationships from crowdsourced test reports, where the test events and app GUI information are presented, and constructs the EKGs for specific scenarios. Then, SCENTEST conducts test generation for specific scenarios on different apps with the guidance of EKG with the combination consideration of app current state and testing context. We conduct an evaluation on SCENTEST on different aspects. The results show that the test generation of SCENTEST on the basis of EKG is effective, and SCENTEST reveals 150+ distinct real-world bugs in specific scenarios compared with representative baselines. © 2024, CC BY-NC-ND.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

SignGraph: A Sign Sequence is Worth Graphs of Nodes

SignGraph: A Sign Sequence is Worth Graphs of Nodes

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Shiwei Gan Yafeng Yin Zhiwei Jiang Hongkai Wen Lei Xie Sanglu Lu State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science The University of Warwick UK

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Despite the recent success of sign language research, the widely adopted CNN-based backbones are mainly migrated from other computer vision tasks, in which the contours and texture of objects are crucial for identifying objects. They usually treat sign frames as grids and may fail to capture effective cross-region features. In fact, sign language tasks need to focus on the correlation of different regions in one frame and the interaction of different regions among adjacent frames for identifying a sign sequence. In this paper, we propose to represent a sign sequence as graphs and introduce a simple yet effective graph-based sign language processing architecture named SignGraph, to extract crossregion features at the graph level. SignGraph consists of two basic modules: Local Sign Graph (LSG) module for learning the correlation of intra-frame cross-region features in one frame and Temporal Sign Graph (TSG) module for tracking the interaction of inter-frame cross-region features among adjacent frames. With LSG and TSG, we build our model in a multiscale manner to ensure that the representation of nodes can capture cross-region features at different granularities. Extensive experiments on current public sign language datasets demonstrate the superiority of our SignGraph model. Our model achieves very competitive performances with the SOTA model, while not using any extra cues. Code and models are available at: https://***/gswycf/SignGraph.

关键词： Sign language computer vision Correlation Codes Computational modeling computer architecture Assistive technologies

来源：评论

学校读者我要写书评

暂无评论

Model Checking for Probabilistic Multiagent Systems

引用

Journal of computer science & technology 2023年第5期38卷 1162-1186页

作者：付辰 Andrea Turrini 黄小炜宋磊冯元张立军 State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Institute of Intelligent Software Guangzhou 511455China Department of Computer Science University of LiverpoolLiverpool L693BXU.K Microsoft Research Beijing 100190China Centre for Quantum Software and Information University of Technology SydneySydney 2007Australia

In multiagent systems,agents usually do not have complete information of the whole system,which makes the analysis of such systems *** incompleteness of information is normally modelled by means of accessibility relations,and the schedulers consistent with such relations are called *** this paper,we consider probabilistic multiagent systems with accessibility relations and focus on the model checking problem with respect to the probabilistic epistemic temporal logic,which can specify both temporal and epistemic ***,the problem is undecidable in *** show that it becomes decidable when restricted to memoryless uniform ***,we present two algorithms for this case:one reduces the model checking problem into a mixed integer non-linear programming(MINLP)problem,which can then be solved by Satisfiability Modulo Theories(SMT)solvers,and the other is an approximate algorithm based on the upper confidence bounds applied to trees(UCT)algorithm,which can return a result whenever *** algorithms have been implemented in an existing model checker and then validated on *** experimental results show the efficiency and extendability of these algorithms,and the algorithm based on UCT outperforms the one based on MINLP in most cases.

关键词： probabilistic multiagent system model checking uniform scheduler probabilistic epistemic temporal logic

来源：评论

学校读者我要写书评

暂无评论

Spatial-temporal Consistency based Crowd Emotion Recognition 26

Spatial-temporal Consistency based Crowd Emotion Recognition

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhao, Chuanmiao Zhang, Guijuan Lv, Lei Liu, Hong Lu, Dianjie Shandong Normal University School of Information Science and Engineering Jinan250358 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250358 China State Key Laboratory of High-end Server & Storage Technology Jinan250101 China

ISBN: (纸本)9798350331684

In crowd evacuation scenarios, it is an effective way to ensure evacuation safety by recognizing real crowd emotions and then taking measures such as emotional infection to reduce crowd panic. However, factors such as distance, exposure, angle, and occlusion can lead to incomplete face expression information collection, thus failing to accurately identify crowd emotions. Therefore, it is still a very challenging problem to recognize individual emotions in the case of incomplete face expression information collection, and thus accurately identify crowd emotions during evacuation. To solve this problem, we propose a spatial-temporal consistency-based crowd emotion recognition method to accurately identify the real emotions of the crowd. First, for video frames that can capture the complete facial expression information, we use the residual network to accurately identify the individual emotion values in each frame. For video frames that cannot capture the complete facial expression information, we propose an individual emotion calculation model based on spatial-temporal consistency to calculate the individual emotion values in each frame. Second, we define the crowd panic level and obtain the real crowd emotion by calculation. Finally, we implement an end-to-end crowd panic emotion recognition system to verify our method. The experimental results show that the method can accurately calculate the crowd panic level, which is important for guiding crowd evacuation. © 2023 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Risk Region-based Prediction Model for the Epidemic Spreading 26

Risk Region-based Prediction Model for the Epidemic Spreadin...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Li, Fuwei Lu, Dianjie An, Baoxu Zhang, Guijuan Shandong Normal University School of Information Science and Engineering Jinan250358 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250358 China State Key Laboratory of High-end Server & Storage Technology Jinan250101 China

ISBN: (纸本)9798350331684

Studying the spread process of epidemics in the crowd is a significant topic, which can help to take measures in advance to avoid epidemic spread and reduce the losses of life and property of the general public. However, this is a challenging problem that how to capture the spatio-temporal characteristics of the epidemic spreading. In this paper, we propose a risk region-based prediction model to characterize the spread feature. First, we propose a risk region-based spread model to describe the spatial relationship between individuals by dividing risk regions and assigning different spread characteristics to different risk regions. Second, we develop a spatio-temporal point process-based infection intensity quantification method to describe the variation of epidemic spread characteristics over time in different risk regions in the form of intensity. Then, we propose a long short-term memory (LSTM) based intensity function prediction method to solve the corresponding intensity and predict the spread process by the spatio-temporal point process (STPP). Finally, we implement an epidemic spreading simulation platform to verify our method and visualize the experimental results. The proposed model is expected to provide guidance for predicting the spread of epidemics. © 2023 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：