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

11th International Conference on Learning Representations, ICLR 2023

作者： Zhong, Yong Liu, Hongtao Liu, Xiaodong Bao, Fan Shen, Weiran Li, Chongxuan Gaoling School of AI Renmin University of China Beijing China Beijing Key Lab of Big Data Management and Analysis Methods Beijing China Department of Computer Science Technology Tsinghua University Beijing China

Deep generative models (DGMs) are data-eager because learning a complex model on limited data suffers from a large variance and easily overfits. Inspired by the classical perspective of the bias-variance tradeoff, we propose regularized deep generative model (Reg-DGM), which leverages a nontransferable pre-trained model to reduce the variance of generative modeling with limited data. Formally, Reg-DGM optimizes a weighted sum of a certain divergence and the expectation of an energy function, where the divergence is between the data and the model distributions, and the energy function is defined by the pre-trained model w.r.t. the model distribution. We analyze a simple yet representative Gaussian-fitting case to demonstrate how the weighting hyperparameter trades off the bias and the variance. Theoretically, we characterize the existence and the uniqueness of the global minimum of Reg-DGM in a non-parametric setting and prove its convergence with neural networks trained by gradient-based methods. Empirically, with various pre-trained feature extractors and a data-dependent energy function, Reg-DGM consistently improves the generation performance of strong DGMs with limited data and achieves competitive results to the state-of-the-art methods. Our implementation is available at https://***/ML-GSAI/Reg-ADA-APA. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QGEval: Benchmarking Multi-dimensional Evaluation for Question Generation

QGEval: Benchmarking Multi-dimensional Evaluation for Questi...

引用

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

作者： Fu, Weiping Wei, Bifan Hu, Jianxiang Cai, Zhongmin Liu, Jun School of Computer Science and Technology Xi'an Jiaotong University Xi'an China School of Continuing Education Xi'an Jiaotong University Xi'an China MOE KLINNS Lab School of Automation Science and Engineering Xi'an Jiaotong University Xi'an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9798891761643

Automatically generated questions often suffer from problems such as unclear expression or factual inaccuracies, requiring a reliable and comprehensive evaluation of their quality. Human evaluation is widely used in the field of question generation (QG) and serves as the gold standard for automatic metrics. However, there is a lack of unified human evaluation criteria, which hampers consistent and reliable evaluations of both QG models and automatic metrics. To address this, we propose QGEval, a multi-dimensional Evaluation benchmark for Question Generation, which evaluates both generated questions and existing automatic metrics across 7 dimensions: fluency, clarity, conciseness, relevance, consistency, answerability, and answer consistency. We demonstrate the appropriateness of these dimensions by examining their correlations and distinctions. Through consistent evaluations of QG models and automatic metrics with QGEval, we find that 1) most QG models perform unsatisfactorily in terms of answerability and answer consistency, and 2) existing metrics fail to align well with human judgments when evaluating generated questions across the 7 dimensions. We expect this work to foster the development of both QG technologies and their evaluation. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Brief Survey of Distribution Robust Graph Neural Networks 11

A Brief Survey of Distribution Robust Graph Neural Networks

引用

11th International Conference on Information technology and Quantitative management, ITQM 2024

作者： Zheng, Lei Quan, Pei Shi, Yong Niu, Lingfeng The School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100190 China The College of Economics and Management Beijing University of Technology Beijing100124 China The School of Economics and Management University of Chinese Academy of Sciences Beijing1001090 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China

Graph neural network is a powerful tool for solving various graph tasks, such as node classification and graph classification. However, there is increasing evidence suggesting that it is sensitive to distribution shifts and its performance is reduced by at least 10% when distribution shifts happen. In the last three years, to solve the wide existing distribution shifts, some distribution robust strategies have been designed specifically for graph neural networks. It is also one of the popular research topics in graph neural networks in recent years. Therefore, in this paper, we divide these strategies into three categories depending on the specific problems they solve: distribution shift for semi-supervised node classification, distribution shift for unsupervised node classification, and out-of-distribution shift for graph classification. Furthermore, we discuss and summarize the strategies for each type of problem. After investigating these strategies, we put forward future development direction. © 2024 The Authors.

关键词： Distribution generalization Graph neural networks Shift robust

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations

Inductive Relation Prediction with Logical Reasoning Using C...

引用

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

作者： Pan, Yudai Liu, Jun Zhang, Lingling Zhao, Tianzhe Lin, Qika Hu, Xin Wang, Qianying School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Lenovo Research Beijing China

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with SOTA inductive baselines. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

SOVC: Subject-Oriented Video Captioning

arXiv

引用

arXiv 2023年

作者： Teng, Chang Ma, Yunchuan Li, Guorong Qi, Yuankai Qing, Laiyun Huang, Qingming School of Computer Science and Technology Key Lab of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences Beijing100049 China School of Computing Macquarie University Australia

