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

arXiv 2025年

作者： Zhou, Yu Zheng, Dian Mo, Qijie Lu, Renjie Lin, Kun-Yu Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Peng Cheng Laboratory China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Guangdong Province Key Laboratory of Information Security Technology China

In this work, we present DEcoupLEd Distillation To Erase (DELETE), a general and strong unlearning method for any class-centric tasks. To derive this, we first propose a theoretical framework to analyze the general form of unlearning loss and decompose it into forgetting and retention terms. Through the theoretical framework, we point out that a class of previous methods could be mainly formulated as a loss that implicitly optimizes the forgetting term while lacking supervision for the retention term, disturbing the distribution of pre-trained model and struggling to adequately preserve knowledge of the remaining classes. To address it, we refine the retention term using "dark knowledge" and propose a mask distillation unlearning method. By applying a mask to separate forgetting logits from retention logits, our approach optimizes both the forgetting and refined retention components simultaneously, retaining knowledge of the remaining classes while ensuring thorough forgetting of the target class. Without access to the remaining data or intervention (i.e., used in some works), we achieve state-of-the-art performance across various benchmarks. What’s more, DELETE is a general solution that can be applied to various downstream tasks, including face recognition, backdoor defense, and semantic segmentation with great performance. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Edge Graph intelligence: Reciprocally Empowering Edge Networks With Graph intelligence

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Zeng, Liekang Ye, Shengyuan Chen, Xu Zhang, Xiaoxi Ren, Ju Tang, Jian Yang, Yang Shen, Xuemin Sherman Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangzhou511453 China Ministry of Education School of Computer Science and Engineering Sun Yat-sen University The Key Laboratory of Machine Intelligence and Advanced Computing Guangzhou510275 China Tsinghua University Department of Computer Science and Technology Beijing100084 China Midea Group Shanghai201702 China Guangzhou511453 China Peng Cheng Laboratory Shenzhen518055 China Terminus Group Beijing100027 China University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada

Recent years have witnessed a thriving growth of computing facilities connected at the network edge, cultivating edge networks as a fundamental infrastructure for supporting miscellaneous intelligent services. Meanwhile, Artificial intelligence (AI) frontiers have extrapolated to the graph domain and promoted Graph intelligence (GI). Given the inherent relation between graphs and networks, the interdiscipline of graph learning and edge networks, i.e., Edge GI or EGI, has revealed a novel interplay between them - GI aids in optimizing edge networks, while edge networks facilitate GI model deployment. Driven by this delicate closed-loop, EGI is recognized as a promising solution to fully unleash the potential of edge computing power and is garnering growing attention. Nevertheless, research on EGI remains nascent, and there is a soaring demand within both the communications and AI communities for a dedicated venue to share recent advancements. To this end, this paper promotes the concept of EGI, explores its scope and core principles, and conducts a comprehensive survey concerning recent research efforts on this emerging field. Specifically, this paper introduces and discusses: 1) fundamentals of edge computing and graph learning, 2) emerging techniques centering on the closed loop between graph intelligence and edge networks, and 3) open challenges and research opportunities of future EGI. By bridging the gap across communication, networking, and graph learning areas, we believe that this survey can garner increased attention, foster meaningful discussions, and inspire further research ideas in EGI. © 1998-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

PCE-GAN: A Generative Adversarial Network for Point Cloud Attribute Quality Enhancement based on Optimal Transport

arXiv

引用

arXiv 2025年

作者： Guo, Tian Yuan, Hui Liu, Qi Su, Honglei Hamzaoui, Raouf Kwong, Sam School of Control Science and Engineering Shandong University Jinan250061 China Key Laboratory of Machine Intelligence and System Control Ministry of Education Ji’nan250061 China School of Electronic Information Qingdao University Qingdao266071 China School of Engineering and Sustainable Development De Montfort University LeicesterLE1 9BH United Kingdom Department of Computing and Decision Science Lingnan University Hong Kong

