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

61st Annual Meeting of the Association for Computational Linguistics, ACL 2023

作者： Hu, Beizhe Sheng, Qiang Cao, Juan Zhu, Yongchun Wang, Danding Wang, Zhengjia Jin, Zhiwei Key Lab of Intelligent Information Processing Chinese Academy of Sciences Institute of Computing Technology China University of Chinese Academy of Sciences China ZhongKeRuijian Technology Co. Ltd. China

ISBN: (纸本)9781959429685

Fake news detection has been a critical task for maintaining the health of the online news ecosystem. However, very few existing works consider the temporal shift issue caused by the rapidly-evolving nature of news data in practice, resulting in significant performance degradation when training on past data and testing on future data. In this paper, we observe that the appearances of news events on the same topic may display discernible patterns over time, and posit that such patterns can assist in selecting training instances that could make the model adapt better to future data. Specifically, we design an effective framework FTT (Forecasting Temporal Trends), which could forecast the temporal distribution patterns of news data and then guide the detector to fast adapt to future distribution. Experiments on the real-world temporally split dataset demonstrate the superiority of our proposed framework. The code is available at https://***/ICTMCG/FTT-ACL23. © ACL *** rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

End States Guided Matching Network for Retrieval-based Multi-turn Conversation 3

End States Guided Matching Network for Retrieval-based Multi...

引用

2021年第三届先进计算机技术、信息科学与通信国际会议(CTISC2021)

作者： Weixin Tan Dandan Song Yujin Gao Lab of High Volume language Information Processing & Cloud Computing Beijing Lab of Intelligent Information TechnologyBeijing Institute of Technology

ISBN: (纸本)9781665418683

Multi-turn conversation response selection aims to choose the best response from multiple candidates based on matching it with the dialogue context. Mostly, a response full of context-related information tends to be a proper ***, in some cases, a brief response like "ok" could be the more appropriate one. We find that it is a semantically ended conversation that a brief response usually comes after,so there is no need to provide any context-related information after that. Thus, in addition to match the response with context,it is also critical to recognize the state of whether a dialogue has ended, and learn how to get necessary information from context of different end states separately. To achieve this, we propose an end states guided matching network to determine and incorporate the end states by jointly consider the length of response and the local similarity between the response and last few utterances. In addition, we adopt multiple descriptive sequence representations for a more reliable matching *** results demonstrate that our model outperforms the state-of-the-art methods in multiple datasets.

关键词： information science Computational modeling Computer network reliability Reliability Data mining

来源：评论

学校读者我要写书评

暂无评论

DMSS:An Attention-Based Deep Learning Model for High-Quality Mass Spectrometry Prediction

引用

Big Data Mining and Analytics 2024年第3期7卷 577-589页

作者： Yihui Ren Yu Wang Wenkai Han Yikang Huang Xiaoyang Hou Chunming Zhang Dongbo Bu Xin Gao Shiwei Sun Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190Chinaand with University of Chinese Academy of SciencesBeijing 100049China Syneron Technology Guangzhou 510000China College of Information and Electrical Engineering China Agricultural UniversityBeijing 100083China Computer Science Program ComputerElectrical and Mathematical Sciences and Engineering DivisionKing Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Kingdom of Saudi Arabia Insitute of Computing Technology Chinese Academy of SciencesBeijing 100190China with Western Institute of Computing Technology Chongqing 400000China

Accurate prediction of peptide spectra is crucial for improving the efficiency and reliability of proteomic analysis,as well as for gaining insight into various biological *** this study,we introduce Deep MS Simulator(DMSS),a novel attention-based model tailored for forecasting theoretical spectra in mass *** has undergone rigorous validation through a series of experiments,consistently demonstrating superior performance compared to current methods in forecasting theoretical *** superior ability of DMSS to distinguish extremely similar peptides highlights the potential application of incorporating our predicted intensity information into mass spectrometry search engines to enhance the accuracy of protein *** findings contribute to the advancement of proteomics analysis and highlight the potential of the DMSS as a valuable tool in the field.

关键词： mass spectrometry proteomics machine learning deep learning

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural information processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is available at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Nested relation extraction with iterative neural network

引用

Frontiers of Computer Science 2021年第3期15卷 109-122页

作者： Yixuan CAO Dian CHEN Zhengqi XU Hongwei LI Ping LUO Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

Most existing researches on relation extraction focus on binary flat relations like Bomln relation between a Person and a *** a large portion of objective facts de-scribed in natural language are complex,especially in professional documents in fields such as finance and biomedicine that require precise *** example,“the GDP of the United States in 2018 grew 2.9%compared with 2017”describes a growth rate relation between two other relations about the economic index,which is beyond the expressive power of binary flat ***,we propose the nested relation extraction problem and formulate it as a directed acyclic graph(DAG)structure extraction ***,we propose a solution using the Iterative Neural Network which extracts relations layer by *** proposed solution achieves 78.98 and 97.89 FI scores on two nested relation extraction tasks,namely semantic cause-and-efFect relation extraction and formula ***,we observe that nested relations are usually expressed in long sentences where entities are mentioned repetitively,which makes the annotation difficult and ***,we extend our model to incorporate a mention-insensitive mode that only requires annotations of relations on entity concepts(instead of exact mentions)while preserving most of its *** mention-insensitive model performs better than the mention sensitive model when the random level in mention selection is higher than 0.3.

关键词： nested relation extraction mention insensitive relation iterative neural network

来源：评论

学校读者我要写书评

暂无评论

Trajectory diffusion for objectgoal navigation 24

Trajectory diffusion for objectgoal navigation

引用

