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

Task Prioritization in Multiagent Environments: A Novel Approach Using Nash Q-Learning

IEEE Transactions on Consumer Electronics 2025年

作者： Li, Kexin Hu, Yu Wang, Jielei Li, Lin Zhang, Shuyuan Luo, Guangchun Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China College of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

—With the rapid proliferation of smartphones and various terminal devices, edge computing has gained increasing importance in overcoming computational limitations and enhancing service quality through task offloading. However, most existing approaches handle tasks on a first-come, first-served basis, neglecting task prioritization, which is critical in real-world scenarios where tasks have different levels of urgency and resource requirements. This paper addresses the challenge of effective task prioritization in multi-agent task offloading by proposing a Nash Q-learning-based strategy. Our methodology involves optimizing task allocation decisions using Nash Q-learning to integrate Nash equilibrium principles, thereby enhancing adaptability and dynamic decision-making capabilities within a multi-agent environment. The proposed algorithm is evaluated through extensive simulations, comparing total delay, resource utilization, and task success rates across various task offloading strategies. The results demonstrate that our Nash Q-learning approach outperforms conventional techniques by dramatically lowering overall latency, optimizing resource allocation, and maintaining high task success rates. This work demonstrates the efficacy of Nash Q-learning for dynamically setting priorities for tasks in multi-agent edge computing environments, providing a robust framework for effective resource management and collaborative task completion. And also highlight the potential of Nash Q-learning in advancing intelligent task management in edge computing, suggesting its applicability in real-world, resource-constrained environments. © 2025 IEEE. All rights reserved,

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

WMAJL: Watcher-Mediated Attention Joint Learning Model for Multimodal Relation Extraction

WMAJL: Watcher-Mediated Attention Joint Learning Model for M...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yunrui Dong Guiduo Duan Tianxi Huang Yunhao Li School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China Chengdu Textile College College of Humanities and General Education Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In the domain of Multimodal Relation Extraction (MRE), we present the $\color{Red}{\text{W}}$atcher-$\color{Red}{\text{M}}$ediated $\color{Red}{\text{A}}$ttention $\color{Red}{\text{J}}$oint $\color{Red}{\text{L}}$earning Model ($\color{Red}{\text{WMAJL}}$), a novel approach addressing the challenges of modality alignment noise, cross-modal fusion disparity, preservation of textual relative position information, and the distinctiveness of classification labels. WMAJL employs an integrative framework leveraging contrastive learning and variational autoencoder constraints to mitigate modality alignment noise by prioritizing relevant semantic data and effectively reducing extraneous noise that does not contribute to the task. The model’s innovative architecture includes a mediator watcher, which facilitates enhanced cross-modal fusion by enabling nuanced information exchange between textual and visual modalities while preserving the unique characteristics of each modality. Additionally, the design of auxiliary tasks, such as Named Entity Recognition (NER), and output supervision constructs loss functions that preserve relative position information, ensuring a precise depiction of entity relationships throughout the multilayer encoding processes. A key differentiator of WMAJL is its label-centric self-information loss technique, inspired by InfoNCE, which trains the model to cluster similar relation labels in semantically coherent areas, thereby optimizing classification label uniqueness by discerning subtle differences among relation types. The synergistic application of these strategies has led to a significant enhancement of WMAJL’s performance, as evidenced by its state-of-the-art F1 score of $\color{Red}{84.93\%}$ on the MNRE dataset. This achievement surpasses existing benchmarks and sets a new standard for multimodal knowledge extraction, underscoring WMAJL’s potential to revolutionize the MRE landscape.

关键词： Resistance Visualization Technological innovation Noise Autoencoders Semantics Contrastive learning Nonhomogeneous media Speech processing Standards

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems Engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

Facial expression recognition via weighted group sparsity

引用

Frontiers of Computer Science 2017年第2期11卷 266-275页

作者： Hao ZHENG Xin GENG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University Nanjing 211171 China School of Computer Science and Engineering Southeast University Nanjing 211189 China

Considering the distinctiveness of different group features in the sparse representation, a novel joint multi- task and weighted group sparsity （JMT-WGS） method is pro- posed. By weighting popular group sparsity, not only the rep- resentation coefficients from the same class over their asso- ciate dictionaries may share some similarity, but also the rep- resentation coefficients from different classes have enough di- versity. The proposed method is cast into a multi-task frame- work with two-stage iteration. In the first stage, representa- tion coefficient can be optimized by accelerated proximal gra- dient method when the weights are fixed. In the second stage, the weights are computed via the prior information about their entropy. The experimental results on three facial expres- sion databases show that the proposed algorithm outperforms other state-of-the-art algorithms and demonstrate the promis- ing performance of the proposed algorithm.

关键词： facial expression recognition multi-task learning group sparsity

来源：评论

学校读者我要写书评

暂无评论

The research of human interaction recognition based on fusion features of key frame feature library

引用

International Journal of Information and Communication Technology 2021年第1期18卷 57-69页

作者： Zhang, Haiyan Gao, Shangbing Faculty of Computer and Software Engineering Huaiyin Institute of Technology Huai'an China Nanjing Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing China

