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

arXiv 2024年

作者： Zhou, Yuqi Dai, Sunhao Pang, Liang Wang, Gang Dong, Zhenhua Xu, Jun Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Beijing China CAS Key Laboratory of AI Safety Institute of Computing Technology CAS Beijing China Huawei Noah’s Ark Lab Shenzhen China

Recently, researchers have uncovered that neural retrieval models prefer ai-generated content (aiGC), called source bias [10, 40]. Compared to active search behavior, recommendation represents another important means of information acquisition, where users are more prone to source bias. Furthermore, delving into the recommendation scenario, as aiGC becomes integrated within the feedback loop involving users, data, and the recommender system, it progressively contaminates the candidate items, the user interaction history, and ultimately, the data used to train the recommendation models. How and to what extent the source bias affects the neural recommendation models within feedback loop remains unknown. In this study, we extend the investigation of source bias into the realm of recommender systems, specifically examining its impact across different phases of the feedback loop. We conceptualize the progression of aiGC integration into the recommendation content ecosystem in three distinct phases-HGC dominate, HGC-aiGC coexist, and aiGC dominance-each representing past, present, and future states, respectively. Through extensive experiments across three datasets from diverse domains, we demonstrate the prevalence of source bias and reveal a potential digital echo chamber with source bias amplification throughout the feedback loop. This trend risks creating a recommender ecosystem with limited information source, such as aiGC, being disproportionately recommended. To counteract this bias and prevent its escalation in the feedback loop, we introduce a black-box debiasing method that maintains model impartiality towards both HGC and aiGC. Our experimental results validate the effectiveness of the proposed debiasing method, confirming its potential to disrupt the feedback loop. © 2024, CC BY-NC-ND.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Context Graph

arXiv

引用

arXiv 2024年

作者： Xu, Chengjin Li, Muzhi Yang, Cehao Jiang, Xuhui Tang, Lumingyuan Qi, Yiyan Guo, Jian IDEA Research International Digital Economy Academy China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong CAS Key Laboratory of AI Safety Institute of Computing Technology CAS China

Knowledge Graphs (KGs) are foundational structures in many ai applications, representing entities and their interrelations through triples. However, triple-based KGs lack the contextual information of relational knowledge, like temporal dynamics and provenance details, which are crucial for comprehensive knowledge representation and effective reasoning. Instead, Context Graphs (CGs) expand upon the conventional structure by incorporating additional information such as time validity, geographic location, and source provenance. This integration provides a more nuanced and accurate understanding of knowledge, enabling KGs to offer richer insights and support more sophisticated reasoning processes. In this work, we first discuss the inherent limitations of triple-based KGs and introduce the concept of CGs, highlighting their advantages in knowledge representation and reasoning. We then present a context graph reasoning CGR3 paradigm that leverages large language models (LLMs) to retrieve candidate entities and related contexts, rank them based on the retrieved information, and reason whether sufficient information has been obtained to answer a query. Our experimental results demonstrate that CGR3 significantly improves performance on KG completion (KGC) and KG question answering (KGQA) tasks, validating the effectiveness of incorporating contextual information on KG representation and reasoning. © 2024, CC BY-NC-ND.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

F2GNN: An Adaptive Filter with Feature Segmentation for Graph-Based Fraud Detection

F2GNN: An Adaptive Filter with Feature Segmentation for Grap...

引用

International Conference on Acoustics, Speech, and Signal Processing (IcasSP)

作者： Guanghui Hu Yang Liu Qing He Xiang Ao Henan Institute of Advanced Technology Zhengzhou University Zhengzhou P.R. China Key Laboratory of AI Safety & Security Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China CASMINO Ltd. Suzhou China

Graph Neural Networks (GNNs) have received remarkable success in identifying fraudulent activities on graphs. Most approaches leverage the full user feature together and aggregate the messages from its neighbors by a graph filter. However, due to the adversarial activities like the camouflage of fraudsters, most dimensions of fraudsters' features resemble normal users, and modeling the features as a whole cannot fully explore the small-portion fraudulent features. In this paper, we attempt to segment the user features and apply adaptive graph filters on each segmentation for better modeling of fraudulent features. We propose an adaptive filter with feature segmentation (shortened as F 2 GNN) to alleviate these challenges. Experimental results on two real-world datasets demonstrate that F 2 GNN outperforms state-of-the-art baselines for graph-based fraud detection. In addition, the adaptive filter with feature segmentation can effectively address the class imbalance problem in the task of fraud detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IDEA: Invariant Defense for Graph Adversarial Robustness

arXiv

引用

arXiv 2023年

