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

A survey on cross-user federated recommendation

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless Networks

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Future Network of Intelligence Institute School of Science and Engineering Shenzhen518172 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen518060 China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

STBA: Towards Evaluating the Robustness of DNNs for Query-Limited Black-Box Scenario

引用

IEEE Transactions on Multimedia 2025年 27卷 2666-2681页

作者： Liu, Renyang Lam, Kwok-Yan Zhou, Wei Wu, Sixing Zhao, Jun Hu, Dongting Gong, Mingming Yunnan University School of Information Science and Engineering Kunming650500 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Yunnan University School of Software Engineering Research Center of Cyberspace Kunming650500 China University of Melbourne Melbourne Centre for Data Science School of Mathematics and Statistics ParkvilleVIC3010 Australia

Extensive studies have revealed that deep neural networks (DNNs) are vulnerable to adversarial attacks, especially black-box ones, which can heavily threaten the DNNs deployed in the real world. Many attack techniques have been proposed to explore the vulnerability of DNNs and further help to improve their robustness. Despite the significant progress made recently, existing black-box attack methods still suffer from unsatisfactory performance due to the vast number of queries needed to optimize desired perturbations. Besides, the other critical challenge is that adversarial examples built in a noise-adding manner are abnormal and struggle to successfully attack robust models, whose robustness is enhanced by adversarial training against small perturbations. There is no doubt that these two issues mentioned above will significantly increase the risk of exposure and result in a failure to dig deeply into the vulnerability of DNNs. Hence, it is necessary to evaluate DNNs' fragility sufficiently under query-limited settings in a non-additional way. In this paper, we propose the Spatial Transform Black-box Attack (STBA), a novel framework to craft formidable adversarial examples in the query-limited scenario. Specifically, STBA introduces a flow field to the high-frequency part of clean images to generate adversarial examples and adopts the following two processes to enhance their naturalness and significantly improve the query efficiency: a) we apply an estimated flow field to the high-frequency part of clean images to generate adversarial examples instead of introducing external noise to the benign image, and b) we leverage an efficient gradient estimation method based on a batch of samples to optimize such an ideal flow field under query-limited settings. Compared to existing score-based black-box baselines, extensive experiments indicated that STBA could effectively improve the imperceptibility of the adversarial examples and remarkably boost the attack success rate u

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Architecture Search

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Arch...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Binyan Ren, Ao Zhang, Zihao Duan, Moming Liu, Duo Tan, Yujuan Zhong, Kan College of Computer Science Chongqing University Chongqing China School of Big Data Software & Engineering Chongqing University Chongqing China Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)9798350368741

With the rapid development of social media, sentiment analysis from multimodal posts has garnered significant attention in recent years. However, the substantial size of these models impedes their deployment on resource-constrained embedded devices. Although pruning has been extensively studied to reduce the size of unimodal models, specific challenges remain for Multimodal Sentiment Analysis (MSA) models. First, existing techniques prune fixed original models into sparse models, while our findings indicate that different model architectures of identical size yield varying performance outcomes. Second, prior studies fail to explore the unique characteristics of MSA models, resulting in suboptimal pruning performance. To address these challenges, we propose MPNAS, a unified pruning framework via Neural Architecture Search (NAS) for MSA models. Specifically, we formulate pruning as a NAS problem and analyze MSA model characteristics to guide the subnet search. We conduct an initial coarse-grained NAS on the original model, expanding the search space slightly to identify suitable subnets that enhance pruning rates and accuracy. Subsequently, we refine coarse-grained subnets in a fine-grained NAS stage, where MSA model characteristics guide the search process. Extensive experiments on three representative datasets demonstrate the superiority of our approach over existing methods. © 2025 IEEE.

关键词： Multimodal Compression NAS

来源：评论

学校读者我要写书评

暂无评论

Highly Robust and Diverse Coverless Image Steganography Against Passive and Active Steganalysis

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2771-2787页

作者： Guo, Bobiao Ping, Ping Xu, Feng Hohai University College of Computer Science and Software Engineering Nanjing210098 China Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing210098 China Jiangsu Ocean University School of Computer Engineering Lianyungang222005 China

