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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Yang, Sihui Bi, Keping Cui, Wanqing Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798891761681

Non-Factoid (NF) Question Answering (QA) is challenging to evaluate due to diverse potential answers and no objective criterion. The commonly used automatic evaluation metrics like ROUGE or BERTScore cannot accurately measure semantic similarities or answers from different perspectives. Recently, Large Language Models (LLMs) have been resorted to for NFQA evaluation due to their compelling performance on various NLP tasks. Common approaches include pointwise scoring of each candidate answer and pairwise comparisons between answers. Inspired by the evolution from pointwise to pairwise to listwise in learning-to-rank methods, we propose a novel listwise NFQA evaluation approach, that utilizes LLMs to rank candidate answers in a list of reference answers sorted by descending quality. Moreover, for NF questions that do not have multi-grade or any golden answers, we leverage LLMs to generate the reference answer list of various quality to facilitate the listwise evaluation. Extensive experimental results on three NFQA datasets, i.e., ANTIQUE, the TREC-DL-NF, and WebGLM show that our method has significantly higher correlations with human annotations compared to automatic scores and common pointwise and pairwise approaches. Our code and dataset can be found at https://***/babyyang525/LINKAGE-Listwise-NFQA-Evaluation. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Augmentation-Aware Self-Supervision for data-Efficient GAN Training 37

Augmentation-Aware Self-Supervision for Data-Efficient GAN T...

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

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

ISBN: (纸本)9781713899921

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. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Identity-Preserving Adversarial Training for Robust network Embedding

引用

Journal of Computer science & technology 2024年第1期39卷 177-191页

作者：岑科廷沈华伟曹婍徐冰冰程学旗 Data Intelligence System Research Center Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 101480China Beijing Academy of Artificial Intelligence Beijing 100000China Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

network embedding,as an approach to learning low-dimensional representations of nodes,has been proved extremely useful in many applications,e.g.,node classification and link ***,existing network embed-ding models are vulnerable to random or adversarial perturbations,which may degrade the performance of network em-bedding when being applied to downstream *** achieve robust network embedding,researchers introduce adversari-al training to regularize the embedding learning process by training on a mixture of adversarial examples and original ***,existing methods generate adversarial examples heuristically,failing to guarantee the imperceptibility of generated adversarial examples,and thus limit the power of adversarial *** this paper,we propose a novel method Identity-Preserving Adversarial Training(IPAT)for network embedding,which generates imperceptible adversarial exam-ples with explicit identity-preserving *** formalize such identity-preserving regularization as a multi-class classification problem where each node represents a class,and we encourage each adversarial example to be discriminated as the class of its original *** experimental results on real-world datasets demonstrate that our proposed IPAT method significantly improves the robustness of network embedding models and the generalization of the learned node representations on various downstream tasks.

关键词： network embedding identity-preserving adversarial training adversarial the example

来源：评论

学校读者我要写书评

暂无评论

ICTNET at TREC 2019 Deep Learning Track 28

ICTNET at TREC 2019 Deep Learning Track

引用

28th Text REtrieval Conference, TREC 2019

作者： Chen, Jiangui Cai, Yinqiong Jiang, Haoquan University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology China

We participated in the Deep Learning Track at TREC 2019. We built a ranking system which combines a search component based on BM25 and a semantic matching component using pretraining knowledge. Our best run achieves NDCG@10 of 0.6650, MAP of 0.2035. © 2019 28th Text REtrieval Conference, TREC 2019 - Proceedings. All Rights Reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

ICTNET at Trec 2019 Incident Streams Track 28

ICTNET at Trec 2019 Incident Streams Track

引用

28th Text REtrieval Conference, TREC 2019

作者： Guangsheng, Kuang Kun, Zhang Jiabao, Zhang Xin, Zheng University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology China

Social medial become our public ways to share our information in our lives. Crisis management via social medial is becoming indispensable for its tremendous information. While deep learning shows surprising outcome in many tasks. So in this paper, we cope this learning task with neural network in the view of classification problem. © 2019 28th Text REtrieval Conference, TREC 2019 - Proceedings. All Rights Reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Evaluating natural language generation via unbalanced optimal transport 29

Evaluating natural language generation via unbalanced optima...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Chen, Yimeng Lan, Yanyan Xiong, Ruibin Pang, Liang Ma, Zhiming Cheng, Xueqi University of Chinese Academy of Sciences China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology CAS China Academy of Mathematics and Systems Science CAS China

ISBN: (纸本)9780999241165

Embedding-based evaluation measures have shown promising improvements on the correlation with human judgments in natural language generation. In these measures, various intrinsic metrics are used in the computation, including generalized precision, recall, F-score and the earth mover's distance. However, the relations between these metrics are unclear, making it difficult to determine which measure to use in real applications. In this paper, we provide an in-depth study on the relations between these metrics. Inspired by the optimal transportation theory, we prove that these metrics correspond to the optimal transport problem with different hard marginal constraints. However, these hard marginal constraints may cause the problem of incomplete and noisy matching in the evaluation process. Therefore we propose a family of new evaluation metrics, namely Lazy Earth Mover's Distances, based on the more general unbalanced optimal transport problem. Experimental results on WMT18 and WMT19 show that our proposed metrics have the ability to produce more consistent evaluation results with human judgements, as compared with existing intrinsic metrics. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

