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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Bai, Tian Cao, Yongwang Ge, Yan Yu, Haitao College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China Graduate School of Comprehensive Human Sciences University of Tsukuba Japan Institute of Library Information and Media Science University of Tsukuba Japan

ISBN: (纸本)157735897X

The recent studies show that Large Language Models (LLMs) often fall short in tasks demanding creative, lateral thinking due to lacking a clear awareness of their own reasoning processes. To cope with this issue, we propose a novel metacognitive prompting method (titled as MP) by mimicking human metacognition. Through integrating metacognitive principles, MP endows LLMs with lateral thinking ability, thereby enhancing their abilities to strategize, monitor, and reflect on their responses when dealing with creative tasks. The experimental results with five base LLMs across three lateral thinking datasets demonstrate that: All LLMs armed with MP consistently outperform the representative baseline methods. For example, MP demonstrates superior performance over CoT prompting across Sentence Puzzle (+5.00%), Word Puzzle (+10.07%), BiRdQA (+6.48%), and RiddleSense (+2.65%) with GPT-3.5-turbo model. In particular, the deployment of MP with GPT-4 achieves significant performance improvements that even surpass human performance on BRAINTEASER benchmark, demonstrating the transformative potential of MP in enhancing the creative problem-solving abilities of LLMs. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PRG: Prompt-Based Distillation Without Annotation via Proxy Relational Graph

arXiv

引用

arXiv 2024年

作者： Xu, Yijin Liu, Jialun Wei, Hualiang Li, Wenhui The College of Computer Science and Technology The Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Jilin Changchun130012 China Baidu VIS. Beijing100000 China

In this paper, we propose a new distillation method for extracting knowledge from Large Foundation Models (LFM) into lightweight models, introducing a novel supervision mode that does not require manually annotated data. While LFMs exhibit exceptional zero-shot classification abilities across datasets, relying solely on LFM-generated embeddings for distillation poses two main challenges: LFM’s task-irrelevant knowledge and the high density of features. The transfer of task-irrelevant knowledge could compromise the student model’s discriminative capabilities, and the high density of features within target domains obstructs the extraction of discriminative knowledge essential for the task. To address this issue, we introduce the Proxy Relational Graph (PRG) method. We initially extract task-relevant knowledge from LFMs by calculating a weighted average of logits obtained through text prompt embeddings. Then we construct sample-class proxy graphs for LFM and student models, respectively, to model the correlation between samples and class proxies. Then, we achieve the distillation of selective knowledge by aligning the relational graphs produced by both the LFM and the student model. Specifically, the distillation from LFM to the student model is achieved through two types of alignment: 1) aligning the sample nodes produced by the student model with those produced by the LFM, and 2) aligning the edge relationships in the student model’s graph with those in the LFM’s graph. Our experimental results validate the effectiveness of PRG, demonstrating its ability to leverage the extensive knowledge base of LFMs while skillfully circumventing their inherent limitations in focused learning scenarios. Notably, in our annotation-free framework, PRG achieves an accuracy of 76.23% (T: 77.9%) on CIFAR-100 and 72.44% (T: 75.3%) on the ImageNet-1K. Copyright © 2024, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Automating Discussion Structure Re-Organization for Github Issues

SSRN

引用

SSRN 2023年

作者： Bai, Shuotong Liu, Lei Meng, Chenkun Liu, Huaxiao College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China

As a popular social code hosting platform, GitHub encourages developers to discuss and leave opinions on issues for better repository development and closer team collaboration. However, popular issues can be bloated over the time, in particular, the linear format of GitHub issue discussions makes it difficult for developers to organize and extract useful information. For a better understanding of GitHub issue discussions, we first conduct an empirical study. Among the 14 most-starred repositories, we notice that 16,740 issues contain more than 10 comments. Then, more commented issue discussions refer to additional repository contributions and draw more developer attention. Hence, we narrow our perspective to the issue discussions with more than 10 comments. For 50.29% of these popular discussions, the topics of content are subject to change explicitly, and more than 36% of consecutive comment pairs do not host response relationships. In addition, just 40% of the comments on GitHub use the @ or quoting functions when commenting on other people's comments, but these functions are not only used for responding, but also for referencing, informing others, etc. Based on these results, these popular discussions suffer from intertwined content of various topics and ambiguous response linkage. To mitigate the situation, we propose a new approach IRA to automatically re-organize GitHub issue discussions, aiming at converting an issue discussion with the linear structure into a discussion tree with key information. The experimental results show that our approach outperforms other baselines, and achieves an average improvement of 19.97%, 14,25% on metrics of ACC and F1-score in the task of predicting response relationships, as well as gets 15.78%, 51.72%, 26.92%, 21.03%, 22.08%, 25.59% improvement in terms of parent accuracy, Variation of Information, One-to-One Overlap, and all Exact Match metrics in the re-organizing task. To investigate human perspectives on our re-organized

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Application of Hybrid Monocular SLAM Method in Augmented Reality 5