To avoid the pixel modification traces left by steganography from being detected by passive steganalysis, and to prevent the hidden data from being destroyed by active steganalysis attacks, Coverless Image Steganography (CIS) that does not modify pixels has attracted widespread attention. However, most existing CIS methods are limited in their maximum capacity due to insufficient diversity in their hash sequences. In addition, these methods struggle to maintain high robustness against both geometric and non-geometric attacks simultaneously. To address these two issues, a new coverless image steganography method is proposed to enhance CIS methods’ applicability, security, and robustness in highly insecure networks. During the hiding process, hash sequences are generated by a SHA-256 algorithm that integrates inter-block and inter-channel fusion, providing higher diversity than other CIS methods. Consequently, the proposed CIS method achieves higher capacity on publicly available datasets. During the extraction process, an evaluation metric that combines visual and histogram similarity is designed to improve the accuracy of inverse image retrieval. The experimental results demonstrate that the proposed CIS method achieves capacity increases of 26.73% and 38.34% over other CIS methods on the VOC and COCO datasets, respectively. Moreover, this method exhibits nearly 100% robustness against common active steganalysis. © 2004-2012 IEEE.

关键词： Steganography Robustness Feature Extraction data Mining Image Retrieval Visualization Accuracy software Indexes Histograms Coverless Image Steganography CIS Hash Generation Algorithm Inverse Image Retrieval Steganalysis High Robustness Robust Image Image Coding Hidden Information Retrieval Accuracy Visual Similarity COCO dataset Convolutional Neural Network Computational Complexity Robust Method Image dataset Bit Error Rate Types Of Attacks Auxiliary Information Scale Invariant Feature Transform Index database Histogram Bins Length Information Cover Image Military Intelligence Secret Information Center Crop Secure Transmission Salt And Pepper Noise XOR Operation Number Of Different Sequences JPEG Compression Generative Adversarial Networks Pixel Position Common Attacks

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 1-14页

作者： Tan, Mingkui Chen, Guohao Wu, Jiaxiang Zhang, Yifan Chen, Yaofo Zhao, Peilin Niu, Shuaicheng South China University of Technology School of Software Engineering China Pazhou Laboratory Guangzhou China XVERSE China National University of Singapore School of Computing Singapore Tencent AI Lab China Nanyang Technological University College of Computing and Data Science Singapore

Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and testing data by adapting a given model w.r.t. any testing sample. This task is particularly important when the test environment changes frequently. Although some recent attempts have been made to handle this task, we still face two key challenges: 1) prior methods have to perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications;2) while existing TTA solutions can significantly improve the test performance on out-of-distribution data, they often suffer from severe performance degradation on in-distribution data after TTA (known as catastrophic forgetting). To this end, we have proposed an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples for test-time entropy minimization. To alleviate forgetting, EATA introduces a Fisher regularizer estimated from test samples to constrain important model parameters from drastic changes. However, in EATA, the adopted entropy loss consistently assigns higher confidence to predictions even when the samples are underlying uncertain, leading to overconfident predictions that underestimate the data uncertainty. To tackle this, we further propose EATA with Calibration (EATA-C) to separately exploit the reducible model uncertainty and the inherent data uncertainty for calibrated TTA. Specifically, we compare the divergence between predictions from the full network and its sub-networks to measure the reducible model uncertainty, on which we propose a test-time uncertainty reduction strategy with divergence minimization loss to encourage consistent predictions instead of overconfident ones. To further re-calibrate predicting confidence on different samples, we utilize the disagreement among predicted labels as an indicator of the data uncertainty. Based on this, we devise a min-max entropy

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Learned Video Compression With Refined Adaptive Flow Pyramid And Coordinate-Aware Attention

Learned Video Compression With Refined Adaptive Flow Pyramid...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Huang, Qian Liu, Wenting Li, Xin Wang, Yiming College of Computer Science and Software Engineering Hohai University Nanjing China Key Laboratory of Water Big Data Technology Ministry of Water Resources Hohai University Nanjing China

ISBN: (纸本)9798350368741

In video compression, motion estimation and motion compensation are critical for achieving efficient encoding. Although the commonly used SpyNet and bilinear interpolation have contributed in improving the compression efficiency, they still have limitations. SpyNet often loses details and fails to fully utilize the feature extraction capabilities of deep networks. Furthermore, bilinear interpolation inherently attenuates high-frequency information, leading to frame blurring and distortion. In this paper, we propose a novel video compression algorithm. To overcome the limitations of SpyNet, we propose a refined adaptive flow pyramid network. This network uses a multi-scale feature pyramid to capture more details. Moreover, we use an iterative cost volume refinement engine that improves the feature representation of the network and iteratively improve the accuracy of motion estimation. In addition, to overcome the limitation of bilinear interpolation, we propose a coordinate-aware attention module, which captures more high-frequency information to improve the accuracy of motion compensation. Experimental results show that our method outperforms VTM-13.2 (LDP) in terms of PSNR. © 2025 IEEE.

关键词： coordinate network cross attention flow pyramid learned video compression

来源：评论

学校读者我要写书评

暂无评论

