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

K-ON: Stacking Knowledge On the Head Layer of Large Language Model 39

学校读者我要写书评

暂无评论

K-ON: Stacking Knowledge On the Head Layer of Large Language...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

ISBN: (纸本)157735897X

关键词： Contrastive Learning

Generalization-Enhanced Code Vulnerability Detection via Multi-Task Instruction Fine-Tuning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Du, Xiaohu Wen, Ming Zhu, Jiahao Xie, Zifan Ji, Bin Liu, Huijun Shi, Xuanhua Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China College of Computer National University of Defense Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab HUST Wuhan430074 China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security HUST Wuhan430074 China JinYinHu Laboratory Wuhan430077 China Cluster and Grid Computing Lab HUST Wuhan430074 China

Code Pre-trained Models (CodePTMs) based vulnerability detection have achieved promising results over recent years. However, these models struggle to generalize as they typically learn superficial mapping from source code to labels instead of understanding the root causes of code vulnerabilities, resulting in poor performance in real-world scenarios beyond the training instances. To tackle this challenge, we introduce VulLLM, a novel framework that integrates multi-task learning with Large Language Models (LLMs) to effectively mine deep-seated vulnerability features. Specifically, we construct two auxiliary tasks beyond the vulnerability detection task. First, we utilize the vulnerability patches to construct a vulnerability localization task. Second, based on the vulnerability features extracted from patches, we leverage GPT-4 to construct a vulnerability interpretation task. VulLLM innovatively augments vulnerability classification by leveraging generative LLMs to understand complex vulnerability patterns, thus compelling the model to capture the root causes of vulnerabilities rather than overfitting to spurious features of a single task. The experiments conducted on six large datasets demonstrate that VulLLM surpasses seven state-of-the-art models in terms of effectiveness, generalization, and robustness. © 2024, CC BY.

关键词： Large datasets

Tokenization, Fusion, and Augmentation: Towards Fine-grained Multi-modal Entity Representation 39

学校读者我要写书评

暂无评论

Tokenization, Fusion, and Augmentation: Towards Fine-grained...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhang, Yichi Chen, Zhuo Guo, Lingbing Xu, Yajing Hu, Binbin Liu, Ziqi Zhang, Wen Chen, Huajun College of Computer Science and Technology Zhejiang University China ZJU-Ant Group Joint Lab of Knowledge Graph China Ant Group China School of Software Technology Zhejiang University China Zhejiang Key Laboratory of Big Data Intelligent Computing China

ISBN: (纸本)157735897X

Multi-modal knowledge graph completion (MMKGC) aims to discover unobserved knowledge from given knowledge graphs, collaboratively leveraging structural information from the triples and multi-modal information of the entities to overcome the inherent incompleteness. Existing MMKGC methods usually extract multi-modal features with pre-trained models, resulting in coarse handling of multi-modal entity information, overlooking the nuanced, fine-grained semantic details and their complex interactions. To tackle this shortfall, we introduce a novel framework MYGO to tokenize, fuse, and augment the fine-grained multi-modal representations of entities and enhance the MMKGC performance. Motivated by the tokenization technology, MYGO tokenizes multi-modal entity information as fine-grained discrete tokens and learns entity representations with a cross-modal entity encoder. To further augment the multi-modal representations, MYGO incorporates fine-grained contrastive learning to highlight the specificity of the entity representations. Experiments on standard MMKGC benchmarks reveal that our method surpasses 19 of the latest models, underlining its superior performance. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

CCLNet: Causal and Contrastive Learning Framework for Enhanced Pulmonary Embolism Detection

学校读者我要写书评

暂无评论

CCLNet: Causal and Contrastive Learning Framework for Enhanc...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Zhipeng Wang Ruiquan Ge Jianxun Yu Feiwei Qin Yuan Tian Nannan Li Wenwen Min Ahmed Elazab Changmiao Wang HDU-ITMO Joint Institute Hangzhou Dianzi University Hangzhou China School of Computer Science Hangzhou Dianzi University Hangzhou China School of Management Dalian Polytechnic University Dalian China Second Affiliated Hospital Chinese University of Hong Kong Shenzhen China School of Science and Technology Macau University Macau China School of Information Science and Engineering Yunnan University Yunnan China School of Biomedical Engineering Shenzhen University Shenzhen China Medical Big Data Lab Shenzhen Research Institute of Big Data Shenzhen China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The fusion of multimodal medical data is crucial for helping doctors make accurate treatment decisions. For example, combining Computed Tomography Pulmonary Angiography (CTPA) with Electronic Health Records (EHR) can significantly improve the accuracy of Pulmonary Embolism (PE) detection, thereby increasing patient survival rates. Although multimodal learning has advantages in PE diagnosis, the heterogeneity of multimodal data poses a significant challenge to accurate diagnosis. The natural semantic and structural differences between data modalities make it difficult to effectively integrate their information. In addition, within a single modality, the existence of redundant and irrelevant information introduces unnecessary variability, making the data more complex, and making stable diagnosis challenging. To address these issues, we propose a new framework called CCLNet, which includes a contrastive learning component for addressing inter-modality heterogeneity and a causal learning component for handling intra-modality heterogeneity. Specifically, we achieve precise alignment between visual and tabular modalities by using global-level information to soften labels during contrastive learning. In addition, by using causal intervention methods to eliminate the influence of heterogeneous factors within the modality, we can accurately reveal the causal relationship between features and targets, thereby improving the accuracy and stability of the model. Experimental results demonstrate that our method performs excellently, achieving the best results. Our code is available at https://***/LeavingStarW/CLPE.

关键词： Visualization Accuracy Smoothing methods Hospitals Pulmonary diseases Lungs Semantics Contrastive learning Stability analysis Medical diagnostic imaging

