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

2021 International Conference on Computer network Security and Software Engineering, CNSSE 2021

作者： Guo, Xiaozhou Liu, Yi Tan, Kaijun Jin, Min Lu, Huaxiang Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China University of Chinese Academy of Sciences Beijing100089 China Cas Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Beijing200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing100083 China

Password generation model based on generative adversarial network usually has the problem of high duplicate rate, which further leads to low cover rate. In this regard, we propose PGGAN model. It sets up an additional controller network which is similar to the discriminator in the aspect of structure and function. The discriminator and the controller respectively learn the measure between the distribution of generated password with the real password distribution and the uniform distribution, and then use two measures to teach generator meanwhile. By changing the activation function and loss function of the controller, different measure functions can be selected. The experimental results show that compared with GAN, our PGGAN performs better both in cover rate and duplicate rate. Moreover, Wasserstein distance usually has a better effect to the other measure in model. Specifically, PGGAN with Wasserstein distance can increase the cover rate by 3.57% and reduce the duplicate rate by 30.85% on rockyou dataset. © Published under licence by IOP Publishing Ltd.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

SAFL-Net: Semantic-Agnostic Feature Learning network with Auxiliary Plugins for Image Manipulation Detection

SAFL-Net: Semantic-Agnostic Feature Learning Network with Au...

引用

International Conference on Computer Vision (ICCV)

作者： Zhihao Sun Haoran Jiang Danding Wang Xirong Li Juan Cao Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences School of Mathematics Science University of Chinese Academy of Sciences MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China

Since image editing methods in real world scenarios cannot be exhausted, generalization is a core challenge for image manipulation detection, which could be severely weakened by semantically related features. In this paper we propose SAFL-Net, which constrains a feature extractor to learn semantic-agnostic features by designing specific modules with corresponding auxiliary tasks. Applying constraints directly to the features extracted by the encoder helps it learn semantic-agnostic manipulation trace features, which prevents the biases related to semantic information within the limited training data and improves generalization capabilities. The consistency of auxiliary boundary prediction task and original region prediction task is guaranteed by a feature transformation structure. Experiments on various public datasets and comparisons in multiple dimensions demonstrate that SAFL-Net is effective for image manipulation detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sdgan: Improve Speech Enhancement Quality by Information Filter 6

Sdgan: Improve Speech Enhancement Quality by Information Fil...

引用

2021 6th International Symposium on Advances in Electrical, Electronics and Computer Engineering, ISAEECE 2021

作者： Guo, Xiaozhou Liu, Yi Mao, Wenyu Li, Jixing Li, Wenchang Gong, Guoliang Lu, Huaxiang Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China University of Chinese Academy of Sciences Beijing100089 China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Beijing200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing100083 China

The speech denoising model based on adversarial generative network has achieved better results than the traditional machine learning model. In this paper, for the short cut connection in the generator, we discuss its influence on the information transfer between encoder and decoder, and propose SDGAN at target. SDGAN sets linear and convolution filters in the short cut connection which adaptively learn the optimal information processing. The information filter still enables the generator to solve the gradient vanishing problem, and it can also avoid information redundancy and improve expression ability. In addition, SDGAN replaces the L1 regularization term in loss function with the L2 regularization term, which not only makes the output speech of the generator closer to the clean speech, but also avoids sparsity. In the experiments, SDGAN significantly performs better than other traditional GAN in five performance metrics (such as PESQ), and the effect of convolution filter is better than that of linear filter. © Published under licence by IOP Publishing Ltd.

关键词： Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

Self-supervised GANs with label augmentation 21

Self-supervised GANs with label augmentation

引用

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

作者： Liang Hou Huawei Shen Qi Cao Xueqi Cheng Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences

ISBN: (纸本)9781713845393

Recently, transformation-based self-supervised learning has been applied to generative adversarial networks (GANs) to mitigate catastrophic forgetting in the discriminator by introducing a stationary learning environment. However, the separate self-supervised tasks in existing self-supervised GANs cause a goal inconsistent with generative modeling due to the fact that their self-supervised classifiers are agnostic to the generator distribution. To address this problem, we propose a novel self-supervised GAN that unifies the GAN task with the self-supervised task by augmenting the GAN labels (real or fake) via self-supervision of data transformation. Specifically, the original discriminator and self-supervised classifier are unified into a label-augmented discriminator that predicts the augmented labels to be aware of both the generator distribution and the data distribution under every transformation, and then provide the discrepancy between them to optimize the generator. Theoretically, we prove that the optimal generator could converge to replicate the real data distribution. Empirically, we show that the proposed method significantly outperforms previous self-supervised and data augmentation GANs on both generative modeling and representation learning across benchmark datasets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Online Midgress-Sensitive Traffic Allocation for Percentile Charging in Pracitcal CDNs

