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

23rd China National Conference on Computational Linguistics, CCL 2024

作者： Han, Wenjuan Wei, Xiang Cui, Xingyu Cheng, Ning Jiang, Guangyuan Qian, Weinan Zhang, Chi Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China Peking University Beijing China

ISBN: (纸本)9789819783663

Deploying tuning-free prompting is challenging in engineering practice: it not only requires users to engage in cumbersome trials and errors but is also extremely time-consuming, as even a slight change in wording and phrasing could have a huge impact on the final performance. To further investigate the impact of different prompts, in this work, we perform a systematic inspection of four factors in linguistics involved in prompt engineering: syntax, semantics, lexicon, and pragmatics. The empirical results quantify the sensitivity of the output to small textual perturbations in four linguistic factors of prompts. Based on the analysis of these four factors, we present a series of design guidelines to help human users write effective prompts. Human evaluation on amateurs shows that using the proposed guidelines helps humans produce prompts with significant gains in zero-shot performance in Pre-trained Language Models (PLMs) and hence validates the utility of the guidelines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

KG-FPQ: Evaluating Factuality Hallucination in LLMs with Knowledge Graph-based False Premise Questions 31

KG-FPQ: Evaluating Factuality Hallucination in LLMs with Kno...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhu, Yanxu Xiao, Jinlin Wang, Yuhang Sang, Jitao Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University China Peng Cheng Lab China

ISBN: (纸本)9798891761964

Recent studies have demonstrated that large language models (LLMs) are susceptible to being misled by false premise questions (FPQs), leading to errors in factual knowledge, known as factuality hallucination. Existing benchmarks that assess this vulnerability primarily rely on manual construction, resulting in limited size and lack of expandability. In this work, we introduce an automated, scalable pipeline to create FPQs based on knowledge graphs (KGs). The first step is to modify true triplets extracted from KGs to create false premises. Subsequently, utilizing the state-of-the-art capabilities of GPTs, we generate semantically rich FPQs. Based on the proposed method, we present a comprehensive benchmark, the Knowledge Graph-based False Premise Questions (KG-FPQ), which contains approximately 178k FPQs across three knowledge domains, at six levels of confusability, and in two task formats. Using KG-FPQ, we conduct extensive evaluations on several representative LLMs and provide valuable insights. The KG-FPQ dataset and code are available at https://***/yanxuzhu/KG-FPQ. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Enhancing Rumor Detection Methods with Propagation Structure Infused Language Model 31

Enhancing Rumor Detection Methods with Propagation Structure...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Cui, Chaoqun Li, Siyuan Ma, Kunkun Jia, Caiyan School of Computer Science and Technology & Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China

ISBN: (纸本)9798891761964

Pretrained Language Models (PLMs) have excelled in various Natural Language Processing tasks, benefiting from large-scale pretraining and self-attention mechanism's ability to capture long-range dependencies. However, their performance on social media application tasks like rumor detection remains suboptimal. We attribute this to mismatches between pretraining corpora and social texts, inadequate handling of unique social symbols, and pretraining tasks ill-suited for modeling user engagements implicit in propagation structures. To address these issues, we propose a continue pretraining strategy called Post Engagement Prediction (PEP) to infuse information from propagation structures into PLMs. PEP makes models to predict root, branch, and parent relations between posts, capturing interactions of stance and sentiment crucial for rumor detection. We also curate and release large-scale Twitter corpus: TwitterCorpus (269GB text), and two unlabeled claim conversation datasets with propagation structures (UTwitter and UWeibo). Utilizing these resources and PEP strategy, we train a Twitter-tailored PLM called SoLM. Extensive experiments demonstrate PEP significantly boosts rumor detection performance across universal and social media PLMs, even in few-shot scenarios. On benchmark datasets, PEP enhances baseline models by 1.0-3.7% accuracy, even enabling it to outperform current state-of-the-art methods on multiple datasets. SoLM alone, without high-level modules, also achieves competitive results, highlighting the strategy's effectiveness in learning discriminative post interaction features. © 2025 Association for Computational Linguistics.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

Towards Real-World Rumor Detection: Anomaly Detection Framework with Graph Supervised Contrastive Learning 31

Towards Real-World Rumor Detection: Anomaly Detection Framew...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Cui, Chaoqun Jia, Caiyan School of Computer Science and Technology & Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China

ISBN: (纸本)9798891761964

Current rumor detection methods based on propagation structure learning predominately treat rumor detection as a class-balanced classification task on limited labeled data. However, real-world social media data exhibits an imbalanced distribution with a minority of rumors among massive regular posts. To address the data scarcity and imbalance issues, we construct two large-scale conversation datasets from Weibo and Twitter and analyze the domain distributions. We find obvious differences between rumor and non-rumor distributions, with non-rumors mostly in entertainment domains while rumors concentrate in news, indicating the conformity of rumor detection to an anomaly detection paradigm. Correspondingly, we propose the Anomaly Detection framework with Graph Supervised Contrastive Learning (AD-GSCL). It heuristically treats unlabeled data as non-rumors and adapts graph contrastive learning for rumor detection. Extensive experiments demonstrate AD-GSCL's superiority under class-balanced, imbalanced, and few-shot conditions. Our findings provide valuable insights for real-world rumor detection featuring imbalanced data distributions. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multilingual Knowledge Editing with Language-Agnostic Factual Neurons 31

