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

Practical two-party privacy-preserving neural network based on secret sharing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

Improved fluid search optimization-based real-time weed mapping

学校读者我要写书评

暂无评论

Information Processing in Agriculture 2020年第3期7卷 403-417页

作者： Chengcheng Chen Shengsheng Wang Xianchang Wang Helong Yu Ruyi Dong College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Information Technology Jilin Agricultural UniversityChangchun 130118China Chengdu Kestrel Artificial Intelligence Institute Chengdu 611730China

In the field of agriculture,variable-rate herbicide spraying(VRHS)technology has been used to solve the low efficiency of pesticides and crop chemical *** key of VRHS is the quick and precise identification of weeds from field images,which forms a weed *** search optimization(FSO)was able to simplify the threshold optimization process to create a weed map,which simulated the fluid flowing from high pressure to low pressure,but it is time consuming and often converges ***,an explosion mechanism and a twophase optimization were introduced to improve the FSO-based segmentation *** of segmentation weeds from a corn field at seedling growth stage showed that the IFSO algorithm obtained the best accuracy of 93.3%and the least running time of 0.019 s,compared with the standard PSO,GA,and FSO algorithms.

关键词： Variable-rate herbicide spraying Weed map Fluid search optimization algorithm Otsu

GPFedRec: Graph-Guided Personalization for Federated Recommendation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Zhang, Zijian Yan, Peng Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia UMIACS University of Maryland Maryland United States College of Computer Science and Technology Jilin University City University of Hong Kong China

The federated recommendation system is an emerging AI service architecture that provides recommendation services in a privacy-preserving manner. Using user-relation graphs to enhance federated recommendations is a promising topic. However, it is still an open challenge to construct the user-relation graph while preserving data locality-based privacy protection in federated settings. Inspired by a simple motivation, similar users share a similar vision (embeddings) to the same item set, this paper proposes a novel Graph-guided Personalization for Federated Recommendation (GPFedRec). The proposed method constructs a user-relation graph from user-specific personalized item embeddings at the server without accessing the users' interaction records. The personalized item embedding is locally fine-tuned on each device, and then a user-relation graph will be constructed by measuring the similarity among client-specific item embeddings. Without accessing users' historical interactions, we embody the data locality-based privacy protection of vanilla federated learning. Furthermore, a graph-guided aggregation mechanism is designed to leverage the user-relation graph and federated optimization framework simultaneously. Extensive experiments on five benchmark datasets demonstrate GPFedRec's superior performance. The in-depth study validates that GPFedRec can generally improve existing federated recommendation methods as a plugin while keeping user privacy safe. Code is available to ease reproducibility. Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

Evolutionary generative adversarial networks with crossover based knowledge distillation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Junjie Zhang, Junwei Gong, Xiaoyu Lü, Shuai Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generative Adversarial Networks (GAN) is an adversarial model, and it has been demonstrated to be effective for various generative tasks. However, GAN and its variants also suffer from many training problems, such as mode collapse and gradient vanish. In this paper, we firstly propose a general crossover operator, which can be widely applied to GANs using evolutionary strategies. Then we design an evolutionary GAN framework named C-GAN based on it. And we combine the crossover operator with evolutionary generative adversarial networks (E-GAN) to implement the evolutionary generative adversarial networks with crossover (CE-GAN). Under the premise that a variety of loss functions are used as mutation operators to generate mutation individuals, we evaluate the generated samples and allow the mutation individuals to learn experiences from the output in a knowledge distillation manner, imitating the best output outcome, resulting in better offspring. Then, we greedily select the best offspring as parents for subsequent training using discriminator as an evaluator. Experiments on real datasets demonstrate the effectiveness of CE-GAN and show that our method is competitive in terms of generated images quality and time efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

CLDG: Contrastive Learning on Dynamic Graphs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2024, CC BY.

关键词： Contrastive Learning

Wide aspect ratio matching for robust face detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Luo, Shi Li, Xiongfei Zhang, Xiaoli Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Recently, anchor-based methods have achieved great progress in face detection. Once anchor design and anchor matching strategy determined, plenty of positive anchors will be sampled. However, faces with extreme aspect ratio always fail to be sampled according to standard anchor matching strategy. In fact, the max IoUs between anchors and extreme aspect ratio faces are still lower than fixed sampling threshold. In this paper, we firstly explore the factors that affect the max IoU of each face in theory. Then, anchor matching simulation is performed to evaluate the sampling range of face aspect ratio. Besides, we propose a Wide Aspect Ratio Matching (WARM) strategy to collect more representative positive anchors from ground-truth faces across a wide range of aspect ratio. Finally, we present a novel feature enhancement module, named Receptive Field Diversity (RFD) module, to provide diverse receptive field corresponding to different aspect ratios. Extensive experiments show that our method can help detectors better capture extreme aspect ratio faces and achieve promising detection performance on challenging face detection benchmarks, including WIDER FACE and FDDB datasets. © 2021, CC BY.

关键词： Aspect ratio

Xdn: towards efficient inference of residual neural networks on cambricon chips 2nd

学校读者我要写书评

暂无评论

Xdn: towards efficient inference of residual neural networks...

2nd International Symposium on Benchmarking, Measuring, and Optimization, Bench 2019

作者： Li, Guangli Wang, Xueying Ma, Xiu Liu, Lei Feng, Xiaobing State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China College of Computer Science and Technology Jilin University Changchun China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun China

ISBN: (纸本)9783030495558

In this paper, we present XDN, an optimization and inference engine for accelerating residual neural networks on Cambricon chips. We leverage a channel pruning method to compress the weights of ResNet-50. By exploring the optimization opportunities in computational graphs, we propose a layer fusion strategy, which dramatically decreases the number of scalar computation layers, such as Batch Normalization, Scale. Furthermore, we design an efficient implementation of XDN, including data preprocessing, hyper-parameter auto-tuning, etc. The experimental results show that the ResNet-50 model can achieve significant speedup without accuracy loss by using our XDN engine. © Springer Nature Switzerland AG 2020.

关键词： Engines

Resource Scheduling for UAVs-aided D2D Networks: A Multi-objective Optimization Approach

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Hongyang Liu, Yanheng Sun, Geng Wang, Pengfei Yuen, Chau College of Computer Science and Technology Jilin University Changchun130012 China Pillar Singapore University of Technology and Design Singapore487372 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Computer Science and Technology Dalian University of Technology Dalian116024 China School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore

Unmanned aerial vehicles (UAVs)-aided device-to-device (D2D) networks have attracted great interests with the development of 5G/6G communications, while there are several challenges about resource scheduling in UAVs-aided D2D networks. In this work, we formulate a UAVs-aided D2D network resource scheduling optimization problem (NetResSOP) to comprehensively consider the number of deployed UAVs, UAV positions, UAV transmission powers, UAV flight velocities, communication channels, and UAV-device pair assignment so as to maximize the D2D network capacity, minimize the number of deployed UAVs, and minimize the average energy consumption over all UAVs simultaneously. The formulated NetResSOP is a mixed-integer programming problem (MIPP) and an NP-hard problem, which means that it is difficult to be solved in polynomial time. Moreover, there are trade-offs between the optimization objectives, and hence it is also difficult to find an optimal solution that can simultaneously make all objectives be optimal. Thus, we propose a non-dominated sorting genetic algorithm-III with a Flexible solution dimension mechanism, a Discrete part generation mechanism, and a UAV number adjustment mechanism (NSGA-III-FDU) for solving the problem comprehensively. Simulation results demonstrate the effectiveness and the stability of the proposed NSGA-III-FDU under different scales and settings of the D2D networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy utilization