Online Midgress-Sensitive Traffic Allocation for Percentile ...

引用

International Workshop on Quality of Service

作者： Huiyou Zhan Haisheng Tan Huang Xu Chi Zhang Hongqiu Ni Pengfei Zhang Weihua Shan Xiang-Yang Li CAS Key Lab of Wireless-Optical Communications University of Science and Technology of China China USTC-Deqing Alpha Innovation Research Institute Zhejiang China Algorithm Innovation Lab Huawei Cloud Computing Technologies Co. Ltd. Xi'an China

The traffic bandwidth costs comprise a significant amount of operating expenditure in CDNs, induced by the traffic from the end-users to edge servers (edge cost) and from the edge to the center servers (midgress cost). Traffic allocation is the main approach to minimizing the total bandwidth cost. The joint optimization of the total costs is challenging, specifically when the percentile charging mechanism as well as some other practical issues are considered, such as the dynamicity of midgress traffic and the granularity of traffic allocation. In this work, based on our novel miss ratio prediction mechanism, we propose the first online framework, named Iris, jointly optimizing the edge and midgress costs under the 95th percentile charging in commercial CDNs. Iris can theoretically achieve a competitive ratio of $1+\frac{p_{e}}{\beta\cdot p_{c}}$ , when the miss ratio of all domains is set as $\beta$ . Here $p_{e}$ and $p_{c}$ are the unit bandwidth price of the edge and midgress cost, respectively. Iris is tolerant to prediction errors which can be deployed in practical CDN systems. Extensive experiments based on real data indicate that Iris can dramatically reduce bandwidth costs by about 8.149% compared with the SOTA schemes, potentially saving millions of dollars per month for our large-scale commercial CDN collaborator.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Signed bipartite graph neural networks

arXiv

引用

arXiv 2021年

作者： Huang, Junjie Shen, Huawei Cao, Qi Tao, Shuchang Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Signed networks are such social networks having both positive and negative links. A lot of theories and algorithms have been developed to model such networks (e.g., balance theory). However, previous work mainly focuses on the unipartite signed networks where the nodes have the same type. Signed bipartite networks are different from classical signed networks, which contain two different node sets and signed links between two node sets. Signed bipartite networks can be commonly found in many fields including business, politics, and academics, but have been less studied. In this work, we firstly define the signed relationship of the same set of nodes and provide a new perspective for analyzing signed bipartite networks. Then we do some comprehensive analysis of balance theory from two perspectives on several real-world datasets. Specifically, in the peer review dataset, we find that the ratio of balanced isomorphism in signed bipartite networks increased after rebuttal phases. Guided by these two perspectives, we propose a novel Signed Bipartite Graph Neural networks (SBGNNs) to learn node embeddings for signed bipartite networks. SBGNNs follow most GNNs message-passing scheme, but we design new message functions, aggregation functions, and update functions for signed bipartite networks. We validate the effectiveness of our model on four real-world datasets on Link Sign Prediction task, which is the main machine learning task for signed networks. Experimental results show that our SBGNN model achieves significant improvement compared with strong baseline methods, including feature-based methods and network embedding methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Single node injection attack against graph neural networks

arXiv

引用

arXiv 2021年

作者： Tao, Shuchang Cao, Qi Shen, Huawei Huang, Junjie Wu, Yunfan Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Node injection attack on Graph Neural networks (GNNs) is an emerging and practical attack scenario that the attacker injects malicious nodes rather than modifying original nodes or edges to affect the performance of GNNs. However, existing node injection attacks ignore extremely limited scenarios, namely the injected nodes might be excessive such that they may be perceptible to the target GNN. In this paper, we focus on an extremely limited scenario of single node injection evasion attack, i.e., the attacker is only allowed to inject one single node during the test phase to hurt GNN’s performance. The discreteness of network structure and the coupling effect between network structure and node features bring great challenges to this extremely limited scenario. We first propose an optimization-based method to explore the performance upper bound of single node injection evasion attack. Experimental results show that 100%, 98.60%, and 94.98% nodes on three public datasets are successfully attacked even when only injecting one node with one edge, confirming the feasibility of single node injection evasion attack. However, such an optimization-based method needs to be re-optimized for each attack, which is computationally unbearable. To solve the dilemma, we further propose a Generalizable Node Injection Attack model, namely G-NIA, to improve the attack efficiency while ensuring the attack performance. Experiments are conducted across three well-known GNNs. Our proposed G-NIA significantly outperforms state-of-the-art baselines and is 500 times faster than the optimization-based method when inferring. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

