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

PGGAN: Improve Password Cover Rate Using the Controller

学校读者我要写书评

暂无评论

PGGAN: Improve Password Cover Rate Using the Controller

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

A deep relevance matching model for ad-hoc retrieval

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Guo, Jiafeng Fan, Yixing Ai, Qingyao Bruce Croft, W. CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Center for Intelligent Information Retrieval University of Massachusetts Amherst MA United States

In recent years, deep neural networks have led to exciting breakthroughs in speech recognition, computer vision, and natural language processing (NLP) tasks. However, there have been few positive results of deep models on ad-hoc retrieval tasks. This is partially due to the fact that many important characteristics of the ad-hoc retrieval task have not been well addressed in deep models yet. Typically, the ad-hoc retrieval task is formalized as a matching problem between two pieces of text in existing work using deep models, and treated equivalent to many NLP tasks such as paraphrase identification, question answering and automatic conversation. However, we argue that the ad-hoc retrieval task is mainly about relevance matching while most NLP matching tasks concern semantic matching, and there are some fundamental differences between these two matching tasks. Successful relevance matching requires proper handling of the exact matching signals, query term importance, and diverse matching requirements. In this paper, we propose a novel deep relevance matching model (DRMM) for ad-hoc retrieval. Specifically, our model employs a joint deep architecture at the query term level for relevance matching. By using matching histogram mapping, a feed forward matching network, and a term gating network, we can effectively deal with the three relevance matching factors mentioned above. Experimental results on two representative benchmark collections show that our model can significantly outperform some well-known retrieval models as well as state-of-the-art deep matching models. Copyright © 2017, The Authors. All rights reserved.

关键词： Natural language processing systems

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

Nested Event Extraction upon Pivot Element Recognition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ren, Weicheng Li, Zixuan Jin, Xiaolong Bai, Long Su, Miao Liu, Yantao Guan, Saiping Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Nested Event Extraction (NEE) aims to extract complex event structures where an event contains other events as its arguments recursively. Nested events involve a kind of Pivot Elements (PEs) that simultaneously act as arguments of outer-nest events and as triggers of inner-nest events, and thus connect them into nested structures. This special characteristic of PEs brings challenges to existing NEE methods, as they cannot well cope with the dual identities of PEs. Therefore, this paper proposes a new model, called PerNee, which extracts nested events mainly based on recognizing PEs. Specifically, PerNee first recognizes the triggers of both inner-nest and outer-nest events and further recognizes the PEs via classifying the relation type between trigger pairs. The model uses prompt learning to incorporate information from both event types and argument roles for better trigger and argument representations to improve NEE performance. Since existing NEE datasets (e.g., Genia11) are limited to specific domains and contain a narrow range of event types with nested structures, we systematically categorize nested events in the generic domain and construct a new NEE dataset, called ACE2005-Nest. Experimental results demonstrate that PerNee consistently achieves state-of-the-art performance on ACE2005-Nest, Genia11, and Genia13. The ACE2005-Nest dataset and the code of the PerNee model are available at https://***/waysonren/PerNee. Copyright © 2023, The Authors. All rights reserved.

关键词： Character recognition

TOWARDS GENERALIZABLE GRAPH CONTRASTIVE LEARNING: AN INFORMATION THEORY PERSPECTIVE

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yuan, Yige Xu, Bingbing Shen, Huawei Cao, Qi Cen, Keting Zheng, Wen 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 Com- puting Technology Chinese Academy of Sciences Beijing China

Graph contrastive learning (GCL) emerges as the most representative approach for graph representation learning, which leverages the principle of maximizing mutual information (InfoMax) to learn node representations applied in downstream tasks. To explore better generalization from GCL to downstream tasks, previous methods heuristically define data augmentation or pretext tasks. However, the generalization ability of GCL and its theoretical principle are still less reported. In this paper, we first propose a metric named GCL-GE for GCL generalization ability. Considering the intractability of the metric due to the agnostic downstream task, we theoretically prove a mutual information upper bound for it from an information-theoretic perspective. Guided by the bound, we design a GCL framework named InfoAdv with enhanced generalization ability, which jointly optimizes the generalization metric and InfoMax to strike the right balance between pretext task fitting and the generalization ability on downstream tasks. We empirically validate our theoretical findings on a number of representative benchmarks, and experimental results demonstrate that our model achieves state-of-the-art performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Information theory

HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Zixuan Hou, Zhongni Guan, Saiping Jin, Xiaolong Peng, Weihua Bai, Long Lyu, Yajuan Li, Wei Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Baidu Inc China

A Temporal Knowledge Graph (TKG) is a sequence of KGs with respective timestamps, which adopts quadruples in the form of (subject, relation, object, timestamp) to describe dynamic facts. TKG reasoning has facilitated many real-world applications via answering such queries as (query entity, query relation, ?, future timestamp) about future. This is actually a matching task between a query and candidate entities based on their historical structures, which reflect behavioral trends of the entities at different timestamps. In addition, recent KGs provide background knowledge of all the entities, which is also helpful for the matching. Thus, in this paper, we propose the Historical Structure Matching (HiSMatch) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Besides, it adopts another encoder to integrate the background knowledge into the model. TKG reasoning experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6% performance improvement in MRR, compared to the state-of-the-art baselines. Copyright © 2022, The Authors. All rights reserved.

关键词： Knowledge graph

Complex Evolutional Pattern Learning for Temporal Knowledge Graph Reasoning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Zixuan Guan, Saiping Jin, Xiaolong Peng, Weihua Lyu, Yajuan Zhu, Yong Bai, Long Li, Wei Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Baidu Inc China

A Temporal Knowledge Graph (TKG) is a sequence of KGs corresponding to different timestamps. TKG reasoning aims to predict potential facts in the future given the historical KG sequences. One key of this task is to mine and understand evolutional patterns of facts from these sequences. The evolutional patterns are complex in two aspects, length-diversity and time-variability. Existing models for TKG reasoning focus on modeling fact sequences of a fixed length, which cannot discover complex evolutional patterns that vary in length. Furthermore, these models are all trained offline, which cannot well adapt to the changes of evolutional patterns from then on. Thus, we propose a new model, called Complex Evolutional network (CEN), which uses a length-aware Convolutional Neural network (CNN) to handle evolutional patterns of different lengths via an easy-to-difficult curriculum learning strategy. Besides, we propose to learn the model under the online setting so that it can adapt to the changes of evolutional patterns over time. Extensive experiments demonstrate that CEN obtains substantial performance improvement under both the traditional offline and the proposed online settings. Copyright © 2022, The Authors. All rights reserved.

关键词： Knowledge graph

Augmentation-aware self-supervision for data-efficient GAN training 23

学校读者我要写书评

暂无评论

Augmentation-aware self-supervision for data-efficient GAN t...

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

作者： Liang Hou Qi Cao Yige Yuan Songtao Zhao Chongyang Ma Siyuan Pan Pengfei Wan Zhongyuan Wang Huawei Shen Xueqi Cheng CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences and Kuaishou Technology CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences CAS Key Laboratory of AI Safety and Security Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Kuaishou Technology CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences

Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation demonstrates improved data efficiency of training GANs. However, the augmentation implicitly introduces undesired invariance to augmentation for the discriminator since it ignores the change of semantics in the label space caused by data transformation, which may limit the representation learning ability of the discriminator and ultimately affect the generative modeling performance of the generator. To mitigate the negative impact of invariance while inheriting the benefits of data augmentation, we propose a novel augmentation-aware self-supervised discriminator that predicts the augmentation parameter of the augmented data. Particularly, the prediction targets of real data and generated data are required to be distinguished since they are different during training. We further encourage the generator to adversarially learn from the self-supervised discriminator by generating augmentation-predictable real and not fake data. This formulation connects the learning objective of the generator and the arithmetic - harmonic mean divergence under certain assumptions. We compare our method with state-of-the-art (SOTA) methods using the class-conditional BigGAN and unconditional StyleGAN2 architectures on data-limited CIFAR-10, CIFAR-100, FFHQ, LSUN-Cat, and five low-shot datasets. Experimental results demonstrate significant improvements of our method over SOTA methods in training data-efficient GANs. Our code is available at https://***/liang-hou/augself-gan.

关键词：

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.

关键词：