作者： Tao, Shuchang Cao, Qi Shen, Huawei Wu, Yunfan Xu, Bingbing Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Despite the success of graph neural networks (GNNs), their vulnerability to adversarial attacks poses tremendous challenges for practical applications. Existing defense methods suffer from severe performance decline under unseen attacks, due to either limited observed adversarial examples or pre-defined heuristics. To address these limitations, we analyze the causalities in graph adversarial attacks and conclude that causal features are key to achieve graph adversarial robustness, owing to their determinedness for labels and invariance across attacks. To learn these causal features, we innovatively propose an Invariant causal DEfense method against adversarial Attacks (IDEA). We derive node-based and structure-based invariance objectives from an information-theoretic perspective. IDEA ensures strong predictability for labels and invariant predictability across attacks, which is provably a causally invariant defense across various attacks. Extensive experiments demonstrate that IDEA attains state-of-the-art defense performance under all five attacks on all five datasets. The implementation of IDEA is available at https://***/r/IDEA. Copyright © 2023, The Authors. All rights reserved.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

The Butterfly Effect of Model Editing: Few Edits Can Trigger Large Language Models Collapse

arXiv

引用

arXiv 2024年

作者： Yang, Wanli Sun, Fei Ma, Xinyu Liu, Xun Yin, Dawei Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China

Although model editing has shown promise in revising knowledge in Large Language Models (LLMs), its impact on the inherent capabilities of LLMs is often overlooked. In this work, we reveal a critical phenomenon: even a single edit can trigger model collapse, manifesting as significant performance degradation in various benchmark tasks. However, benchmarking LLMs after each edit, while necessary to prevent such collapses, is impractically time-consuming and resource-intensive. To mitigate this, we propose using perplexity as a surrogate metric, validated by extensive experiments demonstrating changes in an edited model’s perplexity are strongly correlated with its downstream task performances. We further conduct an in-depth study on sequential editing, a practical setting for real-world scenarios, across various editing methods and LLMs, focusing on hard cases from our previous single edit studies. The results indicate that nearly all examined editing methods result in model collapse after only few edits. To facilitate further research, we have utilized GPT-3.5 to develop a new dataset, HardEdit, based on those hard cases. This dataset aims to establish the foundation for pioneering research in reliable model editing and the mechanisms underlying editing-induced model collapse. We hope this work can draw the community’s attention to the potential risks inherent in model editing practices1 Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Query-centric Audio-Visual Cognition Network for Moment Retrieval, Segmentation and Step-Captioning

arXiv

引用

arXiv 2024年

作者： Tu, Yunbin Li, Liang Su, Li Huang, Qingming School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of AI Safety of CAS Institute of Computing Technology Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Video has emerged as a favored multimedia format on the internet. To better gain video contents, a new topic HIREST is presented, including video retrieval, moment retrieval, moment segmentation, and step-captioning. The pioneering work chooses the pre-trained CLIP-based model for video retrieval, and leverages it as a feature extractor for other three challenging tasks solved in a multi-task learning paradigm. Nevertheless, this work struggles to learn the comprehensive cognition of user-preferred content, due to disregarding the hierarchies and association relations across modalities. In this paper, guided by the shallow-to-deep principle, we propose a query-centric audio-visual cognition (QUAG) network to construct a reliable multi-modal representation for moment retrieval, segmentation and step-captioning. Specifically, we first design the modality-synergistic perception to obtain rich audio-visual content, by modeling global contrastive alignment and local fine-grained interaction between visual and audio modalities. Then, we devise the query-centric cognition that uses the deep-level query to perform the temporal-channel filtration on the shallow-level audio-visual representation. This can cognize user-preferred content and thus attain a query-centric audio-visual representation for three tasks. Extensive experiments show QUAG achieves the SOTA results on HIREST. Further, we test QUAG on the query-based video summarization task and verify its good generalization. The code is available at https://***/tuyunbin/QUAG. © 2024, CC BY.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

SecMdp: Towards Privacy-Preserving Multimodal Deep Learning in End-Edge-Cloud

SecMdp: Towards Privacy-Preserving Multimodal Deep Learning ...

引用

International Conference on Data Engineering

作者： Zhao Bai Mingyue Wang Fangda Guo Yu Guo Chengjun Cai Rongfang Bie Xiaohua Jia Beijing Normal University Harbin Institute of Technology CAS Key Laboratory of AI Safety & Security Institute of Computing Technology Chinese Academy of Sciences City University of Hong Kong Dongguan Research Institute City University of Hong Kong

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Multimodal deep learning technologies have advanced significantly, which brings extensive applications in diverse fields. The substantial computational demands of training and prediction in multimodal deep learning have made the End-Edge-Cloud (EEC) framework popular. It is essential to protect multimodal data and model privacy in such a framework. However, traditional cryptographic methods, though secure for data and models at edge nodes, cause efficiency limitations. In this paper, we propose SecMdp, an SGX-assisted secure computational framework for multimodal data in the EEC architecture. Edge nodes are equipped with the trusted execution environment (e.g., Intel SGX) to run multimodal algorithms. Additionally, to address the side-channel attacks of SGX, we present an enhanced PathORAM algorithm, MM_PathORAM, for the multimodal training and prediction processes, which are tailored for multimodal deep learning scenarios. It accelerates multimodal data access while protecting data privacy and model security. Experimental evaluation supports the effectiveness of our design in preserving edge computing efficiency. It demonstrates negligible impact on the speed of multimodal data loading, the configuration of model parameters during training, or the accuracy of predictions.

