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

31st International Conference on Computational Linguistics, COLING 2025

作者： Hu, Zhilei Li, Zixuan Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesSchool of Computer Science and Technology University of Chinese Academy of Sciences

ISBN: (纸本)9798891761964

Event Relation Extraction (ERE) aims to extract various types of relations between different events within texts. Although Large Language Models (LLMs) have demonstrated impressive capabilities in many natural language processing tasks, existing ERE methods based on LLMs still face three key challenges: (1) Time Inefficiency: The existing pairwise method of combining events and determining their relations is time-consuming for LLMs. (2) Low Coverage: When dealing with numerous events in a document, the limited generation length of fine-tuned LLMs restricts the coverage of their extraction results. (3) Lack of Rationale: Essential rationales concerning the results that could enhance the reasoning ability of the model are overlooked. To address these challenges, we propose LLMERE, an LLM-based approach with rationales for the ERE task. LLMERE transforms ERE into a question-and-answer task that may have multiple answers. By extracting all events related to a specified event at once, LLMERE reduces time complexity from O(n2) to O(n), compared to the pairwise method. Subsequently, LLMERE enhances the coverage of extraction results by employing a partitioning strategy that highlights only a portion of the events in the document at a time. In addition to the extracted results, LLMERE is also required to generate corresponding rationales/reasons behind them, in terms of event coreference information or transitive chains of event relations. Experimental results on three widely used datasets show that LLMERE achieves significant improvements over baseline methods. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

引用

Digital Communications and networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search 31

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yuan, Ziming Dai, Lei Li, Wen Zhang, Jie Liang, Shengwen Wang, Ying Liu, Cheng Li, Huawei Li, Xiaowei Guo, Jiafeng Wang, Peng Chen, Renhai Zhang, Gong Shanxi University School of Computer and Information Technology China Peking University School of Computer Science China Institute of Computing Technology CAS State Key Lab of Processors China University of Chinese Academy of Sciences China Zhongguancun National Laboratory Beijing China Institute of Computing Technology CAS Key Lab of Network Data Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9798331506476

Neural Vector Search (NVS) has exhibited superior search quality over traditional key-based strategies for information retrieval tasks. An effective NVS architecture requires high recall, low latency, and high throughput to enhance user experience and cost-efficiency. However, implementing NVS on existing neural network accelerators and vector search accelerators is sub-optimal due to the separation between the embedding stage and vector search stage at both algorithm and architecture levels. Fortunately, we unveil that Product Quantization (PQ) opens up an opportunity to break separation. However, existing PQ algorithms and accelerators still focus on either the embedding stage or the vector search stage, rather than both simultaneously. Simply combining existing solutions still follows the beaten track of separation and suffers from insufficient parallelization, frequent data access conflicts, and the absence of scheduling, thus failing to reach optimal recall, latency, and throughput. To this end, we propose a unified and efficient NVS accelerator dubbed NeuVSA based on algorithm and architecture co-design philosophy. Specifically, on the algorithm level, we propose a learned PQ-based unified NVS algorithm that consolidates two separate stages into the same computing and memory access paradigm. It integrates an end-to-end joint training strategy to learn the optimal codebook and index for enhanced recall and reduced PQ complexity, thus achieving smoother acceleration. On the architecture level, we customize a homogeneous NVS accelerator based on the unified NVS algorithm. Each sub-accelerator is optimized to exploit all parallelism exposed by unified NVS, incorporating a structured index assignment strategy and an elastic on-chip buffer to alleviate buffer conflicts for reduced latency. All sub-accelerators are coordinated using a hardware-aware scheduling strategy for boosted throughput. Experimental results show that the joint training strategy improves recall

关键词： network embeddings

来源：评论

学校读者我要写书评

暂无评论

Inductive Link Prediction in N-ary Knowledge Graphs 31

Inductive Link Prediction in N-ary Knowledge Graphs

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761964

N-ary Knowledge Graphs (NKGs), where a fact can involve more than two entities, have gained increasing attention. Link Prediction in NKGs (LPN) aims to predict missing elements in facts to facilitate the completion of NKGs. Current LPN methods implicitly operate under a closed-world assumption, meaning that the sets of entities and roles are fixed. These methods focus on predicting missing elements within facts composed of entities and roles seen during training. However, in reality, new facts involving unseen entities and roles frequently emerge, requiring completing these facts. Thus, this paper proposes a new task, Inductive Link Prediction in NKGs (ILPN), which aims to predict missing elements in facts involving unseen entities and roles in emerging NKGs. To address this task, we propose a Meta-learning-based Nary knowledge Inductive Reasoner (MetaNIR), which employs a graph neural network with meta-learning mechanisms to embed unseen entities and roles adaptively. The obtained embeddings are used to predict missing elements in facts involving unseen elements. Since no existing dataset supports this task, three datasets are constructed to evaluate the effectiveness of MetaNIR. Extensive experimental results demonstrate that MetaNIR consistently outperforms representative models across all datasets. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

