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

Differentially Private Deep Learning with Iterative Gradient Descent Optimization

ACM/IMS Transactions on data science 2021年第4期2卷 1–27页

作者： Ding, Xiaofeng Chen, Lin Zhou, Pan Jiang, Wenbin Jin, Hai National Engineering Research Center for Big Data Technology and System Lab Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

Deep learning has achieved great success in various areas and its success is closely linked to the availability of massive data. But in general, a large dataset could include sensitive data and therefore the model should have the capability to avoid privacy leakage. To achieve this aim, many works apply the famous privacy framework named differential privacy into deep learning to preserve privacy. In this article, we propose a novel perturbed iterative gradient descent optimization (PIGDO) algorithm and prove that this algorithm satisfies the differential privacy. Besides, we propose a modified moments accountant (MMA) method to conduct the privacy analysis and obtain a tighter bound of privacy loss compared with the original moments accountant method. A number of experiments demonstrate that our optimization algorithm can not only improve the model accuracy and training speed, but also achieve better privacy guarantees over the state-of-the-art algorithm while reaching the equivalent accuracy. We provide codes for all of our experiments in https://***/CGCL-codes/***. © 2022 Association for computing Machinery.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

MOLECULE GENERATION FOR TARGET PROTEIN BINDING WITH STRUCTURAL MOTIFS 11

MOLECULE GENERATION FOR TARGET PROTEIN BINDING WITH STRUCTUR...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Zhang, Zaixi Min, Yaosen Zheng, Shuxin Liu, Qi Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence Anhui Hefei China Institute of Interdisciplinary Information Sciences Tsinghua University China Microsoft Research United States

Designing ligand molecules that bind to specific protein binding sites is a fundamental problem in structure-based drug design. Although deep generative models and geometric deep learning have made great progress in drug design, existing works either sample in the 2D graph space or fail to generate valid molecules with realistic substructures. To tackle these problems, we propose a Fragment-based LigAnd Generation framework (FLAG), to generate 3D molecules with valid and realistic substructures fragment-by-fragment. In FLAG, a motif vocabulary is constructed by extracting common molecular fragments (i.e., motif) in the dataset. At each generation step, a 3D graph neural network is first employed to encode the intermediate context information. Then, our model selects the focal motif, predicts the next motif type, and attaches the new motif. The bond lengths/angles can be quickly and accurately determined by cheminformatics tools. Finally, the molecular geometry is further adjusted according to the predicted rotation angle and the structure refinement. Our model not only achieves competitive performances on conventional metrics such as binding affinity, QED, and SA, but also outperforms baselines by a large margin in generating molecules with realistic substructures. Our code is publicly available at https://***/zaixizhang/FLAG. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction

arXiv

引用

arXiv 2023年

作者： Zhao, Jun Zhan, Wenyu Zhao, Xin Zhang, Qi Gui, Tao Wei, Zhongyu Wang, Junzhe Peng, Minlong Sun, Mingming School of Computer Science Fudan University China Institute of Modern Languages and Linguistics Fudan University China School of Data Science Fudan University China Cognitive Computing Lab Baidu Research United States

Semantic matching is a mainstream paradigm of zero-shot relation extraction, which matches a given input with a corresponding label description. The entities in the input should exactly match their hypernyms in the description, while the irrelevant contexts should be ignored when matching. However, general matching methods lack explicit modeling of the above matching pattern. In this work, we propose a fine-grained semantic matching method tailored for zero-shot relation extraction. Following the above matching pattern, we decompose the sentence-level similarity score into entity and context matching scores. Due to the lack of explicit annotations of the redundant components, we design a feature distillation module to adaptively identify the relation-irrelevant features and reduce their negative impact on context matching. Experimental results show that our method achieves higher matching F1 score and has an inference speed 10 times faster, when compared with the state-of-the-art methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

R-divergence for estimating model-oriented distribution discrepancy 23

R-divergence for estimating model-oriented distribution disc...

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Zhilin Zhao Longbing Cao Data Science Lab School of Computing & DataX Research Centre Macquarie University Sydney NSW Australia