Describing video content according to users’ needs is a long-held goal. Although existing video captioning methods have made significant progress, the generated captions may not focus on the entity that users are particularly interested in. To address this problem, we propose a new video captioning task, Subject-Oriented Video Captioning (SOVC), which aims to allow users to specify the describing target via a bounding box. To support this task, we construct two subject-oriented video captioning datasets based on two widely used video captioning datasets: MSVD and MSRVTT, by annotating subjects in each video for each caption. These datasets pave the way for describing users’ interested targets. To tackle this task, we introduce a method tailored to this task, named SOVCNet. It consists of two key components: a subject-oriented sampling module that samples frames related to the subject to minimize irrelevant information;and a subject-oriented encoding module that utilizes the subject areas as hard prompts and integrates learnable soft prompts, enhancing the model’s focus on the subject’s activities and facilitating adaptation to the downstream generation task. Extensive experimental results demonstrate the effectiveness of our method on this new task. Copyright © 2023, The Authors. All rights reserved.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

Overview of Essential Components in deep learning reference-based super resolution methods 11

Overview of Essential Components in deep learning reference-...

引用

11th International Conference on Information technology and Quantitative management, ITQM 2024

作者： Xue, Jiayu Liu, Junjie Shi, Yong School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Sino-Danish College University of Chinese Academy of Sciences Beijing100049 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States

Reference-based super resolution (RefSR) aims to recover the lost details in a low-resolution image and generate a high-resolution result, guided by a high-resolution reference image with similar contents or textures. In contrast to the traditional single-image super-resolution, which focuses on the intrinsic properties of the single low-resolution image, the challenge of RefSR lies in matching and aggregating highly-related but misaligned reference images with low-resolution images. Several effective but complex designs have been proposed to address this challenge, which poses difficulties in implementing RefSR in real-world applications. In order to better understand the working mechanism of RefSR and design a more efficient and lightweight architecture, we provide a review about the essential components of the existing deep learning-based RefSR. We decompose and classify the common pipeline into four submodules according to the functionalities. Then, we summarize and describe the implementation details of the commonly-adopted approaches in each submodule. Finally, we discuss the challenges and promising research directions. © 2024 The Authors.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

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

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Logic-Aware knowledge Graph Reasoning for Structural Sparsity under Large Language Model Supervision 25

Logic-Aware Knowledge Graph Reasoning for Structural Sparsit...

引用

34th ACM Web Conference, WWW 2025

作者： Pan, Yudai Hong, Jiajie Zhao, Tianzhe Song, Lingyun Liu, Jun Shang, Xuequn School of Computer Science Northwest Polytechnical University Shaanxi Xi’an China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Shaanxi Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China Research & Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China

ISBN: (纸本)9798400712746

knowledge Graph (KG) reasoning aims to predict missing entities in incomplete triples, which requires adequate structural information to derive accurate embeddings. However, KGs in the real world are not as dense as the idealized benchmarks, where sparse graph structures restrict the comprehensive structural information for superior performance. Although the logical semantics in KGs shows its potential in alleviating the impact of structural sparsity, there still exist some challenges. The deficient supervision and the semantic gap of logic make it difficult to introduce logical semantics in sparse KG reasoning. To this end, we propose a novel KG reasoning approach LoLLM injecting logic with the supervised information supplied by the Large Language Model (LLM), which is proved to be effective in evaluating and scoring. Firstly, LoLLM derives structural embeddings employing a graph convolutional network (GCN) with relation-aware and triple-aware attention. LoLLM secondly constructs reasoning paths instantiated from the first-order logic rules extracted from sparse KGs, and injects the logical semantics by a designed LLM-enhanced tuning strategy. We propose a textual loss (TL) and a logical loss (LL) in the optimization and obtain logical tuning embeddings of KG in this process. Finally, LoLLM fuses structural embeddings from the GCN and logical tuning embeddings from the LLM-enhanced tuning for scoring and incomplete triple prediction. Extensive experiments on two sparse KGs and a benchmark show that LoLLM outperforms state-of-the-art structure-based and Language Model (LM)-augmented baselines. Moreover, the logic rules with corresponding confidences provide explicit explanations as an interpretable paradigm. © 2025 Copyright held by the owner/author(s).

关键词： Structural analysis

来源：评论

学校读者我要写书评

暂无评论

Deep Feature Inpainting for Unsupervised Visual Anomaly Detection 10

Deep Feature Inpainting for Unsupervised Visual Anomaly Dete...

引用

10th International Conference on Information technology and Quantitative management, ITQM 2023

作者： Yang, Jie Lyu, Mengjin Qi, Zhiquan Tian, Yingjie Shi, Yong School of Mathematical Science University of Chinese Academy of Sciences Beijing101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing101408 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska OmahaNE68182 United States School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China

Visual anomaly detection is an important and challenging problem in the field of machine learning and computer vision. In this paper, we address the problem of unsupervised visual anomaly detection from the perspective of image feature restoration. We propose deep feature inpainting (DFI) where we develop a deep learning model that can automatically inpainting the normal image patterns or features from the anomalous images by eliminating the irregular structures or patterns. By comparing the anomalous features and their reconstructed counterparts, we can identify and analyze the anomalous structures in the images. Extensive experiments have been carried out to demonstrate the effectiveness of the approach. © 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information technology and Quantitative management.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：