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

A survey on federated learning:a perspective from multi-party computation

Frontiers of Computer Science 2024年第1期18卷 93-103页

作者： Fengxia LIU Zhiming ZHENG Yexuan SHI Yongxin TONG Yi ZHANG Institute of Artificial Intelligence and Key Laboratory of Mathematics Informatics Behavioral Semantics Beihang UniversityBeijing 100191China State Key Laboratory of Software Development Environment and Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang UniversityBeijing 100191China Pengcheng Laboratory Shenzhen 518055China Zhongguancun Laboratory Beijing 100190China Institute for Mathematical Sciences and Engineering Research Center of Financial Computing and Digital Engineering Renmin University of ChinaBeijing 100872China

Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw *** enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model *** survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training *** also pinpoint future directions to deploy federated learning to a wider range of applications.

关键词： sfederated learning multi-party ycomputation privacy-preserving data mining distributed learning

来源：评论

学校读者我要写书评

暂无评论

Circuit Simulation and Optimization of Quantum Search Algorithm 6

Circuit Simulation and Optimization of Quantum Search Algori...

引用

6th International Conference on Electronic Information Technology and Computer engineering, EITCE 2022

作者： Liu, Xiaonan Zhao, Chenyan Xie, Haoshan Liu, Zhengyu State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University China School of Computer and Artificial Intelligence ZhengZhou University China

ISBN: (纸本)9781450397148

At present, the scale of quantum computers in the real sense is still small, and quantum simulation has become one of the important ways of quantum theory research, grover quantum search algorithm is suitable for the search problem of disordered database. Firstly, according to the implementation principle of Grover algorithm and Boolean logic relationship, the design idea of multi-objective Oracle is analyzed, based on IBMQ quantum cloud platform, the quantum circuit of Grover algorithm with multi-objective items is simulated. Based on the characteristics of Grover algorithm and the simulation process of quantum gate, the action of multiple identical quantum gates is combined to reduce the update times of probability amplitude and improve the simulation efficiency. The libquantum quantum simulator is used for experiments and the target item is successfully searched, which proves the feasibility of the optimization method and provides reference for the simulation and optimization of other quantum algorithms. © 2022 Association for computing Machinery.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Continual learning with Bayesian model based on a fixed pre-trained feature extractor

引用

Visual intelligence 2023年第1期1卷 1-14页

作者： Yang, Yang Cui, Zhiying Xu, Junjie Zhong, Changhong Zheng, Wei-Shi Wang, Ruixuan School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Department of Network Intelligence Peng Cheng Laboratory Shenzhen China Key Laboratory of Machine Intelligence and Advanced Computing MOE Guangzhou China

Deep learning has shown its human-level performance in various applications. However, current deep learning models are characterized by catastrophic forgetting of old knowledge when learning new classes. This poses a challenge such as in intelligent diagnosis systems where initially only training data of a limited number of diseases are available. In this case, updating the intelligent system with data of new diseases would inevitably downgrade its performance on previously learned diseases. Inspired by the process of learning new knowledge in human brains, we propose a Bayesian generative model for continual learning built on a fixed pre-trained feature extractor. In this model, knowledge of each old class can be compactly represented by a collection of statistical distributions, e.g., with Gaussian mixture models, and naturally kept from forgetting in continual learning over time. Unlike existing class-incremental learning methods, the proposed approach is not sensitive to the continual learning process and can be additionally well applied to the data-incremental learning scenario. Experiments on multiple medical and natural image classification tasks reveal that the proposed approach outperforms state-of-the-art approaches that even keep some images of old classes during continual learning of new classes. © The Author(s) 2023.

关键词： Bayesian model Continual learning Fixed feature extractor Generative approach

来源：评论

学校读者我要写书评

暂无评论

Improvement and optimization of consensus algorithm based on PBFT 4

Improvement and optimization of consensus algorithm based on...

引用

4th International Conference on Communications, Information System and Computer engineering, CISCE 2022

作者： Zhao, Liang Li, Bin Zhou, Qinglei Chen, Xiaojie Zhengzhou University School of Computer and Artificial Intelligence Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (数字)9781665498487

ISBN: (纸本)9781665498487

This paper proposes an improved consensus algorithm based on PBFT(EBCR-PBFT). Firstly, The Modified Random Select(MRS) function is used to perform preliminary screening of network nodes, so as to solve the problem of multiple and redundant network nodes. Secondly, based on the idea of clustering, logical stratification of blockchain network nodes can reduce communication times and improve network efficiency. Thirdly, the core module of MRS is optimized by FPGA to further improve the efficiency of the algorithm. At the same time, the improved dynamic reputation evaluation model is introduced to evaluate and feedback the node behavior in time to ensure the smooth operation of the system. Experiments show that the proposed and optimized consensus algorithm can effectively improve the consensus efficiency, timely punish malicious nodes, increase the reliability of nodes, communication overhead, throughput, delay and other high performance, has a certain application value. © 2022 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