Proceedings of the 38th International Conference on Neural information processing Systems

作者： Xinyao Yu Sixian Zhang Xinhang Song Xiaorong Qin Shuqiang Jiang Key Lab of Intelligent Information Processing Laboratory of the Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing and University of Chinese Academy of Sciences Beijing Key Lab of Intelligent Information Processing Laboratory of the Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing and University of Chinese Academy of Sciences Beijing and Institute of Intelligent Computing Technology Suzhou CAS

ISBN: (纸本)9798331314385

Object goal navigation requires an agent to navigate to a specified object in an unseen environment based on visual observations and user-specified goals. Human decision-making in navigation is sequential, planning a most likely sequence of actions toward the goal. However, existing ObjectNav methods, both end-to-end learning methods and modular methods, rely on single-step planning. They output the next action based on the current model input, which easily overlooks temporal consistency and leads to myopic planning. To this end, we aim to learn sequence planning for ObjectNav. Specifically, we propose trajectory diffusion to learn the distribution of trajectory sequences conditioned on the current observation and the goal. We utilize DDPM and automatically collected optimal trajectory segments to train the trajectory diffusion. Once the trajectory diffusion model is trained, it can generate a temporally coherent sequence of future trajectory for agent based on its current observations. Experimental results on the Gibson and MP3D datasets demonstrate that the generated trajectories effectively guide the agent, resulting in more accurate and efficient navigation. The code is available at https://***/sx-zhang/***.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis of Optical Neural Networks with Non-Ideal Signal Transmission

SSRN

引用

SSRN 2024年

作者： Xie, Yiyuan Fu, Pengju Su, Ye Ye, Yichen Chai, Junxiong Jiang, Xiao Yang, Hongyu College of Electronic and Information Engineering Southwest University Chongqing China Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing China Key Laboratory of Networks and Cloud Computing Security of Universities Chongqing China

Machine learning plays a significant role in various fields. As a fundamental part of machine learning, matrix operations are one of the most important computational parts of neural networks. However, the advancement of Moore’s law is hindered by limitations in the number and size of transistors on electronic chips. Therefore, the implementation of optical neural network (ONN) using photonic devices to accomplish matrix-vector multiplication (MVM) has attracted significant attention. Compared with traditional electrical on neural networks, ONN exhibits faster computational speed, higher parallel input capability and greater energy efficiency. Nevertheless, crosstalk and signal loss are inevitable characteristics in optical signal transmission, which can degrade the performance of ONN. In this paper, we present analysis models and simulations to assess the effects of crosstalk and loss on optical computing systems. We have observed that the accuracy of ONN degrades when crosstalk and loss are present. In severe cases, ONN is unable to complete the classification task. To mitigate the interference of crosstalk, we have designed a novel double-layer structure to reduce the number of optical devices required for signal transmission and optimize the impact of crosstalk on ONN performance. For the identical classification task, the ONN based on a double-layer structure exhibits better interference immunity than the generic ONN, with a 10% performance improvement. In particular, performance is improved by 50% when only crosstalk is considered. © 2024, The Authors. All rights reserved.

关键词： Crosstalk

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis of Optical Neural Networks with Non-Ideal Signal Transmission

SSRN

引用

SSRN 2024年

作者： Fu, Pengju Xie, Yiyuan Su, Ye Ye, Yichen Chai, Junxiong Jiang, Xiao Yang, Hongyu College of Electronic and Information Engineering Southwest University Chongqing China Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing China Key Laboratory of Networks and Cloud Computing Security of Universities Chongqing China

关键词： Crosstalk

来源：评论

学校读者我要写书评

暂无评论

Why Not Look One Step Ahead in Reinforcement Learning Based Knowledge Graph Reasoning?

SSRN

引用

SSRN 2024年

作者： Wang, Hao Song, Dandan Wu, Zhijing Tian, YuHang Xu, Jing Laboratory of High-Volume Language Information Processing and Cloud Computing Beijing Lab of Intelligent Information Technology School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China

Multi-hop reasoning is an effective and explainable method for query answering to improve interpretability by finding reasoning paths over knowledge graphs (KGs). Recent studies apply reinforcement learning-based (RL-based) methods with policy agents to solve this problem. However, they only focus on the sequential reasoning paths and the candidate nodes regardless of the local information of adjacency subgraphs and the semantic correlations between relations in every decision step. In this paper, we propose an RL-based multi-hop reasoning model, Look One Step Ahead (LOSA), which regards more expressive adjacency subgraphs rather than nodes as candidate actions and pays attention to the semantic correlations between relations. Specifically, an adjacency aggregation module encodes the information of subgraphs and transmits the encoding to the policy network to help make decisions, which can reduce backtracking and alleviate sparse-reward issues. Furthermore, a semantic matching module is designed to stress the semantic correlations of relations to improve the rationality of the reasoning paths. Extensive experiments on benchmark datasets demonstrate the effectiveness of the proposed approach. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

ETS: An Error Tolerable System for Coreference Resolution 15

ETS: An Error Tolerable System for Coreference Resolution

引用

15th Conference on Computational Natural Language Learning, CoNLL 2011

作者： Xiong, Hao Song, Linfeng Meng, Fandong Liu, Yang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing100190 China

ISBN: (纸本)9781937284084

This paper presents our error tolerable system for coreference resolution in CoNLL-2011(Pradhan et al., 2011) shared task (closed track). Different from most previous reported work, we detect mention candidates based on packed forest instead of single parse tree, and we use beam search algorithm based on the Bell Tree to create entities. Experimental results show that our methods achieve promising results on the development set. © 2011 Association for Computational Linguistics

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：