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

AUCPro: AUC-Oriented Provable Robustness Learning

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第6期47卷 4579-4596页

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Beijing100093 China University of Chinese Academy of Sciences School of Cyber Security Beijing100049 China Security Department Alibaba Group Hangzhou311121 China Sun Yat-sen University School of Cyber Science and Technology Shenzhen Campus Shenzhen518107 China Beijing101408 China Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China

The current studies of provable robustness for deep neural networks (DNNs) usually assume that the class distribution is overall balanced. However, in real-world applications especially for safety-sensitive systems, the class distribution often exhibits a long-tailed property. It is well-known that the Area Under the ROC Curve (AUC) is a more proper metric for long-tailed learning problems. Motivated by this fact, an AUC-oriented provable robustness learning framework (named AUCPro) is first proposed in this paper. The key is to construct a proxy model smoothed by the isotropic Gaussian noise and then consider optimizing the proxy model from the AUC-oriented learning point of view. Theoretically, we provide a certified safety region for AUCPro within which the model would be free from the 2 adversarial attacks. Most importantly, we propose a novel standard to theoretically study the robustness generalization toward unseen data for provable robustness learning approaches. To the best of our knowledge, such a problem remains barely considered in the machine learning community. To be specific, under a general principle for performance-robustness trade-off, we prove that the generalization ability of the resulting model could be equivalently expressed as the expected adversarial risk of AUC under 2 perturbation. On top of this, we present two practical settings to explore the excess risk formed by the difference between the empirical risk of AUCPro and the derived generalization performance. Finally, comprehensive experiments speak to the efficacy of our proposed algorithm. © 1979-2012 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Extracting High-order Connectivity of EEG-based Dynamic Functional Connectivity Networks for Diagnosis of Major Depressive Disorder 24

Extracting High-order Connectivity of EEG-based Dynamic Func...

引用

4th Asia-Pacific Artificial Intelligence and Big data Forum, AIBDF 2024

作者： Zhao, Feng Fan, Wenxuan Han, Zhongwei Chen, Hongyu School of Computer Science and Technology Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong Yantai China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China Information Engineering College Yantai Institute of Technology Shandong Yantai China Shandong Technology and Business University Shandong Yantai China

ISBN: (纸本)9798400710865

Functional connectivity networks (FCNs), particularly those utilizing the phase lag index (PLI) method, have been instrumental in elucidating the pathological features of Major Depressive Disorder (MDD) by assessing the synchrony and lag of electroencephalogram (EEG) signal waveforms. Currently, the more prevalent methods are traditional FCNs that quantify phase synchronization as scalar values and dynamic FCNs (D-FCNs) that employ sliding window approaches to capture the instantaneous variations in functional connectivity. However, these two methods merely capture the low-level functional connections between paired regions of interest (ROIs) from both the static and dynamic perspectives, and fail to reflect the high-level functional connections involving multiple ROIs. Moreover, the feature dimension of the dynamic FCN is excessively high, and there exists a phase mismatch issue between different samples, which renders it impossible to be directly applied to the classification task, and no better solution is available at present. To mitigate these issues, we proposed a comprehensive framework that includes segmenting EEG sequences based on PLI to construct dynamic FCNs;employing seventh-order central moments for feature extraction to form low-order FCNs (Lo-FCNs);and establishing high-order FCNs (Ho-FCNs) based on Pearson correlation theory derived from Lo-FCNs. We conducted classification experiments across four distinct EEG frequency bands using our proposed framework while analyzing relevant features through graph theory and brain topological mapping techniques. The experiments showed that the proposed framework has a high classification accuracy rate in the classification experiments of MDD and NC, and proved the importance of high-order features in classification experiments, indicating that they may serve as physiological markers for MDD diagnosis. © 2024 Copyright held by the owner/author(s).

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Approximating the total variation distance between spin systems

arXiv

引用

arXiv 2025年

作者： Feng, Weiming Liu, Hongyang Yang, Minji School of Computing and Data Science The University of Hong Kong Hong Kong State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University China

Spin systems form an important class of undirected graphical models. For two Gibbs distributions µ and ν induced by two spin systems on the same graph G = (V, E), we study the problem of approximating the total variation distance dTV (µ, ν) with an Ε-relative error. We propose a new reduction that connects the problem of approximating the TV-distance to sampling and approximate counting. Our applications include the hardcore model and the antiferromagnetic Ising model in the uniqueness regime, the ferromagnetic Ising model, and the general Ising model satisfying the spectral condition. Additionally, we explore the computational complexity of approximating the total variation distance dTV (µS, νS) between two marginal distributions on an arbitrary subset S ⊆ V . We prove that this problem remains hard even when both µ and ν admit polynomial-time sampling and approximate counting algorithms. © 2025, CC BY.

关键词： Ising model

来源：评论

学校读者我要写书评

暂无评论

LSDK-LegalSum: improving legal judgment summarization using logical structure and domain knowledge

引用

Journal of King Saud University - Computer and Information sciences 2025年第1期37卷 1-15页