Improving Adaptive Runoff Forecasts in data-Scarce Watersheds Through Personalized Federated Learning 27th

Improving Adaptive Runoff Forecasts in Data-Scarce Watershe...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Xie, Zaipeng Zhang, Xiangqin Wang, Yunfei Jie, Xuanyao Fang, Wenhao Cai, Yanping Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China College of Computer Science and Software Engineering Hohai University Nanjing China

ISBN: (纸本)9783031781827

Runoff forecasting plays a crucial role in water resource management and flood mitigation, but it often faces significant challenges due to data deficiency and decentralized datasets. Inadequate hydrological data in many watersheds hinders the development of accurate prediction models, while organizational barriers and concerns about data privacy lead to information silos, preventing effective collaborative modeling. To address these issues, we propose FedHydroDSW, a novel personalized federated learning framework for runoff forecasting in data-scarce watersheds. Our approach enables decentralized model training across multiple organizations without requiring direct data sharing, thus preserving data privacy. FedHydroDSW incorporates unique model similarity metrics and parameter adaptation methods, utilizing insights from data-rich areas to refine forecasts in data-scarce regions. Experiments on the CAMELS dataset show that FedHydroDSW significantly outperforms standalone and conventional federated learning methods, with an average 30.1% increase in NSE, and reductions of 28% in RAE and 26.6% in RMSE across multiple data-scarce basins. By enabling secure cross-silo learning, our FedHydroDSW strategy paves the way toward more equitable runoff forecasting globally. The customized training and pattern recognition techniques represent major progress in deploying federated intelligence for impactful hydrological predictions. Our code is publicly available at https://***/xyjie37/FedHydroDSW. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Feature Alignment via Knowledge Distillation 21st

Personalized Federated Learning with Feature Alignment via...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Qi, Guangfei Qu, Zhihao Lyu, Shen-Huan Jia, Ninghui Ye, Baoliu Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9789819601189

Personalized Federated Learning (PFL) has gained significant attention for its ability to handle heterogeneous data effectively. Parameter decoupling is a typical approach to PFL. It decouples the model into a feature extractor and a classifier head, where the feature extractor is trained collaboratively to learn a common representation and the classifier head is personalized for local data. Since local training only learns personalized feature information and ignores global information, the generalization ability of the feature extractor is limited. To improve the performance of the local model, a feasible approach is to make the local feature extractor more generalized. However, prior work requires the transmission of additional feature data beyond the transmission of model parameters, which leads to privacy leakage and higher communication overhead. To address these shortcomings, we propose a PFL algorithm with feature alignment via knowledge distillation, named PFAKD. PFAKD enhances the training of local feature extractors by explicitly aligning each sample’s local features with global features, providing more detailed guidance. Meanwhile, it avoids additional communication overhead and the risk of privacy leakage. We conduct extensive experiments in heterogeneous data scenarios. PFAKD outperforms other state-of-the-art methods by up to 4.35% in terms of model accuracy. Our code is available at https://***/fei0829/PFAKD. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

MoreGCN: Distributed IoT Service Recommendation Considering Temporal User Interest Dynamics

引用

IEEE Internet of Things Journal 2025年第10期12卷 13657-13670页

作者： Zhou, Yu Hu, Chunqiang Liu, Zewei Xing, Xiaoshuang Li, Xingwang Chongqing University School of Big Data and Software Engineering Chongqing401331 China China Southern Power Grid Joint Laboratory on Cyberspace Security Guangdong510663 China Changshu Institute of Technology School of Computer Science and Engineering Suzhou215556 China Henan Polytechnic University College of Physics and Electronic Information Engineering Jiaozuo454000 China

With the continuous development of Internet of Things (IoT), significant value has been generated, but numerous challenges remain. Recommender systems, as an effective tool to optimize IoT services, can significantly enhance user experience. However, the IoT’s demands for low latency and high-computational load make it difficult for traditional recommender systems to adapt. Moreover, traditional approaches often overlook the dynamic nature of user preferences, which are crucial for determining user satisfaction with IoT services. To address these issues, we propose a novel method called MoreGCN, which quantifies the temporal evolution of user preferences and integrates user interest modeling to accurately match similar users. This approach guides the learning of convolutional networks during the recommendation process. Deployed within a distributed computing framework and combined with meta computing, MoreGCN significantly improves computational efficiency and recommendation accuracy. Experimental results demonstrate that, across three benchmark datasets, MoreGCN consistently outperforms several existing state-of-the-art methods in terms of performance. © 2014 IEEE.

关键词： Internet of Things Recommender systems Computational modeling Accuracy Load modeling Edge computing Feature extraction Collaborative filtering Vectors Servers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：