Point cloud compression significantly reduces data volume but sacrifices reconstruction quality, highlighting the need for advanced quality enhancement techniques. Most existing approaches focus primarily on point-to-point fidelity, often neglecting the importance of perceptual quality as interpreted by the human visual system. To address this issue, we propose a generative adversarial network for point cloud quality enhancement (PCE-GAN), grounded in optimal transport theory, with the goal of simultaneously optimizing both data fidelity and perceptual quality. The generator consists of a local feature extraction (LFE) unit, a global spatial correlation (GSC) unit and a feature squeeze unit. The LFE unit uses dynamic graph construction and a graph attention mechanism to efficiently extract local features, placing greater emphasis on points with severe distortion. The GSC unit uses the geometry information of neighboring patches to construct an extended local neighborhood and introduces a transformer-style structure to capture long-range global correlations. The discriminator computes the deviation between the probability distributions of the enhanced point cloud and the original point cloud, guiding the generator to achieve high quality reconstruction. Experimental results show that the proposed method achieves state-of-the-art performance. Specifically, when applying PCE-GAN to the latest geometry-based point cloud compression (G-PCC) test model, it achieves an average BD-rate of -19.2% compared with the PredLift coding configuration and -18.3% compared with the RAHT coding configuration. Subjective comparisons show a significant improvement in texture clarity and color transitions, revealing finer details and more natural color gradients. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Text-guided Reconstruction Network for Sentiment Analysis with Uncertain Missing Modalities

引用

IEEE Transactions on Affective computing 2025年

作者： Shi, Piao Hu, Min Nakagawa, Satoshi Zheng, Xiangming Shi, Xuefeng Ren, Fuji Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine National Smart Eldercare International Science and Technology Cooperation Base School of Computer Science and Information Engineering Anhui Hefei230601 China Bozhou University School of Electronic and Information Engineering Bozhou236800 China University of Tokyo Graduate School of Information Science and Technology Tokyo113-8656 Japan University of Electronic Science and Technology of China College of Computer Science and Engineering Chengdu611731 China University of Electronic Science and Technology of China Shenzhen Institute for Advanced Study Shenzhen518110 China

Multimodal Sentiment Analysis (MSA) is an attractive research that aims to integrate sentiment expressed in textual, visual, and acoustic signals. There are two main problems in the existing methods: 1) the dominant role of the text is underutilization in unaligned multimodal data, and 2) the modality under uncertain missing feature is not sufficiently explored. This paper proposes a Text-guided Reconstruction Network (TgRN) for MSA with uncertain missing modalities in non-aligned sequences. The TgRN network includes three primary modules: Text-guided Extraction Module (TEM), Reconstruction Module (RM) and Text-guided Fusion Module (TFM). First, the TEM consists of the text-guided cross attention units and self-attention units to capture inter-modal features and intra-modal features, respectively. Second, leveraging enhanced attention units and a three-way squeeze-and-excitation block, the RM is designed to learn semantic information from incomplete data and reconstruct missing modality features. Third, the TFM utilizes a progressive modality-mixing adaptation gate to explore the dynamic correlations between nonverbal and verbal modalities, effectively addressing the modality gap issue. Finally, under the supervision of sentiment prediction loss and reconstruction loss, the TgRN effectively processes both uncertain missing-modality conditions and ideal complete modality conditions. Extensive experiments on CMU-MOSI and CH-SIMS demonstrate that our proposed method outperforms state-of-the-art approaches. © 2010-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Imputing DNA Methylation by Transferred Learning Based Neural Network

引用

Journal of Computer Science & Technology 2022年第2期37卷 320-329页

作者： Xin-Feng Wang Xiang Zhou Jia-Hua Rao Zhu-Jin Zhang Yue-Dong Yang School of Computer Science and Engineering Sun Yat-sen UniversityGuangzhou 510000China Key Laboratory of Machine Intelligence and Advanced Computing of Ministry of Education(Sun Yat-sen University)Guangzhou 510000 China

DNA methylation is one important epigenetic type to play a vital role in many diseases including *** the development of the high-throughput sequencing technology,there is much progress to disclose the relations of DNA methylation with ***,the analyses of DNA methylation data are challenging due to the missing values caused by the limitations of current *** many methods have been developed to impute the missing values,these methods are mostly based on the correlations between individual samples,and thus are limited for the abnormal samples in *** this study,we present a novel transfer learning based neural network to impute missing DNA methylation data,namely the TDimpute-DNAmeth *** method learns common relations between DNA methylation from pan-cancer samples,and then fine-tunes the learned relations over each specific cancer type for imputing the missing *** on 16 cancer datasets,our method was shown to outperform other commonly-used *** analyses indicated that DNA methylation is related to cancer survival and thus can be used as a biomarker of cancer prognosis.

关键词： neural network transfer learning DNA methylation data imputation survival analysis

来源：评论

学校读者我要写书评

暂无评论

An investigation into mental illness and its comorbidities from the perspective of supervenience physicalism

引用

Philosophy, Ethics, and Humanities in Medicine 2025年第1期20卷 1-9页