MDPO: Customized Direct Preference Optimization with a Metric-based Sampler for Question and Answer Generation 31

MDPO: Customized Direct Preference Optimization with a Metri...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wang, Yihang Tian, Bowen Su, Yueyang Fan, Yixing Guo, Jiafeng Beijing University of Posts and Telecommunications Beijing China Guangzhou China CAS Key Lab of Network Data Science and Technology ICT CAS Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798891761964

With the extensive use of large language models, automatically generating QA datasets for domain-specific fine-tuning has become crucial. However, considering the multifaceted demands for readability, diversity, and comprehensiveness of QA data, current methodologies fall short in producing high-quality QA datasets. Moreover, the dependence of existing evaluation metrics on ground truth labels further exacerbates the challenges associated with the selection of QA data. In this paper, we introduce a novel method for QA data generation, denoted as MDPO. We proposes a set of unsupervised evaluation metrics for QA data, enabling multidimensional assessment based on the relationships among context,question and answer. Furthermore, leveraging these metrics, we implement a customized direct preference optimization process that guides large language models to produce high-quality and domain-specific QA pairs. Empirical results on public datasets indicate that MDPO's performance substantially surpasses that of state-of-the-art methods. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Explainable and Layout-Aware Timing Prediction 24

Explainable and Layout-Aware Timing Prediction

引用

43rd International Conference on Computer-Aided Design, ICCAD 2024

作者： Lyu, Zhengyang Li, Xiaqing Du, Zidong Guo, Qi University of Science and Technology of China Hefei China State Key Lab of Processors Institute of Computing Techology CAS Beijing China Shanghai Innovation Center for Processor Technologies Shanghai China Ministry of Education Key Lab for Big Data and AI in Transportation Beijing Jiaotong University Beijing China

ISBN: (纸本)9798400710773

Accurate and fast timing prediction at early design stages is crucial for achieving timing closure in very-large-scale integration (VLSI) design. Machine learning (ML) based approaches have been widely adopted for timing prediction to pursue both of accuracy and speed. Unfortunately, these approaches fail to fully exploit the layout features which can significantly impact the timing metrics, thus leading to great accuracy degradation. In this paper, we propose LE-Timing, an end-to-end explainable and layout-aware timing prediction approach that can achieve better accuracy by leveraging important layout information. The key insight is that crucial information about coupling capacitance between routing wires can significantly impact timing metrics, and fully exploiting this layout information in the timing prediction model can substantially improve its accuracy. However, efficiently leveraging layout features while maintaining accuracy and interpretability poses three key challenges: node-level layout-graph integration, interpretability and training efficiency. To address these, we further propose three key technologies specially designed for LE-Timing correspondingly, including a layout-encoding net model, an explainable cell model, and an explicit-message-passing scheme. Experimental results on 14 open-source designs with advanced 7-nm technology node demonstrate that LE-Timing achieves R2 score 0.92 for arrival time prediction and represents strong interpretability. © 2024 Copyright is held by the owner/author(s).

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

CLIPURE: PURIFICATION IN LATENT SPACE VIA CLIP FOR ADVERSARIALLY ROBUST ZERO-SHOT CLASSIFICATION

arXiv

引用

arXiv 2025年

作者： Zhang, Mingkun Bi, Keping Chen, Wei Guo, Jiafeng Cheng, Xueqi State Key Lab of AI Safety CAS Key Lab of AI Safety Institute of Computing Technology Chinese Academy of Sciences Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

