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

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Particle filtering methods for stochastic optimization with application to large-scale empirical risk minimization

arXiv

引用

arXiv 2018年

作者： Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing Jiangsu210023 China

There is a recent interest in developing statistical filtering methods for stochastic optimization (FSO) by leveraging a probabilistic perspective of incremental proximity methods (IPMs). The existent FSO methods are derived based on the Kalman filter (KF) and extended KF (EKF). Different from classical stochastic optimization methods such as the stochastic gradient descent (SGD) and typical IPMs, such KF-type algorithms possess a desirable property, namely they do not require pre-scheduling of the learning rate for convergence. However, on the other side, they have inherent limitations inherited from the nature of KF mechanisms. It is a consensus that the class of particle filters (PFs) outperforms the KF and its variants remarkably for nonlinear and/or non-Gaussian statistical filtering tasks. Hence, it is natural to ask if the FSO methods can benefit from the PF theory to get around of limitations of the KF-type stochastic optimization methods. We provide an affirmative answer to the aforementioned question by developing two PF based stochastic optimizers (PFSOs). For performance evaluation, we apply them to address nonlinear least-square fitting using simulated data sets and empirical risk minimization for binary classification using real data sets. Experimental results demonstrate that PFSOs outperform remarkably existent methods in terms of numerical stability, convergence speed, and flexibility in handling different types of loss functions. Copyright © 2018, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Robust Particle Filtering via Bayesian Nonparametric Outlier Modeling

arXiv

引用

arXiv 2018年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

This paper is concerned with the online estimation of a nonlinear dynamic system from a series of noisy measurements. The focus is on cases wherein outliers are present in-between normal noises. We assume that the outliers follow an unknown generating mechanism which deviates from that of normal noises, and then model the outliers using a Bayesian nonparametric model called Dirichlet process mixture (DPM). A sequential particle-based algorithm is derived for posterior inference for the outlier model as well as the state of the system to be estimated. The resulting algorithm is termed DPM based robust PF (DPM-RPF). The nonparametric feature makes this algorithm allow the data to "speak for itself" to determine the complexity and structure of the outlier model. Simulation results show that it performs remarkably better than two state-of-the-art methods especially when outliers appear frequently along time. Copyright © 2018, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Harnessing Low-Fidelity data to Accelerate Bayesian Optimization via Posterior Regularization

Harnessing Low-Fidelity Data to Accelerate Bayesian Optimiza...

引用

International Conference on big data and Smart Computing (bigCOMP)

作者： Bin Liu School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Bayesian optimization (BO) is a powerful paradigm for derivative-free global optimization of a black-box objective function (BOF) that is expensive to evaluate. However, the overhead of BO can still be prohibitive for problems with highly expensive function evaluations. In this paper, we investigate how to reduce the required number of function evaluations for BO without compromise in solution quality. We explore the idea of posterior regularization to harness low fidelity (LF) data within the Gaussian process upper confidence bound (GP-UCB) framework. The LF data can arise from previous evaluations of an LF approximation of the BOF or a related optimization task. An extra GP model called LF-GP is trained to fit the LF data. We develop an operator termed dynamic weighted product of experts (DW-POE) fusion. The regularization is induced by this operator on the posterior of the BOF. The impact of the LF GP model on the resulting regularized posterior is adaptively adjusted via Bayesian formalism. Extensive experimental results on benchmark BOF optimization tasks demonstrate the superior performance of the proposed algorithm over state-of-the-art.

关键词： Optimization Hafnium Adaptation models Bayes methods Heuristic algorithms data models Acceleration

来源：评论

学校读者我要写书评

暂无评论

Harnessing low-fidelity data to accelerate Bayesian optimization via posterior regularization

arXiv

引用

arXiv 2019年

作者： Liu, Bin School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

关键词： Function evaluation

来源：评论

学校读者我要写书评

暂无评论

Robust Particle Filtering via Bayesian Nonparametric Outlier Modeling (Poster)

Robust Particle Filtering via Bayesian Nonparametric Outlier...

引用

International Conference on Information Fusion

作者： Bin Liu School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9780996452786

ISBN: (纸本)9781728118406

This paper is concerned with the online estimation of a nonlinear dynamic system from a series of noisy measurements. The focus is on cases wherein outliers are present in-between normal noises. We assume that the outliers follow an unknown generating mechanism which deviates from that of normal noises, and then model the outliers using a Bayesian nonparametric model called Dirichlet process mixture (DPM). A sequential particle-based algorithm is derived for posterior inference for the outlier model as well as the state of the system to be estimated. The resulting algorithm is termed DPM based robust PF (DPM-RPF). The nonparametric feature makes this algorithm allow the data to “speak for itself” to determine the complexity and structure of the outlier model. Simulation results show that it performs remarkably better than two state-of-the-art methods especially when outliers appear frequently along time.