Multilingual Knowledge Editing with Language-Agnostic Factua...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Xue Liang, Yunlong Meng, Fandong Zhang, Songming Chen, Yufeng Xu, Jinan Zhou, Jie Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China Pattern Recognition Center WeChat AI Tencent Inc China

ISBN: (纸本)9798891761964

Multilingual knowledge editing (MKE) aims to simultaneously update factual knowledge across multiple languages within large language models (LLMs). Previous research indicates that the same knowledge across different languages within LLMs exhibits a degree of shareability. However, most existing MKE methods overlook the connections of the same knowledge between different languages, resulting in knowledge conflicts and limited edit performance. To address this issue, we first investigate how LLMs process multilingual factual knowledge and discover that the same factual knowledge in different languages generally activates a shared set of neurons, which we call language-agnostic factual neurons (LAFNs). These neurons represent the same factual knowledge shared across languages and imply the semantic connections among multilingual knowledge. Inspired by this finding, we propose a new MKE method by Locating and Updating Language-Agnostic Factual Neurons (LU-LAFNs) to edit multilingual knowledge simultaneously, which avoids knowledge conflicts and thus improves edit performance. Experimental results on Bi-ZsRE and MzsRE benchmarks demonstrate that our method achieves the best edit performance, indicating the effectiveness and importance of modeling the semantic connections among multilingual knowledge. © 2025 Association for Computational Linguistics.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Progressive Multi-Plane Images Construction for Light Field Occlusion Removal

引用

IEEE Transactions on Visualization and Computer Graphics 2025年

作者： Zhang, Shuo Chang, Song Shi, Zhuoyu Lin, Youfang Beijing Jiaotong University Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer and Technology Beijing100044 China

Recently, Light Field (LF) shows great potential in removing occlusion since the objects occluded in some views may be visible in other views. However, existing LF-based methods implicitly model each scene and can only remove objects that have positive disparities in one central views. In this paper, we propose a novel Progressive Multi-Plane Images (MPI) Construction method specifically designed for LF-based occlusion removal. Different from the previous MPI construction methods, we progressively construct MPIs layer by layer in order from near to far. In order to accurately model the current layer, the positions of foreground occlusions in the nearer layers are taken as occlusion prior. Specifically, we propose an Occlusion-Aware Attention Network to generate each layer of MPIs with reliable information in occluded regions. For each layer, occlusions in the current layer are filtered out so that the background is better recovered just using the visible views instead of the other occluded views. Then, by simply removing the layers containing occlusions and rendering MPIs in kinds of viewpoints, the occlusion removal results for different views are generated. Experiments on synthetic and real-world scenes show that our method outperforms state-of-the-art LF occlusion removal methods in quantitative and visual comparisons. Moreover, we also apply the proposed progressive MPI construction method to the view synthesis task. The occlusion edges in our synthesized views achieve significantly better quality, which also verifies that our method can better model the occluded regions. © 1995-2012 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WTU-EVAL: A Whether-or-Not Tool Usage Evaluation Benchmark for Large Language Models

WTU-EVAL: A Whether-or-Not Tool Usage Evaluation Benchmark f...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Jian Ning, Kangyun Su, Yisong Han, Wenjuan Xu, Jinan Zhang, Yuanzhe University of Science and Technology Beijing China Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China College of Computer and Data Science Fuzhou University Fuzhou China National Science Library Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798350368741

Although Large Language Models (LLMs) excel in NLP tasks, they still need external tools to extend their ability. Current research on tool learning with LLMs often assumes mandatory tool use, which does not always align with real-world situations, where the necessity for tools is uncertain, and incorrect or unnecessary use of tools can damage the general abilities of LLMs. Therefore, we propose to explore whether LLMs can discern their ability boundaries and use tools flexibly. We then introduce the Whether-or-not tool usage Evaluation benchmark (WTU-Eval) to assess LLMs with eleven datasets, where six of them are tool-usage datasets, and five are general datasets. LLMs are prompted to use tools according to their needs. The results of eight LLMs on WTU-Eval reveal that LLMs frequently struggle to determine tool use in general datasets, and LLMs' performance in tool-usage datasets improves when their ability is similar to ChatGPT. © 2025 IEEE.

关键词： Ability Boundary Evaluation Large Language Models Tool Usage

来源：评论

学校读者我要写书评

暂无评论

Next-POI Recommendation via Spatial-Temporal Knowledge Graph Contrastive Learning and Trajectory Prompt

引用

IEEE Transactions on Knowledge and data Engineering 2025年第6期37卷 3570-3582页