作者： Yang, Ping Zhang, Xinyue Song, Hongwen Zhang, Xiaochu School of Humanities and Social Sciences University of Science and Technology of China Anhui Hefei 230026 China School of Mental Health and Psychological Science Anhui Medical University Anhui Hefei 230032 China Business School Guizhou Education University Guiyang 550018 China Key Laboratory of Brain-Machine Intelligence for Information Behavior (Ministry of Education and Shanghai) School of Business and Management Shanghai International Studies University Shanghai 201620 China Center for Advanced interdisciplinary science and Biomedicine of institute of Health and Medicine (HM) Division of Life Sciences and Medicine University of Science and Technology of China Hefei 230027 China

The exploration into the origin of human spirituality has always been a hot spot with many unsolved questions in the philosophy of mind, and issues concerning mental illness and its comorbidities are still unclear. In the 1970s, Donald Davidson first proposed anomalous monism with the supervenience concept, a theory that both insists on physicalism and transcends traditional reductionism. This theory provides solid and accessible proof for perceiving the mind-body relationship of spiritual origin in a non-reductionist approach. This paper develops arguments in two aspects. First, three principles of anomalous monism are employed to explore the origin of mental illness. Second, the comorbidity of mental illness is explained with the help of the supervenience theory. © The Author(s) 2025.

关键词： Comorbidity Mental illness Non-reductive physicalism Supervenience

来源：评论

学校读者我要写书评

暂无评论

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions

引用

Journal of Computer Science & Technology 2023年第6期38卷 1423-1430页

作者：叶泽坤李绿周 Institute of Quantum Computing and Computer Theory School of Computer Science and EngineeringSun Yat-sen UniversityGuangzhou 510006China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen UniversityGuangzhou 510006China

The query model(or black-box model)has attracted much attention from the communities of both classical and quantum ***,quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical *** the history of quantum algorithms,the Deutsch algorithm and the Deutsch-Jozsa algorithm play a fundamental role and both are exact one-query quantum *** leads us to con-sider the problem:what functions can be computed by exact one-query quantum algorithms?This problem has been ad-dressed in the literature for total Boolean functions and symmetric partial Boolean functions,but is still open for general partial Boolean ***,in this paper,we continue to characterize the computational power of exact one-query quantum algorithms for general partial Boolean ***,we present several necessary and sufficient conditions for a partial Boolean function to be computed by exact one-query quantum ***,inspired by these conditions,we discover some new representative functions that can be computed by exact one-query quantum algorithms but have an essential difference from the already known ***,it is worth pointing out that before our work,the known func-tions that can be computed by exact one-query quantum algorithms are all symmetric functions and the quantum algo-rithm used is essentially the Deutsch-Jozsa algorithm,whereas the functions discovered in this paper are generally asym-metric and new algorithms to compute these functions are ***,this expands the class of functions that can be computed by exact one-query quantum algorithms.

关键词： quantum computing quantum query complexity quantum algorithm

来源：评论

学校读者我要写书评

暂无评论

RobustPFL: Robust Personalized Federated Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Chen, Guorong Wang, Wei Wu, Yufang Li, Chao Xu, Guangquan Ji, Shouling Li, Tao Shen, Meng Han, Yufei Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China Beijing Jiaotong University 3 Shangyuancun Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China Tianjin University Tianjin Key Laboratory of Advanced Networking College of Intelligence and Computing Tianjin300350 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China ITAI Haihe Lab Tianjin China Nankai University College of Computer Science Tianjin300350 China Beijing Institute of Technology School of Cyberspace Security Beijing100081 China Peng Cheng Laboratory Cyberspace Security Research Center Shenzhen518066 China INRIA Bretagne Rennes35042 France

Conventional federated learning (FL) coordinated by a central server focuses on training a global model and protecting the privacy of clients' training data by storing it locally. However, the statistical heterogeneity hinders the global model from adapting to the non-IID distributions among clients. Moreover, untrusted and unreliable central servers and malicious clients may compromise model integrity and availability, thus degrading the robustness of FL. To address these challenges, we present RobustPFL, a decentralized personalized federated learning (PFL) approach that combines α-based Layer-position Normalized Similarity (α-LNS) and local collaborative training to improve personalized performance while utilizing a blockchain-based committee mechanism to coordinate the aggregation process, thereby achieving high personalized accuracy and robustness. Extensive experiments show that our RobustPFL approach outperforms multiple algorithms, including Local training, FedAvg, FedReptile, Per-FedAvg, FedBN, and SPFL, on MNIST, CIFAR10, EMNIST, and N-BaIoT datasets in four non-IID settings. We also evaluate RobustPFL's effectiveness against attacks - poisoning attacks and free-riding attacks. Particularly, for three prevalent poisoning attacks (backdoor, label flipping, and model poisoning attacks), we compare non-defensive (FedAvg) and defensive (Krum, trimmed mean, Bulyan, FedBN, FLAME, and FangTrmean) methods with our proposed RobustPFL. The results show that our approach achieves significant defensive effects. © 2004-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