GraphInstruct: Empowering Large Language Models with Graph Understanding and Reasoning Capability

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Luo, Zihan Song, Xiran Huang, Hong Lian, Jianxun Zhang, Chenhao Jiang, Jinqi Xie, Xing Huazhong University of Science and Technology Wuhan China Microsoft Research Asia Beijing China The National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Evaluating and enhancing the general capabilities of large language models (LLMs) has been an important research topic. Graph is a common data structure in the real world, and understanding graph data is a crucial part for advancing general intelligence. To evaluate and enhance the graph understanding abilities of LLMs, in this paper, we propose a benchmark named GraphInstruct, which comprehensively includes 21 classical graph reasoning tasks, providing diverse graph generation pipelines and detailed reasoning steps. Based on GraphInstruct, we further construct GraphLM through efficient instruction-tuning, which shows prominent graph understanding capability. In order to enhance the LLM with graph reasoning capability as well, we propose a step mask training strategy, and construct a model named GraphLM+. As one of the pioneering efforts to enhance the graph understanding and reasoning abilities of LLMs, extensive experiments have demonstrated the superiority of GraphLM and GraphLM+ over other LLMs. We look forward to more researchers exploring the potential of LLMs in the graph data mining domain through GraphInstruct. Our code for generating GraphInstruct is released publicly at: https://***/CGCL-codes/GraphInstruct. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational linguistics

A Four-Pronged Defense Against Byzantine Attacks in Federated Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wan, Wei Hu, Shengshan Li, Minghui Lu, Jianrong Zhang, Longling Zhang, Leo Yu Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Federated learning (FL) is a nascent distributed learning paradigm to train a shared global model without violating users' privacy. FL has been shown to be vulnerable to various Byzantine attacks, where malicious participants could independently or collusively upload well-crafted updates to deteriorate the performance of the global model. However, existing defenses could only mitigate part of Byzantine attacks, without providing an all-sided shield for FL. It is difficult to simply combine them as they rely on totally contradictory assumptions. In this paper, we propose FPD, a four-pronged defense against both non-colluding and colluding Byzantine attacks. Our main idea is to utilize absolute similarity to filter updates rather than relative similarity used in existingI works. To this end, we first propose a reliable client selection strategy to prevent the majority of threats in the bud. Then we design a simple but effective score-based detection method to mitigate colluding attacks. Third, we construct an enhanced spectral-based outlier detector to accurately discard abnormal updates when the training data is not independent and identically distributed (non-IID). Finally, we design update denoising to rectify the direction of the slightly noisy but harmful updates. The four sequentially combined modules can effectively reconcile the contradiction in addressing non-colluding and colluding Byzantine attacks. Extensive experiments over three benchmark image classification datasets against four state-of-the-art Byzantine attacks demonstrate that FPD drastically outperforms existing defenses in IID and non-IID scenarios (with 30% improvement on model accuracy). © 2023, CC BY.

关键词： Classification (of information)

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Dee...

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.

关键词：

Sequence-to-Action: Grammatical Error Correction with Action Guided Sequence Generation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Jiquan Guo, Junliang Zhu, Yongxin Sheng, Xin Jiang, Deqiang Ren, Bo Xu, Linli Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology China Tencent YouTu Lab China

The task of Grammatical Error Correction (GEC) has received remarkable attention with wide applications in Natural Language Processing (NLP) in recent years. While one of the key principles of GEC is to keep the correct parts unchanged and avoid over-correction, previous sequence-to-sequence (seq2seq) models generate results from scratch, which are not guaranteed to follow the original sentence structure and may suffer from the over-correction problem. In the meantime, the recently proposed sequence tagging models can overcome the over-correction problem by only generating edit operations, but are conditioned on human designed language-specific tagging labels. In this paper, we combine the pros and alleviate the cons of both models by proposing a novel Sequence-to-Action (S2A) module. The S2A module jointly takes the source and target sentences as input, and is able to automatically generate a token-level action sequence before predicting each token, where each action is generated from three choices named SKIP, COPY and GENerate. Then the actions are fused with the basic seq2seq framework to provide final predictions. We conduct experiments on the benchmark datasets of both English and Chinese GEC tasks. Our model consistently outperforms the seq2seq baselines, while being able to significantly alleviate the over-correction problem as well as holding better generality and diversity in the generation results compared to the sequence tagging models. © 2022, CC BY.

关键词： Error correction

Temporal Knowledge Graph Reasoning via Time-Distributed Representation Learning

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Reasoning via Time-Distributed Repr...

IEEE International Conference on data Mining (ICDM)

作者： Kangzheng Liu Feng Zhao Guandong Xu Xianzhi Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) reasoning has attracted significant attention. Recent approaches for modeling historical information have led to great advances. However, the problems of time variability and unseen entities have become two major obstacles preventing further development. The time variability problem means that different historical timestamps play different roles in the inference process. Furthermore, in the context of time variability, the unseen entity problem means that a query cannot obtain a predicted entity that is unseen in the scale-varying history rather than in a fixed set, thus turning from static to dynamic. In this paper, we propose a novel method named DHU-NET for addressing the time variability challenge and the dynamic unseen entity challenge derived from it. With regard to the former concern, we propose a time-distributed representation learning method based on a graph convolutional network(GCN) and a self-attention mechanism, which learns the distributed representations of facts at different historical timestamps and comprehensively pays different levels of attention to the different timestamps. With regard to the latter issue, we extract the unseen entities from a global static KG based on a copy mechanism and bring them into consideration during the final prediction step. Experiments on six benchmark datasets demonstrate the substantial improvements achieved by DHUNET in terms of multiple evaluation metrics. Our released codes are available at https://***/CGCL-codes/DHUNET.

关键词： Representation learning Measurement Knowledge engineering Predictive models Turning Cognition data models