关键词： Deep learning Training Data privacy Computational modeling Loading Computer architecture Side-channel attacks

来源：评论

学校读者我要写书评

暂无评论

PERPLEXITY-TRAP: PLM-BASED RETRIEVERS OVERRATE LOW PERPLEXITY DOCUMENTS

arXiv

引用

arXiv 2025年

作者： Wang, Haoyu Dai, Sunhao Zhao, Haiyuan Pang, Liang Zhang, Xiao Wang, Gang Dong, Zhenhua Xu, Jun Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Beijing China CAS Key Laboratory of AI Safety Institute of Computing Technology Beijing China Huawei Noah’s Ark Lab Shenzhen China

Previous studies have found that PLM-based retrieval models exhibit a preference for LLM-generated content, assigning higher relevance scores to these documents even when their semantic quality is comparable to human-written ones. This phenomenon, known as source bias, threatens the sustainable development of the information access ecosystem. However, the underlying causes of source bias remain unexplored. In this paper, we explain the process of information retrieval with a causal graph and discover that PLM-based retrievers learn perplexity features for relevance estimation, causing source bias by ranking the documents with low perplexity higher. Theoretical analysis further reveals that the phenomenon stems from the positive correlation between the gradients of the loss functions in language modeling task and retrieval task. Based on the analysis, a causal-inspired inference-time debiasing method is proposed, called Causal Diagnosis and Correction (CDC). CDC first diagnoses the bias effect of the perplexity and then separates the bias effect from the overall estimated relevance score. Experimental results across three domains demonstrate the superior debiasing effectiveness of CDC, emphasizing the validity of our proposed explanatory framework 1 © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

STRUEDIT: Structured Outputs Enable the Fast and Accurate Knowledge Editing for Large Language Models

arXiv

引用

arXiv 2024年

作者： Bi, Baolong Liu, Shenghua Wang, Yiwei Mei, Lingrui Gao, Hongcheng Fang, Junfeng Cheng, Xueqi CAS Key Laboratory of AI Safety Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China University of California Los Angeles United States Hefei China

As the modern tool of choice for question answering, large language models (LLMs) are expected to deliver answers with up-to-date knowledge. To achieve such ideal question-answering systems, locating and then editing outdated knowledge in the natural language outputs is a general target of popular knowledge editing methods. However, this target is challenging, as both identifying which tokens to edit in the reasoning steps and ensuring the coherence of the revised reasoning chain are difficult tasks. We argue that these challenges stem from the unstructured nature of natural language outputs. To address the above challenges, we propose Structural Editing (STRUEDIT), an improved baseline for knowledge editing. We first prompt LLMs to produce structured outputs consisting of reasoning triplets. Then, STRUEDIT removes any potentially outdated knowledge and efficiently refills the structured outputs with up-to-date information in a single step. Experimental results show that STRUEDIT consistently delivers the highest accuracy with lowest latency compared with other knowledge editing methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

SACH: Significant-Attributed Community Search in Heterogeneous Information Networks

SACH: Significant-Attributed Community Search in Heterogeneo...

引用

International Conference on Data Engineering

作者： Yanghao Liu Fangda Guo Bingbing Xu Peng Bao Huawei Shen Xueqi Cheng CAS Key Laboratory of AI Safety & Security Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Beijing Jiaotong University Beijing China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Community search is a personalized community discovery problem aimed at finding densely-connected subgraphs containing the query vertex. In particular, the search for com-munities with high-importance vertices has recently received a great deal of attention. However, existing works mainly focus on conventional homogeneous networks where vertices are of the same type, but are not applicable to heterogeneous information networks (HINs) composed of multi-typed vertices and different semantic relations, such as bibliographic networks. In this paper, we study the problem of high-importance community search in HINs. A novel community model is introduced, named heterogeneous significant community (HSC), to unravel the closely connected vertices of the same type with high attribute values through multiple semantic relationships. An HSC not only maximizes the exploration of indirect relationships across entities of the anchor-type but incorporates their significance. To search the HSCs, we first develop online algorithms by exploiting both segmented-based meta-path expansion and significance incrernent. Specially, a solution space reuse strategy based on structural nesting is designed to boost the efficiency. In addition, we further devise a two-level index to support searching HSCs in optimal time, based on which a space-efficient compact index is proposed. Extensive experiments on real-world large-scale HINs demonstrate that our solutions are effective and efficient for searching HSCs, and the index-based algorithms are 2–4 orders of magnitude faster than online algorithms.

关键词： Semantics Search problems Data engineering Indexes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：