作者： Gao, Wei Yu, Shuai Qin, Yongbin Yang, Caiwei Huang, Ruizhang Chen, Yanping Lin, Chuan Engineering Research Center of Text Computing & CognitiveIntelligence Ministry of Education Guizhou University Guizhou Huaxi Guiyang 550025 China State Key Laboratory of Public Big Data Guizhou University Guizhou Huaxi Guiyang 550025 China College of Computer Science and Technology Guizhou University Guizhou Huaxi Guiyang 550025 China

Legal judgment summarization enhances the efficiency and accuracy of processing and retrieving similar cases by distilling key information from legal judgment documents. Legal judgments, which record the trial process and outcome, tend to have lengthy texts. However, most existing methods for legal judgment summarization struggle to effectively handle long texts and focus only on the serialized text information, neglecting the auxiliary role of the document’s logical structure in generating summaries. Additionally, legal judgment documents contain extensive domain knowledge formed by professional legal terminology, which is crucial for accurately understanding and analyzing the content of the documents. We propose a method to improve the quality of legal judgment summaries by utilizing logical structures and domain knowledge (LSDK-LegalSum). Specifically, we first use a multi-label document classification approach to divide the legal judgment into four parts: ‘Type’, ‘Claim’, ‘Fact’ and ‘Result’, then generate a summary of the ‘Type’ part, and combine it with the ‘Claim’ part to create a new summary, and so forth until the final summary is produced. Moreover, the case descriptions in legal judgments cause substantial textual noise;therefore, we employ a text-denoising method that integrates domain knowledge to further enhance the performance of the summaries. Extensive experiments on the CAIL2020 legal summarization dataset have shown that our method achieves improvements of 8.37, 16.64, and 13.07 percentage points in Rouge-1, Rouge-2, and Rouge-L scores respectively over the state-of-the-art models. This demonstrates that our method not only produces concise and semantically complete summaries but also ensures that the content is logically rigorous and well-organized, meeting practical needs more effectively. © The Author(s) 2025.

关键词： Abstractive summarization Domain knowledge Legal judgment summarization Logical structure Low-source summarization

来源：评论

学校读者我要写书评

暂无评论

BAST: Blockchain-Assisted Secure and Traceable data Sharing Scheme for Vehicular Networks

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4664-4678页

作者： Liu, Xinzhong Cui, Jie Zhang, Jing Yin, Rongwang Zhong, Hong Wei, Lu Bolodurina, Irina He, Debiao School of Computer Science and Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei230039 China Hefei University Department of Basic Experiment and Training Hefei230601 China Orenburg State University Faculty of Mathematics and Information Technologies Orenburg460018 Russia Wuhan University School of Cyber Science and Engineering 430072 China MatrixElements Technologies Shanghai Key Laboratory of Privacy Preserving Computation Shanghai201204 China

In vehicular networks, caching service content on edge servers (ESs) is a widely accepted strategy for promptly responding to vehicle requests, reducing communication overhead, and improving service experience. However, implementing such an architecture requires addressing the challenges associated with ES response data reliability and communication security. In this study, to tackle the ES response data reliability issue, a blockchain-assisted threshold signature scheme for cache-based vehicular networks is proposed. The scheme utilizes a threshold mechanism to sign the data broadcast by the ES, incorporates blockchain to trace malicious signers, and avoids the shortcomings and limitations associated with idealized assumptions for the ES in existing data-sharing schemes. Moreover, considering the communication security and high-speed mobility of vehicles, using the non-interactive signatures of knowledge based on the Σ-protocol, a secure and efficient message authentication scheme for vehicles and ESs is provided. Through rigorous security proofs and comprehensive analyses, our scheme satisfies the communication security requirements of vehicular networks. By leveraging the JPBC library for performance analysis, the proposed scheme demonstrates advantages as concerns both computation and communication overheads compared to related schemes. Moreover, we implemented the proposed scheme on an Ethereum test network (i.e., Goerli) to validate its feasibility. © 2005-2012 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

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

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

DMC-Watermark: A backdoor richer watermark for dual identity verification by dynamic mask covering

引用

Applied Intelligence 2025年第8期55卷 1-15页

作者： Zhu, Yujia Wang, Ruoxi Xia, Daoxun School of Big Data and Computer Science Guizhou Normal University Guiyang China Guizhou Key Laboratory of Advanced Computing Guizhou Normal University Guiyang China Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang China

With the increasing use of neural networks, the importance of copyright protection for these models has gained significant attention. Backdoor watermarking is one of the key methods for protecting copyright. However, on the one hand, most existing backdoor watermarks are triggered by visual images, making them easily detectable, and therefore vulnerable to various attacks. On the other hand, it is difficult for these methods to carry information related to the creator’s identity which can easily lead to fraudulent claims of ownership. These factors contribute to the vulnerability and limitations of backdoor watermarking. In this paper, we propose DMC-Watermark, a backdoor richer watermarking method that uses dynamic mask-covered image structures as triggers. Leveraging the semantic preservation of image structure in transformation attacks, we select image structure as triggers. Furthermore, we convert the author-related information into an array of color information and apply it as a mask to the extracted image structures, allowing it to serve as a second layer of verification during the validation phase to resist fraudulent claims of ownership. The final trigger pattern, embedded with author-related image structures, is applied to the selected images in the trigger set, generating a final trigger set that is trained together with clean samples to produce a protected model. The experiments show that the proposed DMC-Watermark performs well in terms of fidelity, invisibility, undetectability, functionality, dual verification and robustness on three different datasets and four representative DNNs, and it has wide applicability and excellent results in high-resolution images. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