Real-life data are often non-IID due to complex distributions and interactions, and the sensitivity to the distribution of samples can differ among learning models. Accordingly, a key question for any supervised or unsupervised model is whether the probability distributions of two given datasets can be considered identical. To address this question, we introduce R-divergence, designed to assess model-oriented distribution discrepancies. The core insight is that two distributions are likely identical if their optimal hypothesis yields the same expected risk for each distribution. To estimate the distribution discrepancy between two datasets, R-divergence learns a minimum hypothesis on the mixed data and then gauges the empirical risk difference between them. We evaluate the test power across various unsupervised and supervised tasks and find that R-divergence achieves state-of-the-art performance. To demonstrate the practicality of R-divergence, we employ R-divergence to train robust neural networks on samples with noisy labels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WebCode2M: A Real-World dataset for Code Generation from Webpage Designs 25

WebCode2M: A Real-World Dataset for Code Generation from Web...

引用

34th ACM Web Conference, WWW 2025

作者： Gui, Yi Li, Zhen Wan, Yao Shi, Yemin Zhang, Hongyu Su, Yi Chen, Bohua Chen, Dongping Wu, Siyuan Zhou, Xing Jiang, Wenbin Jin, Hai Zhang, Xiangliang Huazhong University of Science and Technology Wuhan China Peking University Beijing China Chongqing University Chongqing China Hubei University of Automotive Technology Shiyan China Rabbitpre AI Shenzhen China University of Notre Dame Notre Dame United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster Grid Computing Lab School of Computer Science and Technology China

ISBN: (纸本)9798400712746

Automatically generating webpage code from webpage designs can significantly reduce the workload of front-end developers, and recent Multimodal Large Language Models (MLLMs) have shown promising potential in this area. However, our investigation reveals that most existing MLLMs are constrained by the absence of high-quality, large-scale, real-world datasets, resulting in inadequate performance in automated webpage code generation. To fill this gap, this paper introduces WebCode2M, a new dataset comprising 2.56 million instances, each containing a design image along with the corresponding webpage code and layout details. Sourced from real-world web resources, WebCode2M offers a rich and valuable dataset for webpage code generation across a variety of applications. The dataset quality is ensured by a scoring model that filters out instances with aesthetic deficiencies or other incomplete elements. To validate the effectiveness of WebCode2M, we introduce a baseline model based on the Vision Transformer (ViT), named WebCoder, and establish a benchmark for fair comparison. Additionally, we introduce a new metric, TreeBLEU, to measure the structural hierarchy recall. The benchmarking results demonstrate that our dataset significantly improves the ability of MLLMs to generate code from webpage designs, confirming its effectiveness and usability for future applications in front-end design tools. Finally, we highlight several practical challenges introduced by our dataset, calling for further research. © 2025 Copyright held by the owner/author(s).

关键词： Web Design

来源：评论

学校读者我要写书评

暂无评论

Efficient Hardware Redo Logging for Secure Persistent Memory 23

Efficient Hardware Redo Logging for Secure Persistent Memory

引用

23rd IEEE International Conference on High Performance computing and Communications, 7th IEEE International Conference on data science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Zhang, Zhan Yue, Jianhui Liao, Xiaofei Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China Michigan Technological University Computer Science Department HoughtonMI United States

ISBN: (纸本)9781665494571

Write-ahead log and data encryption technologies are employed to ensure both crash consistency and data security for persistent memory (PM). The encryption/decryption of both data and log requests increase the memory request latency, degrading the system performance. To tackle this issue, this paper proposes a novel log-aware memory encryption scheme to reduce encryption/decryption operations, without compromising data security. Specifically, redo log blocks are stored as ciphertext for their corresponding data blocks to avoid encryption/decryption of log data blocks when in-place update operations are applied to them. We further design a compact log record layout with fewer encryption metadata in log records to reduce logging traffic. Our simulation results show that the transaction throughput of the proposed design outperforms the baseline design and the state-of-the-art design by 87.3% and 55.3% on average, respectively. © 2021 IEEE.

关键词： Smart cities System performance Simulation Memory management Layout Memory architecture Metadata

来源：评论

学校读者我要写书评

暂无评论

BOAT: Bilateral Local Attention Vision Transformer 33

BOAT: Bilateral Local Attention Vision Transformer

引用

33rd British Machine Vision Conference Proceedings, BMVC 2022

