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

arXiv 2023年

作者： Xiao, Yubin Wang, Di Li, Boyang Chen, Huanhuan Pang, Wei Wu, Xuan Li, Hao Xu, Dong Liang, Yanchun Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The School of Computer Science University of Science & Technology of China Hefei230026 China The School of Mathematical and Computer Sciences Heriot-Watt University EdinburghEH14 4AS United Kingdom College of Computer National University of Defense Technology Hunan Changsha410073 China The Department of Electrical Engineering and Computer Science Bond Life Sciences Center University of Missouri Columbia United States The School of Computer Science Zhuhai College of Science and Technology Zhuhai519000 China

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced reinforcement learning strategy. To the best of our knowledge, NAR4TSP is the first TSP solver that successfully combines RL and NAR networks. The key lies in the incorporation of NAR network output decoding into the training process. NAR4TSP efficiently represents TSP encoded information as rewards and seamlessly integrates it into reinforcement learning strategies, while maintaining consistent TSP sequence constraints during both training and testing phases. Experimental results on both synthetic and real-world TSPs demonstrate that NAR4TSP outperforms five state-of-the-art models in terms of solution quality, inference speed, and generalization to unseen scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Attention-based multi-level feature fusion for named entity recognition 29

Attention-based multi-level feature fusion for named entity ...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Yang, Zhiwei Chen, Hechang Zhang, Jiawei Ma, Jing Chang, Yi College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China IFM Lab Department of Computer Science Florida State University TallahasseeFL United States Department of Computer Science Hong Kong Baptist University Hong Kong Hong Kong Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China International Center of Future Science Jilin University Changchun China

ISBN: (纸本)9780999241165

Named entity recognition (NER) is a fundamental task in the natural language processing (NLP) area. Recently, representation learning methods (e.g., character embedding and word embedding) have achieved promising recognition results. However, existing models only consider partial features derived from words or characters while failing to integrate semantic and syntactic information (e.g., capitalization, inter-word relations, keywords, lexical phrases, etc.) from multi-level perspectives. Intuitively, multi-level features can be helpful when recognizing named entities from complex sentences. In this study, we propose a novel framework called attention-based multi-level feature fusion (AMFF), which is used to capture the multi-level features from different perspectives to improve NER. Our model consists of four components to respectively capture the local character-level, global character-level, local word-level, and global word-level features, which are then fed into a BiLSTM-CRF network for the final sequence labeling. Extensive experimental results on four benchmark datasets show that our proposed model outperforms a set of state-of-the-art baselines. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximation

引用

Frontiers of Computer Science 2019年第1期13卷 106-126页

作者： Shan ZHONG Quan LIU Zongzhang ZHANG Qiming FU School of Computer Science and Technology Soochow UniversitySuzhou 215000China School of Computer Science and Engineering Changshu Institute of TechnologyChangshu 215500China Jiangsu Province Key Laboratory of Intelligent Building Energy Efficiency Suzhou University of Science and TechnologySuzhou 215006China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000China College of Electronic &Information Engineering Suzhou University of Science and TechnologySuzhou 215000China

Dyna is an effective reinforcement learning (RL) approach that combines value function evaluation with model ***,existing works on Dyna mostly discuss only its efficiency in RL problems with discrete action *** paper proposes a novel Dyna variant,called Dyna-LSTD-PA,aiming to handle problems with continuous action ***-LSTD-PA stands for Dyna based on least-squares temporal difference (LSTD)and policy ***-LSTD-PA consists of two simultaneous,interacting *** learning process determines the probability distribution over action spaces using the Gaussian distribution;estimates the underlying value function,policy,and model by linear representation;and updates their parameter vectors online by LSTD(,t).The planning process updates the parameter vector of the value function again by using ofttine LSTD(2).Dyna-LSTD-PA also uses the Sherman-Morrison formula to improve the efficiency of LSTD(,t),and weights the parameter vector of the value function to bring the two processes ***,the global error bound is derived by considering approximation,estimation,and model ***,Dyna-LSTD-PA outperforms two representative methods in terms of convergence rate,success rate,and stability performance on four benchmark RL problems.

关键词： problem solving control methods heuristic search methods dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Error Formulas for Lagrange Projectors Determined by Cartesian Sets

引用

Journal of Systems Science & Complexity 2018年第4期31卷 1090-1102页

作者： LI Zhe ZHANG Shugong DONG Tian GONG Yihe School of Science Changchun University of Science and Technology Changchun 130022 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University Changchun 130012 China Northeast Electric Power University Jilin 132012 China School of Mathematics Jilin University Changchun 130012 China

This paper studies error formulas for Lagrange projectors determined by Cartesian sets. Cartesian sets are properly subgrids of tensor product grids. Given interpolated functions with all order continuous partial derivatives, the authors directly construct the good error formulas for Lagrange projectors determined by Cartesian sets. Owing to the special algebraic structure, such a good error formula is useful for error estimate.