Unified Graph and Hypergraph Neural Network for Next-item Recommendation

Unified Graph and Hypergraph Neural Network for Next-item Re...

引用

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

作者： Xinyu Zhang Qize Jiang Hanyuan Zhang Weiwei Sun School of Computer Science Shanghai Key Laboratory of Data Science Fudan University Shanghai China Shanghai Institute of Intelligent Electronics & Systems Shanghai China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The task of next-item recommendation is a crucial component in recommendation systems. The challenge of this task lies in extracting complex interaction information from users’ historical interactions with items. While prior research has transformed users’ interaction histories into graphs and hypergraphs to mine high-order interactions, the integration of both remains uncharted. Existing methods treat graphs and hypergraphs separately in representation learning, missing out on their shared attributes. Addressing this gap, we introduce a novel unified framework that integrates graphs and hypergraphs into one unified message passing paradigm. Our method employs graph neural networks and hypergraph neural networks to continuously conduct representation learning, achieving end-to-end next item recommendation. Specifically, our framework consists of the following components: 1) a unique method for graph and hypergraph construction from interaction histories, with items as nodes and users as hyperedges; 2) a novel message passing framework compatible with both graph and hypergraph neural networks; and 3) an innovative hypergraph neural network aggregation module enhanced with time and position encoders. The test results on multiple public benchmarks verify that our method outperforms current best practices in performance.

关键词： Representation learning Message passing Benchmark testing Signal processing Graph neural networks History data mining Speech processing Recommender systems Best practices

来源：评论

学校读者我要写书评

暂无评论

Position-aware Hypergraph Message-Passing Neural Network

Position-aware Hypergraph Message-Passing Neural Network

引用

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

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Hypergraph neural networks can model more flexible connectivity relationships, are used to model higher-order interactions, and have produced strong results in many real-world applications. However, the currently existing hypergraph neural networks need more exploration in capturing the global positional information of nodes in hypergraphs. Although there have been many explorations of the problem in graph neural networks, extending these approaches to hypergraphs is fraught with challenges. The major challenge is that hyperedges in hypergraphs are the other dimensional element of the incidence structure, have more flexible definitions than edges in graphs, and require more attention when learning global positional information. We propose a novel position-aware hypergraph message-passing neural network framework to address the above challenges. Specifically, we propose a global positional embedding learning approach that can separately model global positional information for nodes and hyperedges. At the same time, we also optimize the learning of local structures with hyperedges. Experiments on several publicly available benchmark datasets find that our proposed method outperforms many state-of-the-art methods.

关键词： Neural networks Transforms Benchmark testing Signal processing Graph neural networks Acoustics Speech processing

来源：评论

学校读者我要写书评

暂无评论

UNeLF: Unconstrained Neural Light Field for Self-Supervised Angular Super-Resolution

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhao, Mingyuan Sheng, Hao Chen, Rongshan Cong, Ruixuan Cui, Zhenglong Yang, Da Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Data Science and Intelligent Computing Laboratory Hangzhou International Innovation Institute Hangzhou311115 China Macao Polytechnic University Faculty of Applied Sciences 999078 China

Compared to supervised learning methods, self-supervised learning methods address the domain gap problem between light field (LF) datasets collected under varying acquisition conditions, which typically leads to decreased performance when differences exist in the distribution between the training and test sets. However, current self-supervised light field angular super-resolution (LFASR) techniques primarily focus on exploiting discrete spatial-angular features while neglecting continuous LF information. In contrast to previous work, we propose a self-supervised unconstrained neural light field (UNeLF) to continuously represent LF for LFASR. Specifically, any LF can be described as the camera pose for each sub-aperture image (SAI) and the two-plane that captures these SAIs. To describe the former, we introduce a SAIs-dependent pose optimization method to solve the issue that arises from the narrow baseline of most LF data, which hinders robust camera pose estimation. This mechanism reduces the number of trainable camera parameters from a quadratic to a constant scale, thereby alleviating the complexity of joint optimization. For the latter, we propose a novel adaptive two-plane parameterization strategy to determine the two-plane that captures these SAIs, facilitating refocusing. Finally, we jointly optimize the camera parameters, near-far planes and neural light field, efficiently mapping each adaptive two-plane parameterized ray to its correspondence color in a continuous manner. Comprehensive experiments demonstrate that UNeLF achieves faster training and inference with fewer computational resources while exhibiting superior performance on both synthetic and real-world datasets. © 1991-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：