PreZ-DGGAN: A Drug Graph GAN Based on Pre-Learning of Implicit Variables 2nd

PreZ-DGGAN: A Drug Graph GAN Based on Pre-Learning of Implic...

引用

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Liu, Yixin Fan, Yueqin Li, Zhipeng Zhang, Qinhu Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China School of Mechanical Engineering Guangxi University Nanning530004 China Ningbo Institute of Digital Twin Eastern Institute of Technology Ningbo315201 China Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology School of Medicine Shanghai East Hospital Tongji University Shanghai200123 China College of Advanced Agricultural Sciences Zhejiang Agriculture and Forestry University Hangzhou311300 China

ISBN: (纸本)9789819619061

In the field of drug discovery and development, deep learning techniques have become a powerful tool to accelerate the discovery and development of new drugs. In the design and optimization of lead molecules, generative adversarial network and graph neural network are one of the prime techniques for accelerating research and development, because the former is based on the idea of two-player game to learn drug features to generate effective molecules, while the unstructured inputs of the latter are well-suited for the analysis of molecular data. Therefore, this study develops a new graph generative adversarial model, called PreZ-DGGAN, by inserting the graph neural network layer into the generative adversarial network. Within PreZ-DGGAN, the latent variable input of the generator is pre-learned by an improved graph variational autoencoder, which effectively avoids the mode collapse of the generative adversarial network, whereas the hidden layer of the discriminator is graph neural network layer, which is able to better learn the real molecules and judge the generated molecules as true or false. Experiments on two molecule datasets show that the molecules generated by PreZ-DGGAN have higher validity (100% on average) and uniqueness (91.5% on average), and the generated molecules are more diverse in structure. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

ICTNET at TREC 2019 News Track 28

ICTNET at TREC 2019 News Track

引用

28th Text REtrieval Conference, TREC 2019

作者： Ding, Yuyang Lian, Xiaoying Zhou, Houquan Liu, Zhaoge Ding, Hanxing Hou, Zhongni University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology China

This paper describes our work in the background linking task and entity ranking task in TREC 2018 News Track. We explore four methods in background linking task and two methods in entity ranking task. All of our methods largely rely on off-the-shell open-source components(e.g., Solr for indexing the documents), and follow the basic thoughts-BM25 and relevance feedback. These methods differ in how they analyze the given input to obtain a query and to what extent the returned results are re-ranked taking meta data of the document(e.g., publish dates) into account. © 2019 28th Text REtrieval Conference, TREC 2019 - Proceedings. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sparse Word Embeddings Using 1 Regularized Online Learning

Sparse Word Embeddings Using 1 Regularized Online Learning

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Sun, Fei Guo, Jiafeng Lan, Yanyan Xu, Jun Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

Recently, Word2Vec tool has attracted a lot of interest for its promising performances in a variety of natural language processing (NLP) tasks. However, a critical issue is that the dense word representations learned in Word2Vec are lacking of interpretability. It is natural to ask if one could improve their interpretability while keeping their performances. Inspired by the success of sparse models in enhancing interpretability, we propose to introduce sparse constraint into Word2Vec. Specifically, we take the Continuous Bag of Words (CBOW) model as an example in our study and add the l regularizer into its learning objective. One challenge of optimization lies in that stochastic gradient descent (SGD) cannot directly produce sparse solutions with 1 regularizer in online training. To solve this problem, we employ the Regularized Dual Averaging (RDA) method, an online optimization algorithm for regularized stochastic learning. In this way, the learning process is very efficient and our model can scale up to very large corpus to derive sparse word representations. The proposed model is evaluated on both expressive power and interpretability. The results show that, compared with the original CBOW model, the proposed model can obtain state-of-the-art results with better interpretability using less than 10% non-zero elements. © 2016 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

ICTNET at TREC 2019 Complex Answer Retrieval Track 28

ICTNET at TREC 2019 Complex Answer Retrieval Track

引用

28th Text REtrieval Conference, TREC 2019

作者： Ren, Hongfei Xiong, Ruibin Zeng, Yutao Chen, Jiangui Cai, Yinqiong Jiang, Haoquan University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology China

We participate in the Complex Answer Retrieval(CAR) track at TREC 2019. We applied several useful models in this work. In the rough ranking, we applied doc2query model to predict queries and retrieve using BM25. In the re-ranking, we submitted 5 different runs which use 5 different models, include BM25, DRMMTKS, Bert-DRMMTKS, Bert-ConvKNRM and Bert-ConvKNRM-50, to try to get the best result. © 2019 28th Text REtrieval Conference, TREC 2019 - Proceedings. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：