CROSS-SCENE PERSON TRAJECTORY ANOMALY DETECTION BASED ON RE-IDENTIFICATION

CROSS-SCENE PERSON TRAJECTORY ANOMALY DETECTION BASED ON RE-...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Li, Yuanxun Wu, Ancong Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (纸本)9781665438643

In this work, we consider the cross-scene person trajectory anomaly detection problem, which detects the anomalous trajectories across multiple nonoverlapping scenes. This problem is highly significant for public security, but it is still underexplored. Since the trajectory is not continuous across nonoverlapping camera views, we take use of person re-identification (re-ID) to associate the same pedestrian in different scenes while mitigating its inaccuracy by a directional probabilistic graph. To better distinguishing normal samples from anomalies, We formulate a maximized margin graph autoencoder (MMGAE) model, and the reconstruction error of the MMGAE is regarded as an anomaly indicator for the sample. To verify the effectiveness of our approach, we collected and labeled a new dataset. we also explore the impact of the re-ID performance on the anomaly detection problem and the effect of an inaccurately constructed graph on the MMGAE. © 2021 IEEE

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Real-to-Sim Grasp: Rethinking the Gap between Simulation and Real World in Grasp Detection 8

Real-to-Sim Grasp: Rethinking the Gap between Simulation and...

引用

8th Conference on Robot Learning, CoRL 2024

作者： Cai, Jia-Feng Chen, Zibo Wu, Xiao-Ming Jiang, Jian-Jian Wei, Yi-Lin Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

For 6-DoF grasp detection, simulated data is expandable to train more powerful model, but it faces the challenge of the large gap between simulation and real world. Previous works bridge this gap with a sim-to-real way1. However, this way explicitly or implicitly forces the simulated data to adapt to the noisy real data when training grasp detectors, where the positional drift and structural distortion within the camera noise will harm the grasp learning. In this work, we propose a Real-to-Sim framework for 6-DoF Grasp detection, named R2SGrasp, with the key insight of bridging this gap in a real-to-sim way2, which directly bypasses the camera noise in grasp detector training through an inference-time real-to-sim adaption. To achieve this real-to-sim adaptation, our R2SGrasp designs the Real-to-Sim Data Repairer (R2SRepairer) to mitigate the camera noise of real depth maps in data-level, and the Real-to-Sim Feature Enhancer (R2SEnhancer) to enhance real features with precise simulated geometric primitives in feature-level. To endow our framework with the generalization ability, we construct a large-scale simulated dataset cost-efficiently to train our grasp detector, which includes 64,000 RGB-D images with 14.4 million grasp annotations. Sufficient experiments show that R2SGrasp is powerful and our real-to-sim perspective is effective. The real-world experiments further show great generalization ability of R2SGrasp. Project page is available on https://***/R2SGrasp. © 2024 Proceedings of Machine Learning Research.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Clause-level Relationship-aware Math Word Problems Solver

引用

Machine intelligence Research 2022年第5期19卷 425-438页

作者： Chang-Yang Wu Xin Lin Zhen-Ya Huang Yu Yin Jia-Yu Liu Qi Liu Gang Zhou Anhui Province Key Laboratory of Big Data Analysis and Application School of Data ScienceUniversity of Science and Technology of ChinaHefei 230026China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China Laboratory of Mathematical Engineering and Advanced Computing Information Engineering UniversityZhengzhou 450001China

Automatically solving math word problems,which involves comprehension,cognition,and reasoning,is a crucial issue in artificial intelligence *** math word problem solvers mainly work on word-level relationship extraction and the generation of expression solutions while lacking consideration of the clause-level *** this end,inspired by the theory of two levels of process in comprehension,we propose a novel clause-level relationship-aware math solver(CLRSolver)to mimic the process of human comprehension from lower level to higher ***,in the lower-level processes,we split problems into clauses according to their natural division and learn their *** the higher-level processes,following human′s multi-view understanding of clause-level relationships,we first apply a CNN-based module to learn the dependency relationships between clauses from word relevance in a local ***,we propose two novel relationship-aware mechanisms to learn dependency relationships from the clause semantics in a global ***,we enhance the representation of clauses based on the learned clause-level dependency *** expression generation,we develop a tree-based decoder to generate the mathematical *** conduct extensive experiments on two datasets,where the results demonstrate the superiority of our framework.

关键词： Artificial intelligence(AI) artificial neural network(ANN) computational mathematics machine intelligence machine learning

