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

TraCemop: Towards Federated Learning with Traceable Contribution Evaluation and Model Ownership Protection

IEEE Transactions on Mobile Computing 2025年

作者： Liu, Jingwei Zhou, Zihan Sun, Rong Liu, Lei Lu, Rongxing Dustdar, Schahram Niyato, Dusit Ministry of Education Engineering Research Center of Blockchain Technology Application and Evaluation China Xidian University Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'an710071 China Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Xidian University Guangzhou Institute of Technology Guangzhou510555 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Queen's University School of Computing KingstonONK7L 2N8 Canada TU Wien Distributed Systems Group Austria UPF ICREA Barcelona Spain Nanyang Technological University School of Computer Science and Engineering Singapore

Federated Learning (FL) allows multiple clients to collaboratively train machine learning models without the need to share their local private data. As a result, it can effectively address the issue of data fragmentation. Nevertheless, insufficient evaluation of individual contributions and the lack of protections for both the intellectual property rights (IPR) of models and client privacy can greatly reduce clients' motivations in federated training. To address these challenges, this paper introduces the Traceable Contribution Evaluation and Model Ownership Protection (TraCemop) framework for federated learning, which allows each client to swiftly assess the contributions of others in each round, with integrated support for the traceability of evaluation results. To safeguard the intellectual property of models, a collective watermark is embedded in the global model. Additionally, a secure mechanism for verifying model ownership is also available in case of disputes. security analysis indicates that TraCemop is capable of resisting data reconstruction attacks as well as various types of model copyright infringements. Finally, we evaluate the proposed framework using two commonly-used datasets, and the experimental results show a significant improvement in the efficiency of contribution evaluation compared to existing methods. Meanwhile, IPR infringement tests on TraCemop reveal that the proposed framework is resilient against malicious efforts to monopolize model ownership. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Q&A driven conversational recommendation integrating multiple interest modeling

引用

Neurocomputing 2025年

作者： Haiping Zhu Yuqi Sun Shuwei Che Yan Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an 710049 China

The conversational recommendation aims to provide users with recommendations in an interaction form of “System Ask-User Respond” . Existing studies rarely consider combining users’ multi-interest at the attribute level for preference modeling, and conduct inefficient conversational recommendation strategy learning, which affects the recommendation performance and conversation performance. To this end, we proposed a Q-A driven conversational recommendation method integrating multiple interest modeling. Specifically, we integrate the user’s positive and negative feedback to model a session dynamic graph, then use the signed graph convolutional network for graph representation learning, and we model multiple interest sequences based on the attention mechanism, then obtain the user interest state representation by fusing of sequence representations to solve the problem of insufficient user preference representation. Besides, we proposed a personalized decision space optimization method to narrow the range of action candidates and train the model with a multi-agent reinforcement learning method integrating hierarchical decision debiasing to solve the problem of poor conversational recommendation strategy learning effect. Experimental results on three public datasets, LastFM, Yelp, and Book, show that compared with existing conversational recommendation methods, our method demonstrates consistent performance improvement across all datasets. In addition, the results of ablation experiments verify the effectiveness of each component in our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Triple-view Learning for Predicting Antibiotic Resistance Genes

Triple-view Learning for Predicting Antibiotic Resistance Ge...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Luo, Shujie Wu, Haifang Zhao, Weizhong Jiang, Xingpeng He, Tingting Central China Normal University Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Wuhan430079 China School of Computer Central China Normal University Hubei Wuhan430079 China National Language Resources Monitoring and Research Center for Network Media Central China Normal University Hubei Wuhan430079 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangxi Key Lab of Multi-source Information Mining and Security Guangxi Normal University Guilin541004 China

ISBN: (纸本)9781665401265

With the increasing resistance of bacteria to antibiotics, the problem of antibiotic resistance has become a major challenge in healthcare. Therefore, the accurate identification of antibiotic resistance genes (ARGs) in bacteria is particularly urgent and important. Although culture-based methods can accurately identify ARGs, they are limited by domain knowledge and are time-consuming. With the availability of whole genome sequence data, most existing methods rely on sequence alignment to calculate sequence similarity to predict ARGs. However, for ARGs that has low sequence identity with known sequences, the existing methods do not identify them well. To address the challenges, we propose a multiple view learning based framework for ARGs. Experimental results demonstrate that the proposed approach performs better than the selected representative baselines on the real-world dataset. © 2021 IEEE.

关键词： Bacteria

来源：评论

学校读者我要写书评

暂无评论

An improved RL-based framework for multiple biomedical event extraction via self-supervised learning

An improved RL-based framework for multiple biomedical event...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Zhao, Yao Zhao, Weizhong Jiang, Xingpeng He, Tingting Su, Bianping Central China Normal University Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Hubei Wuhan430079 China School of Computer Central China Normal University Hubei Wuhan430079 China National Language Resources Monitoring and Research Center for Network Media Central China Normal University Hubei Wuhan430079 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangxi Key Lab of Multi-source Information Mining and Security Guangxi Normal University Guilin541004 China Xi'An University of Architecture and Technology Shanxi Xi'an China