The Temporal Structural Pattern in Scientific Collaborative Behavior from the Perspective of Complex Network 23rd

The Temporal Structural Pattern in Scientific Collaborative...

引用

23rd International Symposium on Knowledge and Systems Sciences, KSS 2024

作者： Zholdoshbaeva, Elina Zhang, Shuang Liu, Feifan Xia, Haoxiang Institute of Systems Engineering Dalian University of Technology No. 2 Linggong Road Liaoning Dalian116024 China Center for Big Data and Intelligent Decision-Making Dalian University of Technology Linggong Road Liaoning Dalian116024 China School of Business East China University of Science and Technology 130 Meilong Road Xuhui District Shanghai200237 China Institute for Advanced Intelligence Dalian University of Technology Linggong Road Liaoning Dalian116024 China Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education of China Linggong Road Liaoning Dalian116024 China

ISBN: (纸本)9789819601776

The rapid advancement of science has underscored the importance of collaboration among scientists. While many studies have explored the structure of collaboration networks, there is a lack of comprehensive quantitative research on the temporal patterns of these collaborations. This study addresses this gap by analyzing temporal scientific collaboration networks in physics, spanning from 1960 to 2021, using complex network theories and methods. By constructing five-year temporal collaborative networks and employing metrics such as network diameter, shortest path, and clustering coefficient, this research reveals an increase in connectivity and small-world characteristics over time. Additionally, community detection highlights a shift towards specialized collaboration patterns and increased cross-community interactions. The study also uncovers growing centrality and social stratification within the research system, with the "rich club" phenomenon indicating strong and dynamic collaborations among highly connected scientists. Temporal analysis shows that while ultra-high connectivity scientists engage in fluctuating relationships, medium-high connectivity scientists maintain more stable collaborations. These findings provide insights into the evolution of collaborative behaviors and inform science policy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

Explaining Deep Convolutional Neural Networks for Image Classification by Evolving Local Interpretable Model-Agnostic Explanations

引用

IEEE Transactions on Emerging Topics in Computational intelligence 2025年

作者： Wang, Bin Pei, Wenbin Xue, Bing Zhang, Mengjie Nanning University Digital Economy School Nanning City530011 China Hebei University Machine Vision Engineering Research Centre Baoding071002 China Victoria University of Wellington School of Engineering and Computer Science Wellington6140 New Zealand Dalian University of Technology School of Computer Science and Technology Dalian116024 China Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Dalian116024 China

Deep convolutional neural networks (CNNs) have proven their effectiveness and are widely acknowledged as the dominant method for image classification. However, their lack of explainability remains a significant drawback, particularly in real-world applications where users need to understand the rationale behind predictions to determine their trustworthiness. Local Interpretable Model-agnostic Explanations (LIME) is a popular method for explaining deep CNN predictions, but it suffers from two major limitations: (1) a computationally expensive sampling process to generate perturbed images, and (2) the need to pre-define the number of interpretable features (superpixels), which often requires manual fine-tuning. To address these limitations, we propose a novel Genetic Algorithm (GA)-based method, called E-LIME, which automatically evolves local explanations for deep CNNs. The proposed method eliminates the need for the computationally expensive sampling process used in LIME and allows for the automatic selection of superpixels without pre-defining their number. Specifically, E-LIME introduces a flexible encoding strategy to represent superpixels as binary vectors and a new fitness function that evaluates the selected superpixels based on the probability of the deep CNN making a specific prediction. By optimising the fitness value, E-LIME selects the most informative superpixels while removing noisy features, resulting in more efficient and accurate local explanations. In the experiments, ResNet is used as an example model to be explained, and the ImageNet dataset is selected as the benchmark dataset. DenseNet and MobileNet are further explained to demonstrate the model-agnostic characteristics of the proposed method. The evolved local explanations on four randomly selected images from ImageNet show that the proposed method successfully captures meaningful interpretable features, improving the probabilities/confidences of the deep CNN models in making predictions. Moreo

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：