来源：评论

学校读者我要写书评

暂无评论

DeepFake Videos Detection Based on Texture Features

引用

Computers, Materials & Continua 2021年第7期68卷 1375-1388页

作者： Bozhi Xu Jiarui Liu Jifan Liang Wei Lu Yue Zhang School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security TechnologyMinistry of Education Key Laboratory of Machine Intelligence and Advanced ComputingSun Yat-sen UniversityGuangzhou510006China Department of Computer Science University of Massachusetts LowellLowell01854MAUSA

In recent years,with the rapid development of deep learning technologies,some neural network models have been applied to generate fake ***,a deep learning based forgery technology,can tamper with the face easily and generate fake videos that are difficult to be distinguished by human *** spread of face manipulation videos is very easy to bring fake ***,it is important to develop effective detection methods to verify the authenticity of the *** to that it is still challenging for current forgery technologies to generate all facial details and the blending operations are used in the forgery process,the texture details of the fake face are ***,in this paper,a new method is proposed to detect DeepFake ***,the texture features are constructed,which are based on the gradient domain,standard deviation,gray level co-occurrence matrix and wavelet transform of the face ***,the features are processed by the feature selection method to form a discriminant feature vector,which is finally employed to SVM for classification at the frame *** experimental results on the mainstream DeepFake datasets demonstrate that the proposed method can achieve ideal performance,proving the effectiveness of the proposed method for DeepFake videos detection.

关键词： DeepFake video tampering tampering detection texture feature

来源：评论

学校读者我要写书评

暂无评论

Class-specific Prompts in Vision Transformer for Continual Learning of New Diseases

Class-specific Prompts in Vision Transformer for Continual L...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Zhao, Defeng Ye, Zejun Zheng, Wei-Shi Wang, Ruixuan Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Peng Cheng Laboratory Department of Network Intelligence Shenzhen China Moe Key Laboratory of Machine Intelligence and Advanced Computing China

ISBN: (纸本)9798350337488

Current intelligent diagnosis systems are often trained to diagnose a small number of diseases and lack the ability of continually learning new disease knowledge. To have such continual learning ability, the deployed intelligent system needs to be continually updated based on training data of only new diseases, without accessing old data of previously learned diseases due to privacy concerns and challenges in data sharing across medical centers. In this study, a novel and effective prompt learning strategy is proposed to help a pretrained and fixed Vision Transformer (ViT) continually learn new diseases. In particular, a set of unique prompts for each disease are effectively learned such that discriminative disease features can be well extracted from the fixed ViT under the instructions of prompts during feature extraction, even though the ViT feature extractor is pretrained in the natural image domain. Extensive empirical evaluations on two medical image datasets and one natural image dataset demonstrate the superior performance of the proposed method. The source code is available at https://***/zhaoedf/CSPrompt. © 2023 IEEE.

关键词： Continual learning Disease diagnosis Prompt learning

来源：评论

学校读者我要写书评

暂无评论

LCOC: A Low-cost Optimizing Compiler for Large Scale Quantum Programs Towards Realistic Hardware

LCOC: A Low-cost Optimizing Compiler for Large Scale Quantum...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Yu Zhu Jinchen Xu Qing Mu Hongru Yang Xiaodong Ding Qiming Du Zheng Shan Laboratory for Advanced Computing and Intelligence Engineering China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Quantum compilers play an essential role in the translation of quantum algorithms on quantum hardware. As the size of quantum programs increases, the problem of extreme compilation overhead becomes apparent. To address this problem, compilation frameworks with high-level intermediate representations such as QCOR have been introduced. However, these frameworks still face significant overhead from qubit mapping and optimizing sequence redundancy, resulting in challenges when compiling circuits to realistic hardware. In our paper, a low-cost optimizing compiler (LCOC) is proposed, which addresses the overhead in qubit mapping and enhanced the optimization capabilities. A qubit mapping optimizer based on the LLVM Polly is introduced in LCOC, which implements an efficient mapping of quantum programs containing specific loop types. While achieving low-cost mapping, it considerably reduces the depth of the circuit. We also implement an optimization sequence generator that leverages the modularity of LLVM and iterative compilation to provide LCOC with a more flexible and efficient optimization sequence. We conduct experiments with 100+ qubit circuits. Experiments show that LCOC is up to 1540× faster compared to Qiskit and 74× faster compared to QCOR in compile time. The average speedup relative to Qiskit and QCOR are 194× and 8.64×, respectively. In addition, it can effectively reduce the circuit depth by 50.32% compared to Qiskit and 83.5% compared to QCOR on average.

关键词： Translation Quantum algorithm Optimizing compilers Qubit Circuits Redundancy Hardware Generators Iterative methods Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：