ISBN: (纸本)9781665401265

The main goal of biomedical event extraction is to structurally extract biomedical events from texts, however, the specificity of the domain makes both text modeling and data annotation very difficult. We propose a self-supervised learning-based data augmentation method in this paper and design specific augmentation strategies for biomedical entities and event triggers in biomedical texts, which solves the problem of sparse annotation data to some extent. In addition we improve the reinforcement learning-based event extraction method to improve the training efficiency of the model. The experiments on two datasets demonstrate the effectiveness of our method. © 2021 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Research on Knowledge Distillation of Generative Adversarial networks

Research on Knowledge Distillation of Generative Adversarial...

引用

Data Compression Conference (DCC)

作者： Wei Wang Baohua Zhang Tao Cui Yimeng Chai Yue Li College of Computer Science KLMDASR Trusted AI System Lab Nankai University Tianjin China College of Computer Science Tianjin Key Lab of Network and Data Security Technology Nankai University Tianjin China NCMIS LSEC Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

The compression of Generative Adversarial networks (GANs) has been an emerging study in recent years. However, conventional compression methods can hardly be applied to GANs due to the training process and optimization target of GANs are different from the traditional classification detection network. Inspired by the recent success of knowledge distillation, we condense the recent researches on them applied to particular GANs, i.e. WGAN and CGAN for special tasks into two strategies: Soft Target Only Strategy (STOS) and Inherited Hard Target Strategy (IHTS), and propose an novel Random Hard Target Strategy, namely RHTS. In RHTS, we take the student network generator loss as the hard target of knowledge distillation when the discriminator is fixed, and the output of the teacher network generator as the soft target to distill GANs. The experiments on image datasets (MNIST, CIFAR-10), and structured-data datasets (Australian Credit Approval dataset, Credit Approval Data Set) show that STOS and IHTS are effective, and RHTS is the best. Such results are further proved on WGAN, WGAN-GP and LSGAN in order to demonstrate the better generalization ability of the strategies. Besides, the RHTS improve the stability of the GAN training process, where the performance and stability confirm the rationality of our design.

关键词： Training Knowledge engineering Data compression Generative adversarial networks Generators Task analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

Outage Analysis of Aerial Semi-Grant-Free NOMA Systems

arXiv

引用

arXiv 2022年

作者： Lei, Hongjiang Zhu, Chen Park, Ki-Hong Ansari, Imran Shafique Lei, Weijia Tang, Hong Kim, Kyeong Jin The School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Lab of Mobile Communications Technology Chongqing400065 China Shaanxi Key Laboratory of Information Communication Network and Security Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Thuwal23955-6900 Saudi Arabia James Watt School of Engineering University of Glasgow GlasgowG12 8QQ United Kingdom The Mitsubishi Electric Research Laboratories CambridgeMA02139 United States

In this paper, we analyze the outage performance of Unmanned Aerial Vehicles (UAVs)-enabled downlink Non-Orthogonal Multiple Access (NOMA) communication systems with the Semi-Grant-Free (SGF) transmission scheme. A UAV provides coverage services for a Grant-Based (GB) user and one Grant-Free (GF) user is allowed to utilize the same channel resource opportunistically. The analytical expressions for the exact and asymptotic Outage Probability (OP) of the GF user are derived. The results demonstrate that no-zero diversity order can be achieved only under stringent conditions on users’ quality of service requirements. Subsequently, an efficient Dynamic Power Allocation (DPA) scheme is proposed to relax such data rate constraints. The analytical expressions for the exact and asymptotic OP of the GF user with the DPA scheme are derived. Finally, Monte Carlo simulation results are presented to validate the correctness of the derived analytical expressions and demonstrate the effects of the UAV’s location and altitude on the OP of the GF user. © 2022, CC BY.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

RCDNet: An Interpretable Rain Convolutional Dictionary network for Single Image Deraining

arXiv

引用

arXiv 2021年

作者： Wang, Hong Xie, Qi Zhao, Qian Li, Yuexiang Liang, Yong Zheng, Yefeng Meng, Deyu Tencent Jarvis Lab Shenzhen China School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xi'an Jiaotong University Shaanxi China Peng Cheng Laboratory Shenzhen China Macao Institute of Systems Engineering Macau University of Science and Technology Taipa China The Faculty of Information Technology Macau University of Science and Technology China