Some issues such as computational complexity and low recognition accuracy still exist in human interaction recognition. In order to solve the problem, the paper has proposed innovative and effective method based on fixed features of key frame feature library. Firstly, GIST feature and HOG feature were extracted from the pre-processed videos. Secondly, training videos with different kinds of actions were clustered by the K-means algorithm respectively to get key frame feature of each action for constructing key frame feature library. And similarity measure was utilised to calculate the frequency of different key frames in every interactive video, and statistical histogram representation of interactive videos were obtained. Finally, the decision level fusion was achieved by using SVM classifier based on histogram intersection kernel to obtain impressive results on UT-interaction dataset. The correct recognition rate of the proposed algorithm is 85%, which indicates that the proposed algorithm is simple and effective than others. © 2021 Inderscience Enterprises Ltd.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Preserving model privacy for Federated Reinforcement Learning in Complementary Environments 23

Preserving model privacy for Federated Reinforcement Learnin...

引用

15th International Conference on Machine Learning and computing, ICMLC 2023

作者： Xuan, Pengyu Chen, Aiguo Sha, Zexin University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China

ISBN: (纸本)9781450398411

Federated reinforcement learning (FRL) uses data from multiple partners interacting with the environment to train a global decision model while maintaining data privacy. In specific situations, it is necessary to protect not only data privacy but also model privacy. That is, our objective is to collaboratively train a global model that can be used privately and independently by the initiator. We refer to this need for model privacy preservation as model monopolization. It allows the task initiator to ensure the privacy of the model during the training process and to own the trained model alone. To the best of our knowledge, model monopolization protection in Federated Reinforcement Learning has not been studied. We propose monopolized federated reinforcement learning in complementary environments via function transformation. We also provide contribution metrics to ensure the sustainability of monopolized federated reinforcement learning and to provide a quantitative basis for task initiators to give back to task participants. The experimental results show that our method achieved model monopolization by training agents in the Grid-world. © 2023 ACM.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Plausible Heterogeneous Graph k-Anonymization for Social Networks

引用

Tsinghua Science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

Structure-aware Table-to-Text Generation with Prefix-tuning 23

Structure-aware Table-to-Text Generation with Prefix-tuning

引用

2023 4th International Conference on Control, Robotics and Intelligent System, CCRIS 2023

作者： Liu, Cencen Xu, Yi Yin, Wen Zheng, Dezhang University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Sichuan Chengdu China

ISBN: (纸本)9798400708190

Table-to-text generation is designed to generate descriptive natural language for structured tables that conforms to objective facts and follows the source data. The current challenge in this field is to capture the structural information of the table and improve the quality of the generated text. The existing sequence-to-sequence approach is to linearize the table, which leads to miss captured structure information and is not conducive to the model learning contextual semantics. In this paper, we introduce structural-aware self-attention, which focuses on table structure to capture cell relationships between the same row or column. In this way, the generated descriptive text can more accurately reflect the correlation between the cells in the table, discarding irrelevant information. In order to adapt the pre-trained language model to the table-to-text generation task, we introduce prefix-tuning. Traditional fine-tuning methods update all model parameters, which leads to increased training costs. In contrast, using prefix-tuning for a more lightweight approach can improve model performance considerably. Attaching continuous prompts to tokens helps the model better understand the structure and semantics of the input sequence. All of our models are extended based on T5 and have strong competitiveness in the ToTTo dataset and Hitab dataset compared with several classical baselines. © 2023 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

First-Order Meta-Learning in Node Classification with Graph Convolutional Network 4

First-Order Meta-Learning in Node Classification with Graph ...

引用

4th International Conference on Artificial Intelligence and big data, ICAIBD 2021

作者： Cao, Jing Xu, Yi Song, Xuening School of Information and Software Engineering University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China

ISBN: (纸本)9780738131702

In recent years, research on graph representation learning within graph neural networks has made great progress. Among them, graph convolutional neural networks (GCN), which is based on spectral domain, have drawn great attention and become one of the mainstream graph embedding approaches. However, few-shot learning on graphs has little related work, as we know. Toward this problem, we propose a meta-learning method on graphs, FOML-GCN (First order meta-learning on GCN), aimed to be applied in various kinds of models of graph convolutional networks. As many common approaches in meta-learning, FOML-GCN involves two phases, meta-training and meta-testing. By learning the potential Knowledge from a small number of samples in existing classes during meta-training, our method enhances the ability in node classification of the base model by training within new few data that only appear in the meta-testing step. The experiment on two benchmark datasets shows that our FOML-GCN performs better than base GCN and other models of graph network in few-shot node classification tasks. © 2021 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Truncated Nuclear Norm Based Low Rank Embedding 12th

Truncated Nuclear Norm Based Low Rank Embedding

引用

12th Chinese Conference on Biometric Recognition, CCBR 2017

作者： Zhang, Fanlong Chang, Heyou Yang, Guowei Yang, Zhangjing Wan, Minghua School of Technology Nanjing Audit University Nanjing211815 China Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University Nanjing211171 China

ISBN: (纸本)9783319699226

Dimensionality reduction, also called feature extraction, is an important issue in pattern recognition. However, many existing dimensionality reduction methods, such as principal component analysis, fail when there exist noises in data, especially for noise caused by outliers or corruption. Recently, a robust method, named low-rank embedding (LRE) is proposed, which uses the nuclear norm for characterizing the low rank structure hided in the data. However, one major limitation of the nuclear norm is that each singular value is treated equally, since the nuclear norm is defined as the sum of all singular values. Thus the rank function may not be well approximated in practice. To overcome this drawback, this paper presents a truncated nuclear norm based low rank embedding (Truncated-LRE). The truncated nuclear norm can approximate the rank function more accurately than nuclear norm. Experimental results show encouraging results of the proposed methods in comparison with the state-of-the-art matrix dimensionality reduction methods. © 2017, Springer International Publishing AG.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：