关键词： Noise measurement Inference algorithms Bayes methods Computational modeling Atmospheric measurements Particle measurements Pollution measurement

来源：评论

学校读者我要写书评

暂无评论

LogPal: A Generic Anomaly Detection Scheme of Heterogeneous Logs for Network Systems

引用

security and Communication Networks 2023年第1期2023卷

作者： Sun, Lei Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

As a key resource for diagnosing and identifying problems, network syslog contains vast quantities of information. And it is the main source of data for anomaly detection of systems. Syslog presents the characteristics of large scale, diverse types and sources, data noise, and quick evolvement, which makes the detection methods not generic enough. To effectively address problem of log anomaly labelling caused by massive heterogeneous logs, we propose LogPal, a generic anomaly detection scheme of heterogeneous logs for network systems, which innovatively combines template sequences and raw log sequences to construct and generate log pattern events. By improving the self-attention mechanism of transformer, LogPal proactively synthesizes self-attention and handles log pattern events in a unique way. The model can make full use of log template and sequence semantic information, by automatically becoming aware of the pattern of logs. We implemented experiments to evaluate the performance of LogPal on publicly available datasets, and the outcome of the experiments shows that LogPal automatically adapts to log type changes and improves precision, recall, and F1 score to 99% on publicly available datasets. © 2023 Lei Sun and Xiaolong Xu.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

MNN: Mixed Nearest-Neighbors for Self-Supervised Learning

arXiv

引用

arXiv 2023年

作者： Long, Xianzhong Peng, Chen Li, Yun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

In contrastive self-supervised learning, positive samples are typically drawn from the same image but in different augmented views, resulting in a relatively limited source of positive samples. An effective way to alleviate this problem is to incorporate the relationship between samples, which involves including the top-K nearest neighbors of positive samples. However, the problem of false neighbors (i.e., neighbors that do not belong to the same category as the positive sample) is an objective but often overlooked challenge due to the query of neighbor samples without supervision information. In this paper, we present a simple self-supervised learning framework called Mixed Nearest-Neighbors for Self-Supervised Learning (MNN). MNN optimizes the influence of neighbor samples on the semantics of positive samples through an intuitive weighting approach and image mixture operations. The results demonstrate that MNN exhibits exceptional generalization performance and training efficiency on four benchmark datasets. © 2023, CC BY.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Dafl: Domain Adaptation-Based Federated Learning for Privacy-Preserving Biometric Recognition

SSRN

引用

SSRN 2023年

作者： Wang, Zhousheng Yang, Geng Dai, Hua Bai, Yunlu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big data Security & Intelligent Processing Nanjing210023 China

With the introduction of data protection regulation in various countries, traditional centralized learning for the exploitation of sensitive biological information will gradually become unsustainable. We take face and speaker recognition systems as examples, to consider the possibility of implementing them using federated learning. It is known that federated learning methods still have some issues to be solved, e.g., parameter updates delivered can still reveal user privacy. Besides, existing privacy-preserving methods such as encryption and perturbation could pose other problems, including low accuracy and high training overhead, which can be more prominent in biometric recognition scenarios. We adopt the idea of domain adaptation and propose a new federated learning framework, DAFL, focusing on the improvement of the training efficiency and model performance, to achieve a practical privacy-preserving biometric recognition scheme for the first time. We also design a special dropout method for it to address the possible imbalance of biometric samples across users. Experiments on real-world datasets show that our approach can achieve up to 95.6% and 97.9% accuracy in face recognition and speaker recognition tasks, respectively, under medium privacy settings. Compared with existing work, it can save 56.0% of training time with a 3.1% accuracy loss in the best case. © 2023, The Authors. All rights reserved.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

On Link Formation in Heterogeneous Information Networks: A View Based on Multi-Label Learning

On Link Formation in Heterogeneous Information Networks: A V...

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Ke-Jia Chen Shijun Xue Yun Li Bin Liu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu China

ISBN: (数字)9781450349932

ISBN: (纸本)9781450349932

This paper studies the problem of relationship prediction in heterogeneous information networks. Our goal is not only to predict links/relationships more accurately but also to provide more viable paths to facilitate the formation of new links/relationships. A relationship prediction method based on multi-label learning named ML 3 P is proposed. In ML 3 P, each meta-path between nodes is regarded as a type of relationship and is given a label. Under the framework of multi-label learning, any potential relationship including the target relationship can be predicted. The results of comparative experiments in DBLP and Twitter datasets show that ML 3 P better uses heterogeneous information in supervised learning process and thus achieves better performance. Moreover, our method can output the correlation between relationships.

关键词： Twitter Task analysis Feature extraction Training Measurement Correlation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：