One Comment from One Perspective: An Effective Strategy for Enhancing Automatic Music Comment 28

One Comment from One Perspective: An Effective Strategy for ...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Huo, Tengfei Liu, Zhiqiang Zhang, Jinchao Zhou, Jie CAS Key Lab of Network Data Science and Technology China Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China Pattern Recognition Center WeChat AI Tencent Inc. China

ISBN: (纸本)9781952148279

The automatic generation of music comments is of great significance for increasing the popularity of music and the music platform’s activity. In human music comments, there exists high distinction and diverse perspectives for the same song. In other words, for a song, different comments stem from different musical perspectives. However, to date, this characteristic has not been considered well in research on automatic comment generation. The existing methods tend to generate common and meaningless comments. In this paper, we propose an effective multi-perspective strategy to enhance the diversity of the generated comments. The experiment results on two music comment datasets show that our proposed model can effectively generate a series of diverse music comments based on different perspectives, which outperforms state-of-the-art baselines by a substantial margin. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Music

来源：评论

学校读者我要写书评

暂无评论

Toward the Understanding of Deep Text Matching Models for Information Retrieval

arXiv

引用

arXiv 2021年

作者： Chen, Lijuan Lan, Yanyan Pang, Liang Guo, Jiafeng Cheng, Xueqi Sogou Inc. Beijing China Institute for AI Industry Research Tsinghua University Beijing China Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Semantic text matching is a critical problem in information retrieval. Recently, deep learning techniques have been widely used in this area and obtained significant performance improvements. However, most models are black boxes and it is hard to understand what happened in the matching process, due to the poor interpretability of deep learning. This paper aims at tackling this problem. The key idea is to test whether existing deep text matching methods satisfy some fundamental heuristics in information retrieval. Specifically, four heuristics are used in our study, i.e., term frequency constraint, term discrimination constraint, length normalization constraints, and TF-length constraint. Since deep matching models usually contain many parameters, it is difficult to conduct a theoretical study for these complicated functions. In this paper, We propose an empirical testing method. Specifically, We first construct some queries and documents to make them satisfy the assumption in a constraint, and then test to which extend a deep text matching model trained on the original dataset satisfy the corresponding constraint. Besides, a famous attribution based interpretation method, namely integrated gradient, is adopted to conduct detailed analysis and guide for feasible improvement. Experimental results on LETOR 4.0 and MS Marco show that all the investigated deep text matching methods, both representation and interaction based methods, satisfy the above constraints with high probabilities in statistics. We further extend these constraints to the semantic settings, which are shown to be better satisfied for all the deep text matching models. These empirical findings give clear understandings on why deep text matching models usually perform well in information retrieval. We believe the proposed evaluation methodology will be useful for testing future deep text matching models. © 2021, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Uncertainty calibration for ensemble-based debiasing methods 21

Uncertainty calibration for ensemble-based debiasing methods

引用

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

作者： Ruibin Xiong Yimeng Chen Liang Pang Xueqi Cheng Zhiming Ma Yanyan Lan CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences and Baidu Inc. University of Chinese Academy of Sciences and Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences and Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Institute for AI Industry Research Tsinghua University

ISBN: (纸本)9781713845393

Ensemble-based debiasing methods have been shown effective in mitigating the reliance of classifiers on specific dataset bias, by exploiting the output of a bias-only model to adjust the learning target. In this paper, we focus on the bias-only model in these ensemble-based methods, which plays an important role but has not gained much attention in the existing literature. Theoretically, we prove that the debiasing performance can be damaged by inaccurate uncertainty estimations of the bias-only model. Empirically, we show that existing bias-only models fall short in producing accurate uncertainty estimations. Motivated by these findings, we propose to conduct calibration on the bias-only model, thus achieving a three-stage ensemble-based debiasing framework, including bias modeling, model calibrating, and debiasing. Experimental results on NLI and fact verification tasks show that our proposed three-stage debiasing framework consistently outperforms the traditional two-stage one in out-of-distribution accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：