Application of Hybrid Monocular SLAM Method in Augmented Rea...

引用

2020 5th International Seminar on Computer Technology, Mechanical and Electrical engineering, ISCME 2020

作者： Zhang, Zuoming Wang, Hanwen Shu, Man Wang, Xin College of Software Engineering Jilin University Changchun Jilin130000 China Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun Jilin130000 China

In this paper, we design a hybrid (semi-direct) approach to simultaneous localization and mapping (SLAM) for monocular cameras and apply it to augmented reality (AR) for monocular cameras. We combine the advantagesof the direct method and the feature point method. We use both photometric bundle adjustment which is robust to camera exposure time and motion bundle adjustment which is geometrically robust based on feature points to do tracking process. This approach can maintain an intuitive direct local map as well as a reusable global sparse feature point map. Through the processing of point clouds, such as PCA plane detection and grid reconstruction, we greatly improve the effect of the augmented reality system. © Published under licence by IOP Publishing Ltd.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Transformer for Data Inference and Long Prediction in Sparse Mobile CrowdSensing

Spatiotemporal Transformer for Data Inference and Long Predi...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： En Wang Weiting Liu Wenbin Liu Chaocan Xiang Bo Yang Yongjian Yang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science Chongqing University China

Mobile CrowdSensing (MCS) is a data sensing paradigm that recruits users carrying mobile terminals to collect data. As its variant, Sparse MCS has been further proposed for large-scale and fine-grained sensing task with the advantage of collecting only a few data to infer unsensed data. However, in many real-world scenarios, such as early prevention of epidemic, people are interested in not only the data at the current, but also in the future or even long-term future, and the latter may be more important. Long-term prediction not only reduces sensing cost, but also identifies trends or other characteristics of the data. In this paper, we propose a spatiotemporal model based on Transformer to infer and predict the data with sparse sensed data by utilizing spatiotemporal relationships. We design a spatiotemporal feature embedding to embed the prior spatiotemporal information of sensing map into the model to guide model learning. Moreover, we also design a novel multi-head spatiotemporal attention mechanism to dynamically capture spatiotemporal relationships among data. Extensive experiments have been conducted on three types of typical urban sensing tasks, which verify the effectiveness of our proposed algorithms in improving the inference and long-term prediction accuracy with the sparse sensed data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Coarse-to-fine Cascaded Evidence-Distillation Neural Network for Explainable Fake News Detection 29

A Coarse-to-fine Cascaded Evidence-Distillation Neural Netwo...

引用

29th International Conference on computational Linguistics, COLING 2022

作者： Yang, Zhiwei Ma, Jing Chen, Hechang Lin, Hongzhan Luo, Ziyang Chang, Yi College of Computer Science and Technology Jilin University Changchun China Department of Computer Science Hong Kong Baptist University Hong Kong School of Artificial Intelligence International Center of Future Science Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education

Existing fake news detection methods aim to classify a piece of news as true or false and provide veracity explanations, achieving remarkable performances. However, they often tailor automated solutions on manual fact-checked reports, suffering from limited news coverage and debunking delays. When a piece of news has not yet been fact-checked or debunked, certain amounts of relevant raw reports are usually disseminated on various media outlets, containing the wisdom of crowds to verify the news claim and explain its verdict. In this paper, we propose a novel Coarse-to-fine Cascaded Evidence-Distillation (CofCED) neural network for explainable fake news detection based on such raw reports, alleviating the dependency on fact-checked ones. Specifically, we first utilize a hierarchical encoder for web text representation, and then develop two cascaded selectors to select the most explainable sentences for verdicts on top of the selected top-K reports in a coarse-to-fine manner. Besides, we construct two explainable fake news datasets, which is publicly available. Experimental results demonstrate that our model significantly outperforms state-of-the-art detection baselines and generates high-quality explanations from diverse evaluation perspectives. © 2022 Proceedings - International Conference on computational Linguistics, COLING. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Application of Monocular Direct Vision Odometry in Augmented Reality 5

Application of Monocular Direct Vision Odometry in Augmented...