作者： Chen, Wei Huang, Haoyu Zhang, Zhiyu Wang, Tianyi Lin, Youfang Chang, Liang Wan, Huaiyu Guilin University of Electronic Technology Guangxi Key Lab of Trusted Software Guangxi Guilin541004 China Beijing Jiaotong University School of Computer Science and Technology Beijing100044 China Chinese University of Hong Kong Department of Computer Science and Engineering Ma Liu Shui Hong Kong Beijing Jiaotong University Beijing Key Laboratory of Traffic Data Mining and Embodied Intelligence Beijing100044 China

Next POI (Point-of-Interest) recommendation aims to forecast users' future movements based on their historical check-in trajectories, holding significant value in location-based services. Existing methods address trajectory data sparsity by integrating rich auxiliary information or using spatial-temporal knowledge graphs (STKGs), showing promising results. Yet, they face two main challenges: i) Due to the difficulty of transforming structured trajectory data into trajectory text describing users' spatial-temporal mobility, the powerful reasoning ability of pre-trained language models is rarely explored to enhance recommendation performance. ii) Methods based on STKG can introduce external knowledge inconsistent with user preferences, leading to the knowledge noise generated hampering the accuracy of recommendations. To this end, we propose a novel approach called STKG-PLM that integrates STKG contrastive learning and prompt pre-trained language model (PLM) to enhance the next POI recommendation. Specifically, we design a spatial-temporal trajectory prompt template that transforms structured trajectories into text corpus based on STKG, serving as the input of PLM to understand the movement pattern of users from coarse-grained and fine-grained perspectives. Additionally, we propose an STKG contrastive learning framework to mitigate the introduced knowledge noise. Extensive experiments on three real-world datasets demonstrate that STKG-PLM exhibits notable performance improvements over the state-of-the-art baseline methods. © 1989-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AlignDistil: Token-Level Language Model Alignment as Adaptive Policy Distillation

arXiv

引用

arXiv 2025年

作者： Zhang, Songming Zhang, Xue Zhang, Tong Hu, Bojie Chen, Yufeng Xu, Jinan Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China Tencent Inc China

In modern large language models (LLMs), LLM alignment is of crucial importance and is typically achieved through methods such as reinforcement learning from human feedback (RLHF) and direct preference optimization (DPO). However, in most existing methods for LLM alignment, all tokens in the response are optimized using a sparse, response-level reward or preference annotation. The ignorance of token-level rewards may erroneously punish high-quality tokens or encourage low-quality tokens, resulting in suboptimal performance and slow convergence speed. To address this issue, we propose AlignDistil, an RLHF-equivalent distillation method for token-level reward optimization. Specifically, we introduce the reward learned by DPO into the RLHF objective and theoretically prove the equivalence between this objective and a token-level distillation process, where the teacher distribution linearly combines the logits from the DPO model and a reference model. On this basis, we further bridge the accuracy gap between the reward from the DPO model and the pure reward model, by building a contrastive DPO reward with a normal and a reverse DPO model. Moreover, to avoid under- and over-optimization on different tokens, we design a token adaptive logit extrapolation mechanism to construct an appropriate teacher distribution for each token. Experimental results demonstrate the superiority of our AlignDistil over existing methods and showcase fast convergence due to its token-level distributional reward optimization. © 2025, CC BY-NC-ND.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

HGFormer: Topology-Aware Vision Transformer with HyperGraph Learning

引用

IEEE Transactions on Multimedia 2025年

作者： Wang, Hao Zhang, Shuo Leng, Biao Beihang University School of Computer Science and Engineering Beijing100191 China Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer Science & Technology Beijing100044 China

The computer vision community has witnessed an extensive exploration of vision transformers in the past two years. Drawing inspiration from traditional schemes, numerous works focus on introducing vision-specific inductive biases. However, the implicit modeling of permutation invariance and fully-connected interaction with individual tokens disrupts the regional context and spatial topology, further hindering higher-order modeling. This deviates from the principle of perceptual organization that emphasizes the local groups and overall topology of visual elements. Thus, we introduce the concept of hypergraph for perceptual exploration. Specifically, we propose a topology-aware vision transformer called HyperGraph Transformer (HGFormer). Firstly, we present a Center Sampling K-Nearest Neighbors (CS-KNN) algorithm for semantic guidance during hypergraph construction. Secondly, we present a topology-aware HyperGraph Attention (HGA) mechanism that integrates hypergraph topology as perceptual indications to guide the aggregation of global and unbiased information during hypergraph messaging. Using HGFormer as visual backbone, we develop an effective and unitive representation, achieving distinct and detailed scene depictions. Empirical experiments show that the proposed HGFormer achieves competitive performance compared to the recent SoTA counterparts on various visual benchmarks. Extensive ablation and visualization studies provide comprehensive explanations of our ideas and contributions. © 2025 IEEE.

关键词： Hypergraph Learning Image Classification Vision Transformer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：