作者： Yu, Tan Zhao, Gangming Li, Ping Yu, Yizhou Cognitive Computing Lab Baidu Research 10900 NE 8th St. BellevueWA United States Department of Computer Science The University of Hong Kong Hong Kong

Vision Transformers achieved outstanding performance in many computer vision tasks. Early Vision Transformers such as ViT and DeiT adopt global self-attention, which is computationally expensive when the number of patches is large. To improve the efficiency, recent Vision Transformers adopt local self-attention mechanisms, where self-attention is computed within local windows. Despite the fact that window-based local self-attention significantly boosts efficiency, it fails to capture the relationships between distant but similar patches in the image plane. To overcome this limitation of image-space local attention, in this paper, we further exploit the locality of patches in the feature space. We group the patches into multiple clusters using their features, and self-attention is computed within every cluster. Such feature-space local attention effectively captures the connections between patches across different local windows but still relevant. We propose a Bilateral lOcal Attention vision Transformer (BOAT), which integrates feature-space local attention with image-space local attention. We further integrate BOAT with both Swin and CSWin models, and extensive experiments on several benchmark datasets demonstrate that our BOAT-CSWin model clearly and consistently outperforms existing state-of-the-art CNN models and vision Transformers. © 2022. The copyright of this document resides with its authors. It may be distributed unchanged freely in print or electronic forms.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D point clouds: class-wise transformation is all you need 24

Unlearnable 3D point clouds: class-wise transformation is al...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Xianlong Wang Minghui Li Wei Liu Hangtao Zhang Shengshan Hu Yechao Zhang Ziqi Zhou Hai Jin National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9798331314385

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples; (ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Study of Automated Anti-phishing System 9th

An Exploratory Study of Automated Anti-phishing System

引用

9th International Conference on computing and Informatics, ICOCI 2023

作者： Aziz, Mochamad Azkal Azkiya Riskhan, Basheer Zakaria, Nur Haryani Jambli, Mohamad Nazim Albukhary International University Kedah Alor Setar05200 Malaysia Data Management & Software Solution Research Lab School of Computing Universiti Utara Malaysia Kedah Sintok06010 Malaysia Faculty of Computer Science and Information Technology University Malaysia Sarawak Sarawak Kota Samarahan Malaysia

ISBN: (纸本)9789819995882

Phishing attacks have emerged as a major problem in the digital world due to a rising trend in their frequency. While various approaches have been developed to detect and prevent phishing attacks, a definitive solution to the problem has yet to be discovered. This study discusses automated anti-phishing systems while analyzing and comparing various anti-phishing strategies using exploratory research. Traditional, machine learning, and deep learning-based anti-phishing systems are discussed in the article. The study highlights the use of Artificial Intelligence (AI) based systems, particularly utilizing methods such as Convolutional Neural Networks, Support Vector Machines, and Recurrent Neural Networks. These AI-based approaches dominate the current trend in the field. This study could potentially be helpful for researchers who wish to delve deeper into the topic of automated phishing detection and prevention systems with a comprehensive review. It is advised to carry out further research to investigate the strengths and limitations of different methods and algorithms used in automated anti-phishing systems to understand their performance and effectiveness better. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

HYPERBOLIC HYPERGRAPH NEURAL NETWORKS FOR MULTI-RELATIONAL KNOWLEDGE HYPERGRAPH REPRESENTATION

arXiv

引用

arXiv 2024年

作者： Li, Mengfan Shi, Xuanhua Qiao, Chenqi Zhang, Teng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Knowledge hypergraphs generalize knowledge graphs using hyperedges to connect multiple entities and depict complicated relations. Existing methods either transform hyperedges into an easier-to-handle set of binary relations or view hyperedges as isolated and ignore their adjacencies. Both approaches have information loss and may potentially lead to the creation of sub-optimal models. To fix these issues, we propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing, a novel scheme motivated by a lossless expansion of hyperedges into hierarchies. It implements a direct embedding that consciously incorporates adjacent entities, hyper-relations, and entity position-aware information. As the name suggests, H2GNN operates in the hyperbolic space, which is more adept at capturing the tree-like hierarchy. We compare H2GNN with 15 baselines on knowledge hypergraphs, and it outperforms state-of-the-art approaches in both node classification and link prediction tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：