引用

2020 5th International Seminar on Computer Technology, Mechanical and Electrical engineering, ISCME 2020

作者： Zhang, Zuoming Wang, Zixuan Wang, Hanwen Wang, Xin College of Software Engineering Jilin University Changchun Jilin130000 China Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun Jilin130000 China

In recent years, the unlabeled augmented reality system has been gradually applied to various mobile devices, among which stable, accurate, and fast registration is the key to realizing this function. For this technique, this paper introduces camera exposure parameters and puts the data association and pose estimation into a unified nonlinear optimization problem. Moreover, the direct monocular vision odometer is transplanted into the augmented reality system through the position adjustment module. We compare it with the traditional visual odometry method that matches the feature points. The results show that this improved method can be used to track more quickly and build a more visual semi-dense point cloud map, which can be used to support the registration and tracking of virtual objects in augmented reality. © Published under licence by IOP Publishing Ltd.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Fast Converging Anytime Model Counting

arXiv

引用

arXiv 2022年

作者： Lai, Yong Meel, Kuldeep S. Yap, Roland H.C. Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China School of Computing National University of Singapore Singapore

Model counting is a fundamental problem which has been influential in many applications, from artificial intelligence to formal verification. Due to the intrinsic hardness of model counting, approximate techniques have been developed to solve real-world instances of model counting. This paper designs a new anytime approach called PartialKC for approximate model counting. The idea is a form of partial knowledge compilation to provide an unbiased estimate of the model count which can converge to the exact count. Our empirical analysis demonstrates that PartialKC achieves significant scalability and accuracy over prior state-of-the-art approximate counters, including satss and STS. Interestingly, the empirical results show that PartialKC reaches convergence for many instances and therefore provides exact model counting performance comparable to state-of-the-art exact counters. Copyright © 2022, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incomplete Graph Learning: A Comprehensive Survey

arXiv

引用

arXiv 2025年

作者： Xia, Riting Liu, Huibo Li, Anchen Liu, Xueyan Zhang, Yan Zhang, Chunxu Yang, Bo College of Computer Science Inner Mongolia University Hohhot010021 China School of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

Graph learning is a prevalent field that operates on ubiquitous graph data. Effective graph learning methods can extract valuable information from graphs. However, these methods are non-robust and affected by missing attributes in graphs, resulting in sub-optimal outcomes. This has led to the emergence of incomplete graph learning, which aims to process and learn from incomplete graphs to achieve more accurate and representative results. In this paper, we conducted a comprehensive review of the literature on incomplete graph learning. Initially, we categorize incomplete graphs and provide precise definitions of relevant concepts, terminologies, and techniques, thereby establishing a solid understanding for readers. Subsequently, we classify incomplete graph learning methods according to the types of incompleteness: (1) attribute-incomplete graph learning methods, (2) attribute-missing graph learning methods, and (3) hybrid-absent graph learning methods. By systematically classifying and summarizing incomplete graph learning methods, we highlight the commonalities and differences among existing approaches, aiding readers in selecting methods and laying the groundwork for further advancements. In addition, we summarize the datasets, incomplete processing modes, evaluation metrics, and application domains used by the current methods. Lastly, we discuss the current challenges and propose future directions for incomplete graph learning, with the aim of stimulating further innovations in this crucial field. To our knowledge, this is the first review dedicated to incomplete graph learning, aiming to offer valuable insights for researchers in related fields.1 Copyright © 2025, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Migration: An Efficient Explorer Operator to Guide Swarm Evolution

Migration: An Efficient Explorer Operator to Guide Swarm Evo...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiaosong Han Chengyang Zhou Yanchun Liang Renchu Guan Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Zhuhai Laboratory of Key Laboratory for Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Zhuhai College of Science and Technology Zhuhai China

Particle Swarm Optimization with Migration (MPSO) is proposed to solve the issue that PSO will encounter unbearable time cost problems when dealing with High-dimension, Expensive and Black-box objective function tasks. The Migration operator is inspired by the migration of Salmon. Salmon will start a dangerous journey from the ocean to the home rivers for reproduction. The process of the entire behavior is similar to the reduction and recovery of dimension. Therefore, we design the Migration operator where a pretrained Wasserstein Autoencoders (WAE) is applied to simulate the migration behavior to accelerate the process of evolution in PSO, and we use Least-Squares Regression in lower space to produce better generation. In comparison with famous baseline methods in some benchmark functions, MPSO converges faster and more accurately, which shows the great potential of migration operations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：