As a common weather, rain streaks adversely degrade the image quality and tend to negatively affect the performance of outdoor computer vision systems. Hence, removing rains from an image has become an important issue in the field. To handle such an ill-posed single image deraining task, in this paper, we specifically build a novel deep architecture, called rain convolutional dictionary network (RCDNet), which embeds the intrinsic priors of rain streaks and has clear interpretability. In specific, we first establish a RCD model for representing rain streaks and utilize the proximal gradient descent technique to design an iterative algorithm only containing simple operators for solving the model. By unfolding it, we then build the RCDNet in which every network module has clear physical meanings and corresponds to each operation involved in the algorithm. This good interpretability greatly facilitates an easy visualization and analysis on what happens inside the network and why it works well in inference process. Moreover, taking into account the domain gap issue in real scenarios, we further design a novel dynamic RCDNet, where the rain kernels can be dynamically inferred corresponding to input rainy images and then help shrink the space for rain layer estimation with few rain maps so as to ensure a fine generalization performance in the inconsistent scenarios of rain types between training and testing data. By end-to-end training such an interpretable network, all involved rain kernels and proximal operators can be automatically extracted, faithfully characterizing the features of both rain and clean background layers, and thus naturally leading to better deraining performance. Comprehensive experiments implemented on a series of representative synthetic and real datasets substantiate the superiority of our method, especially on its well generality to diverse testing scenarios and good interpretability for all its modules, as compared with state-of-the-art single im

关键词： Rain

来源：评论

学校读者我要写书评

暂无评论

Noise-Tolerant Learning for Audio-Visual Action Recognition

arXiv

引用

arXiv 2022年

作者： Han, Haochen Zheng, Qinghua Luo, Minnan Miao, Kaiyao Tian, Feng Chen, Yan The National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an710049 China The School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China The Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Ministry of Education Xi’an710049 China The School of Cyber Science and Engineering Xi’an Jiaotong University Xi’an710049 China

Recently, video recognition is emerging with the help of multi-modal learning, which focuses on integrating distinct modalities to improve the performance or robustness of the model. Although various multi-modal learning methods have been proposed and offer remarkable recognition results, almost all of these methods rely on high-quality manual annotations and assume that modalities among multi-modal data provide semantically relevant information. Unfortunately, the widely used video datasets are usually coarse-annotated or collected from the Internet. Thus, it inevitably contains a portion of noisy labels and noisy correspondence. To address this challenge, we use the audio-visual action recognition task as a proxy and propose a noise-tolerant learning framework to find anti-interference model parameters against both noisy labels and noisy correspondence. Specifically, our method consists of two phases that aim to rectify noise by the inherent correlation between modalities. First, a noise-tolerant contrastive training phase is performed to make the model immune to the possible noisy-labeled data. Despite the benefits brought by contrastive training, it would overfit the noisy correspondence and thus provide false supervision. To alleviate the influence of noisy correspondence, we propose a cross-modal noise estimation component to adjust the consistency between different modalities. As the noisy correspondence existed at the instance level, we further propose a category-level contrastive loss to reduce its interference. Second, in the hybrid-supervised training phase, we calculate the distance metric among features to obtain corrected labels, which are used as complementary supervision to guide the training. Furthermore, due to the lack of suitable datasets, we establish a benchmark of real-world noisy correspondence in audio-visual data by relabeling the Kinetics dataset. Extensive experiments on a wide range of noisy levels demonstrate that our method significant

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

VFGCN: A Vertical Federated Learning Framework With Privacy Preserving for Graph Convolutional network

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Gang Li, Qingming Liu, Ximeng Yan, Xiaoran Dong, Qingkuan Wu, Huiwen Kong, Xiangjie Zhou, Li Zhejiang Lab HangZhou310000 China Zhejiang University College of Computer Science and Technology Hangzhou310058 China Fuzhou University Key Laboratory of Information Security of Network Systems College of Computer and Big Data Fuzhou350108 China Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Zhejiang University of Technology College of Computer Science and Technology Hangzhou310023 China Dalian University of Technology School of Software Dalian116620 China

Due to the robust representational capabilities of graph data, employing graph neural networks for its processing has demonstrated superior performance over conventional deep learning algorithms. Graph data encompasses abundant features and structural information;however, its large-scale collection is often challenging in practice. This difficulty arises because data predominantly exists in isolated compartments, making it arduous to harmonize information across various organizations or to enable multiple organizations to collaborate effectively while safeguarding local data privacy. In light of an extreme data distribution scenario, where each client possesses distinct nodes with partially overlapping segments yet divergent data features, we introduce a dual-cloud server architecture. This framework encompasses the design of four secure subprotocols: ReEnc (secure re-encryption), SecPSI (secure outsourcing of PSI), SecWeight (secure weight calculation), and SecAgg (secure aggregation). Together, these components facilitate a vertical federated learning framework for graph convolutional networks, ensuring privacy preservation. We provide a security proof for the entire system and extensive evaluation on three benchmark datasets (Cora, Citeseer, and Pubmed) illustrates that our Vertical Federated Graph Convolutional network (VFGCN) surpasses existing privacy-preserving methodologies. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：