In this paper, we aim to build an adversarially robust zero-shot image classifier. We ground our work on CLIP, a vision-language pre-trained encoder model that can perform zero-shot classification by matching an image with text prompts "a photo of a .". Purification is the path we choose since it does not require adversarial training on specific attack types and thus can cope with any foreseen attacks. We then formulate purification risk as the KL divergence between the joint distributions of the purification process of denoising the adversarial samples and the attack process of adding perturbations to benign samples, through bidirectional Stochastic Differential Equations (SDEs). The final derived results inspire us to explore purification in the multi-modal latent space of CLIP. We propose two variants for our CLIPure approach: CLIPure-Diff which models the likelihood of images’ latent vectors with the DiffusionPrior module in DaLLE-2 (modeling the generation process of CLIP’s latent vectors), and CLIPure-Cos which models the likelihood with the cosine similarity between the embeddings of an image and "a photo of a.". As far as we know, CLIPure is the first purification method in multi-modal latent space and CLIPure-Cos is the first purification method that is not based on generative models, which substantially improves defense efficiency. We conducted extensive experiments on CIFAR-10, ImageNet, and 13 datasets that previous CLIP-based defense methods used for evaluating zero-shot classification robustness. Results show that CLIPure boosts the SOTA robustness by a large margin, e.g., from 71.7% to 91.1% on CIFAR10, from 59.6% to 72.6% on ImageNet, and 108% relative improvements of average robustness on the 13 datasets over previous SOTA. The code is available at https://***/TMLResearchGroup-cas/CLIPure. Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

IEEE Symposium on High-Performance Computer Architecture

作者： Ziming Yuan Lei Dai Wen Li Jie Zhang Shengwen Liang Ying Wang Cheng Liu Huawei Li Xiaowei Li Jiafeng Guo Peng Wang Renhai Chen Gong Zhang State Key Lab of Processors Institute of Computing TechnologyCAS University of Chinese Academy of Sciences School of Computer and Information Technology Shanxi University School of Computer Science Peking University Zhongguancun National Laboratory Beijing Key Lab of Network Data Science and Technology Institute of Computing Technology CAS Huawei Technologies Co. Ltd. China

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

关键词： Training Quantization (signal) Philosophical considerations Graphics processing units Computer architecture Throughput Vectors User experience System-on-chip Indexes

来源：评论

学校读者我要写书评

暂无评论

A Model-Agnostic Hierarchical Framework Towards Trajectory Prediction

引用

Journal of Computer science and technology 2025年第2期40卷 322-339页

作者： Qian, Tang-Wen Wang, Yuan Xu, Yong-Jun Zhang, Zhao Wu, Lin Qiu, Qiang Wang, Fei Domain-Oriented Intelligent System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100190 China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Predicting the future trajectories of multiple agents is essential for various applications in real life, such as surveillance systems, autonomous driving, and social robots. The trajectory prediction task is influenced by many factors, including the individual historical trajectory, interactions between agents, and the fuzzy nature of the observed agents’ motion. While existing methods have made great progress on the topic of trajectory prediction, they treat all the information uniformly, which limits the effectiveness of information utilization. To this end, in this paper, we propose and utilize a model-agnostic framework to regard all the information in a two-level hierarchical view. Particularly, the first-level view is the inter-trajectory view. In this level, we observe that the difficulty in predicting different trajectory samples varies. We define trajectory difficulty and train the proposed framework in an "easy-to-hard" schema. The second-level view is the intra-trajectory level. We find the influencing factors for a particular trajectory can be divided into two parts. The first part is global features, which keep stable within a trajectory, i.e., the expected destination. The second part is local features, which change over time, i.e., the current position. We believe that the two types of information should be handled in different ways. The hierarchical view is beneficial to take full advantage of the information in a fine-grained way. Experimental results validate the effectiveness of the proposed model-agnostic framework. © institute of computing technology, Chinese Academy of sciences 2025.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

TrustRAG: An Information Assistant with Retrieval Augmented Generation

arXiv

引用

arXiv 2025年

作者： Fan, Yixing Yan, Qiang Wang, Wenshan Guo, Jiafeng Zhang, Ruqing Cheng, Xueqi Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Retrieval-Augmented Generation (RAG) has emerged as a crucial technique for enhancing large models with real-time and domain-specific knowledge. While numerous improvements and open-source tools have been proposed to refine the RAG framework for accuracy, relatively little attention has been given to improving the trustworthiness of generated results. To address this gap, we introduce TrustRAG, a novel framework that enhances RAG from three perspectives: indexing, retrieval, and generation. Specifically, in the indexing stage, we propose a semantic-enhanced chunking strategy that incorporates hierarchical indexing to supplement each chunk with contextual information, ensuring semantic completeness. In the retrieval stage, we introduce a utility-based filtering mechanism to identify high-quality information, supporting answer generation while reducing input length. In the generation stage, we propose fine-grained citation enhancement, which detects opinion-bearing sentences in responses and infers citation relationships at the sentence-level, thereby improving citation accuracy. We open-source the TrustRAG framework and provide a demonstration studio designed for excerpt-based question answering tasks 1. Based on these, we aim to help researchers: 1) systematically enhancing the trustworthiness of RAG systems and (2) developing their own RAG systems with more reliable outputs. © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：