关键词： Cartesian sets error formulas ideal interpolation multivariate polynomial interpolation

来源：评论

学校读者我要写书评

暂无评论

GEOM-GCN: Geometric graph convolutional networks

arXiv

引用

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Curvature regularization to prevent distortion in graph embedding

arXiv

引用

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Zhang, Chunxu Chang, Kevin Chen-Chuan Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China

Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this proximity-preserving strategy: Graph topology patterns, while preserved well into an embedding manifold by preserving proximity, may distort in the ambient embedding Euclidean space, and hence to detect them becomes difficult for machine learning models. To address the problem, we propose curvature regularization, to enforce flatness for embedding manifolds, thereby preventing the distortion. We present a novel angle-based sectional curvature, termed ABS curvature, and accordingly three kinds of curvature regularization to induce flat embedding manifolds during graph embedding. We integrate curvature regularization into five popular proximity-preserving embedding methods, and empirical results in two applications show significant improvements on a wide range of open graph datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

An unmanned aerial vehicle pose estimation system based on SLAM 2

An unmanned aerial vehicle pose estimation system based on S...

引用

2019 2nd International Conference on Advanced Materials, Intelligent Manufacturing and Automation, AMIMA 2019

作者： Dou, Xinglei Huo, Yuzhou Liu, Yongchang Wang, Xin College of Software Engineering Jilin University Changchun Jilin130012 China College of Computer Science and Technology Jilin University Changchun Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Changchun Jilin130012 China

This paper presents an unmanned aerial vehicle (UAV) pose estimation system based on monocular simultaneous localization and mapping (SLAM) guided by the desired shot. The system enables UAV to automatically adjust the pose to achieve a shot close to the desired shot provided by the user. The SLAM module in the system includes ORB feature-based visual odometry and Levenberg-Marquardt method-based optimizer. To ensure the reliability of the camera pose estimation result, the bag of words model is used to select an image which has enough good matches with the desired shot. The experimental results prove that the system is valid and effective. © Published under licence by IOP Publishing Ltd.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Affine-periodic solutions by averaging methods

引用

Science China Mathematics 2018年第3期61卷 439-452页

作者： Jiamin Xing Xue Yang Yong Li College of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Mathematics and Statistics Northeast Normal University Center for Mathematics and Interdisciplinary Sciences Northeast Normal University

This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.

关键词： affine-periodic solutions averaging method topological degree

来源：评论

学校读者我要写书评

暂无评论

Weighted partial order oriented three-way decisions under score-based common voting rules

引用

International Journal of Approximate Reasoning 2020年 123卷 41-54页

作者： Li, Lei Wu, Xindong Chen, Huanhuan Zhou, Chuan Liu, Guanfeng Jiang, Yongkang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230601 China Mininglamp Academy of Sciences Mininglamp Technologies Beijing 100084 China School of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China Computing Dept Macquarie University Sydney A1C 5S7 Australia

Recently, with the trisecting and acting models of human cognitive behaviors, three-way decisions are introduced to deal with uncertain decisions in many applications. To define and conduct the three-way decisions on the possible or necessary loser or co-loser and/or winner or co-winner, we first define the score-based common voting rules, where a score-based function is introduced to evaluate certain utility, including positional scoring rules, maximin, Bucklin, and so on. Then on one hand, it has been proved that under certain conditions three-way decisions on the possible loser or co-loser and/or winner or co-winner are NP-complete with positional scoring rules, maximin, and Bucklin, respectively. On the other hand, we have presented algorithms whose time complexity is polynomial to conduct three-way decisions on the necessary winner or co-winner and/or necessary loser or co-loser with positional scoring rules, maximin, and Bucklin in time O(nm²), O(nm³), and O(nm²), respectively, which has been validated experimentally. © 2020 Elsevier Inc.

关键词： Common voting rules Three-way decisions Weighted partial orders

来源：评论

学校读者我要写书评

暂无评论

Deep neural architecture search with deep graph bayesian optimization

arXiv

引用

arXiv 2019年

作者： Ma, Lizheng Cui, Jiaxu Yang, Bo College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education

Bayesian optimization (BO) is an effective method of finding the global optima of black-box functions. Recently BO has been applied to neural architecture search and shows better performance than pure evolutionary strategies. All these methods adopt Gaussian processes (GPs) as surrogate function, with the handcraft similarity metrics as input. In this work, we propose a Bayesian graph neural network as a new surrogate, which can automatically extract features from deep neural architectures, and use such learned features to fit and characterize black-box objectives and their uncertainty. Based on the new surrogate, we then develop a graph Bayesian optimization framework to address the challenging task of deep neural architecture search. Experiment results show our method significantly outperforms the comparative methods on benchmark tasks. Copyright © 2019, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：