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

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Dam, Tuan Klink, Pascal D'Eramo, Carlo Peters, Jan Pajarinen, Joni Department of Computer Science Technische Universität Darmstadt Germany Robot Learning Group Max Planck Institute for Intelligent Systems Tübingen Germany Computing Sciences Tampere University Finland

ISBN: (纸本)9780999241165

We consider Monte-Carlo Tree Search (MCTS) applied to Markov Decision Processes (MDPs) and Partially Observable MDPs (POMDPs), and the well-known Upper Confidence bound for Trees (UCT) algorithm. In UCT, a tree with nodes (states) and edges (actions) is incrementally built by the expansion of nodes, and the values of nodes are updated through a backup strategy based on the average value of child nodes. However, it has been shown that with enough samples the maximum operator yields more accurate node value estimates than averaging. Instead of settling for one of these value estimates, we go a step further proposing a novel backup strategy which uses the power mean operator, which computes a value between the average and maximum value. We call our new approach Power-UCT, and argue how the use of the power mean operator helps to speed up the learning in MCTS. We theoretically analyze our method providing guarantees of convergence to the optimum. Finally, we empirically demonstrate the effectiveness of our method in well-known MDP and POMDP benchmarks, showing significant improvement in performance and convergence speed w.r.t. state of the art algorithms. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Generic Properties of Koopman Eigenfunctions for Stable Fixed Points and Periodic Orbits ⁎ ⁎

引用

IFAC-PapersOnLine 2021年第9期54卷 267-272页

作者： Matthew D. Kvalheim David Hong Shai Revzen Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia PA 19104 USA Department of Statistics University of Pennsylvania Philadelphia PA 19104 USA Department of Electrical Engineering and Computer Science Ecology and Evolutionary Biology Department Robotics Institute University of Michigan Ann Arbor MI 48109

Our recent work established existence and uniqueness results for C k (actually C k,α loc ) linearizing semiconjugacies for C flows defined on the entire basin of an attracting hyperbolic fixed point or periodic orbit (Kvalheim and Revzen, 2019). Applications include (i) improvements, such as uniqueness statements, for the Sternberg linearization and Floquet normal form theorems, and (ii) results concerning the existence, uniqueness, classification, and convergence of various quantities appearing in the “applied Koopmanism” literature, such as principal eigenfunctions, isostables, and Laplace averages. In this work we consider the broadness of applicability of these results with an emphasis on the Koopmanism applications. In particular we show that, for the flows of “typical” c ∞ vector fields having an attracting hyperbolic fixed point or periodic orbit with a fixed basin of attraction, the c ∞ Koopman eigenfunctions can be completely classified, generalizing a result known for analytic eigenfunctions of analytic systems.

关键词： Koopman operator eigenfunctions generic properties isostables periodic orbits

来源：评论

学校读者我要写书评

暂无评论

Awareness in robotics: An early perspective from the viewpoint of the EIC Pathfinder Challenge "Awareness Inside"

arXiv

引用

arXiv 2024年

作者： Santina, Cosimo Della Corbato, Carlos Hernandez Sisman, Burak Leiva, Luis A. Arapakis, Ioannis Vakalellis, Michalis Vanderdonckt, Jean D’Haro, LuisFernando Manzi, Guido Becchio, Cristina Elamrani, Aïda Alirezaei, Mohsen Castellano, Ginevra Dimarogonas, Dimos V. Ghosh, Arabinda Haesaert, Sofie Soudjani, Sadegh Stroeve, Sybert Verschure, Paul Bacciu, Davide Deroy, Ophelia Bahrami, Bahador Gallicchio, Claudio Hauert, Sabine Sanz, Ricardo Lanillos, Pablo Iacca, Giovanni Sigg, Stephan Gasulla, Manel Steels, Luc Sierra, Carles Department of Cognitive Robotics Delft University of Technology Delft Netherlands Oberpfaffenhofen Germany Department of Computer Science University of Luxembourg Luxembourg 4 Telefónica I+D Spain AEGIS IT Research GmbH Germany Université catholique de Louvain Belgium Speech Technology and Machine Learning Group ETSI de Telecomunicación Universidad Politécnica de Madrid Madrid Spain Alien Venture Studio Alien Technology Transfer Rome Italy Hamburg Germany Institut Jean Nicod École Normale Supérieure Paris France Research Technology and Development Department Digital Industry Software Helmond Netherlands Department of Information Technology Uppsala University Uppsala Sweden Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Max Planck Institute for Software Systems Kaiserslautern Germany Department of Electrical Engineering Control Systems Group Eindhoven University of Technology Eindhoven Netherlands Amsterdam Netherlands Donders Centre for Neuroscience Radboud University Nijmegen Netherlands Computer Science Department University of Pisa Pisa Italy Faculty of Philosophy Philosophy of Science The Study of Religion Ludwig Maximilian University of Munich Munich Germany School of Engineering Mathematics and Technology University of Bristol Bristol United Kingdom Autonomous Systems Laboratory Universidad Politécnica de Madrid Spain Madrid Spain Department of Information Engineering and Computer Science University of Trento Trento Italy Department of Information and Communications Engineering Aalto University Espoo Finland Department of Electronic Engineering Universitat Politècnica de Catalunya Barcelona Spain Studio Stelluti Brussels Belgium Barcelona Spain

Consciousness has been historically a heavily debated topic in engineering, science, and philosophy. On the contrary, awareness had less success in raising the interest of scholars in the past. However, things are changing as more and more researchers are getting interested in answering questions concerning what awareness is and how it can be artificially generated. The landscape is rapidly evolving, with multiple voices and interpretations of the concept being conceived and techniques being developed. The goal of this paper is to summarize and discuss the ones among these voices that are connected with projects funded by the EIC Pathfinder Challenge called "Awareness Inside", a nonrecurring call for proposals within Horizon Europe that was designed specifically for fostering research on natural and synthetic awareness. In this perspective, we dedicate special attention to challenges and promises of applying synthetic awareness in robotics, as the development of mature techniques in this new field is expected to have a special impact on generating more capable and trustworthy embodied systems. © 2024, CC BY.

关键词： robotics

来源：评论

学校读者我要写书评

暂无评论

Algorithmic recourse under imperfect causal knowledge: A probabilistic approach 34

Algorithmic recourse under imperfect causal knowledge: A pro...

引用

34th Conference on Neural Information Processing systems, NeurIPS 2020

作者： Karimi, Amir-Hossein von Kügelgen, Julius Schölkopf, Bernhard Valera, Isabel Max Planck Institute for Intelligent Systems Tübingen Germany Max Planck ETH Center for Learning Systems Zürich Switzerland Department of Engineering University of Cambridge United Kingdom Department of Computer Science Saarland University Saarbrücken Germany

Recent work has discussed the limitations of counterfactual explanations to recommend actions for algorithmic recourse, and argued for the need of taking causal relationships between features into consideration. Unfortunately, in practice, the true underlying structural causal model is generally unknown. In this work, we first show that it is impossible to guarantee recourse without access to the true structural equations. To address this limitation, we propose two probabilistic approaches to select optimal actions that achieve recourse with high probability given limited causal knowledge (e.g., only the causal graph). The first captures uncertainty over structural equations under additive Gaussian noise, and uses Bayesian model averaging to estimate the counterfactual distribution. The second removes any assumptions on the structural equations by instead computing the average effect of recourse actions on individuals similar to the person who seeks recourse, leading to a novel subpopulation-based interventional notion of recourse. We then derive a gradient-based procedure for selecting optimal recourse actions, and empirically show that the proposed approaches lead to more reliable recommendations under imperfect causal knowledge than non-probabilistic baselines. © 2020 Neural information processing systems foundation. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Counterfactual mean embeddings

引用

The Journal of Machine Learning Research 2021年第1期22卷 7322-7392页

作者： Krikamol Muandet Motonobu Kanagawa Sorawit Saengkyongam Sanparith Marukatat Max Planck Institute for Intelligent Systems Tübingen Germany Data Science Department EURECOM Sophia Antipolis France University of Copenhagen Copenhagen Denmark National Electronics and Computer Technology Center National Science and Technology Development Agency Pathumthani Thailand

Counterfactual inference has become a ubiquitous tool in online advertisement, recommendation systems, medical diagnosis, and econometrics. Accurate modelling of outcome distributions associated with different interventions--known as counterfactual distributions--is crucial for the success of these applications. In this work, we propose to model counterfactual distributions using a novel Hilbert space representation called counterfactual mean embedding (CME). The CME embeds the associated counterfactual distribution into a reproducing kernel Hilbert space (RKHS) endowed with a positive definite kernel, which allows us to perform causal inference over the entire landscape of the counterfactual distribution. Based on this representation, we propose a distributional treatment effect (DTE) which can quantify the causal effect over entire outcome distributions. Our approach is nonparametric as the CME can be estimated under the unconfoundedness assumption from observational data without requiring any parametric assumption about the underlying distributions. We also establish a rate of convergence of the proposed estimator which depends on the smoothness of the conditional mean and the Radon-Nikodym derivative of the underlying marginal distributions. Furthermore, our framework allows for more complex outcomes such as images, sequences, and graphs. Our experimental results on synthetic data and off-policy evaluation tasks demonstrate the advantages of the proposed estimator.

关键词： counterfactual inference kernel mean embedding potential outcome framework reproducing kernel Hilbert space causality

来源：评论

学校读者我要写书评

暂无评论

Text Mining in the Domain of Plant Genetic Resources 10

Text Mining in the Domain of Plant Genetic Resources

引用

10th IEEE International Conference on intelligent systems, IS 2020

作者： Popchev, Ivan Orozova, Daniela Bulgarian Academy of Sciences Intelligent Systems Department Institute of Information and Communication Technologies Sofia Bulgaria Burgas Free University Institute of Information and Communication Technologies Bulgarian Academy of Sciences Faculty of Computer Science Sofia Bulgaria

ISBN: (纸本)9781728154565

Upcoming is the construction of informational and social spaces which integrate heterogeneous technologies and various approaches to the collection, storage and processing of information related to the plant genetic resources of Bulgaria. In the present paper a multistage algorithm for automatic analysis of documents from the area of plant genetic resources is proposed. Determination of the significant words in the document and the type of its content is carried out based on the object-oriented ontologies in the field. By applying software instruments for classification, testing and evaluation, the documents are classified into related and not related to the studied subject area- A griculture and plant genetic resources of Bulgaria. © 2020 IEEE.

关键词： intelligent systems

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2023 Image Shadow Removal Challenge Report

NTIRE 2023 Image Shadow Removal Challenge Report

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Vasluianu, Florin-Alexandru Seizinger, Tim Timofte, Radu Cui, Shuhao Huang, Junshi Tian, Shuman Fan, Mingyuan Zhang, Jiaqi Zhu, Li Wei, Xiaoming Wei, Xiaolin Luo, Ziwei Gustafsson, Fredrik K. Zhao, Zheng Sjölund, Jens Schön, Thomas B. Dong, Xiaoyi Zhang, Xi Sheryl Li, Chenghua Leng, Cong Yeo, Woon-Ha Oh, Wang-Taek Lee, Yeo-Reum Ryu, Han-Cheol Luo, Jinting Jiang, Chengzhi Han, Mingyan Wu, Qi Lin, Wenjie Yu, Lei Li, Xinpeng Jiang, Ting Fan, Haoqiang Liu, Shuaicheng Xu, Shuning Song, Binbin Chen, Xiangyu Zhang, Shile Zhou, Jiantao Zhang, Zhao Zhao, Suiyi Zheng, Huan Gao, Yangcheng Wei, Yanyan Wang, Bo Ren, Jiahuan Luo, Yan Kondo, Yuki Miyata, Riku Yasue, Fuma Naruki, Taito Ukita, Norimichi Chang, Hua-En Yang, Hao-Hsiang Chen, Yi-Chung Chiang, Yuan-Chun Huang, Zhi-Kai Chen, Wei-Ting Chen, I-Hsiang Hsieh, Chia-Hsuan Kuo, Sy-Yen Xianwei, Li Fu, Huiyuan Liu, Chunlin Ma, Huadong Fu, Binglan He, Huiming Wang, Mengjia She, Wenxuan Liu, Yu Nathan, Sabari Kansal, Priya Zhang, Zhongjian Yang, Huabin Wang, Yan Zhang, Yanru Phutke, Shruti S. Kulkarni, Ashutosh Khan, Md Raqib Murala, Subrahmanyam Vipparthi, Santosh Kumar Ye, Heng Liu, Zixi Yang, Xingyi Liu, Songhua Wu, Yinwei Jing, Yongcheng Yu, Qianhao Zheng, Naishan Huang, Jie Long, Yuhang Yao, Mingde Zhao, Feng Zhao, Bowen Ye, Nan Shen, Ning Cao, Yanpeng Xiong, Tong Xia, Weiran Li, Dingwen Xia, Shuchen Computer Vision Lab Ifi Caidas University of Würzburg Germany Computer Vision Lab Eth Zürich Switzerland Meituan Group China Department of Information Technology Uppsala University Sweden Institute of Automation Chinese Academy of Sciences Beijing China Nanjing China Maicro Nanjing China Department of Artificial Intelligence Convergence Sahmyook University Seoul Korea Republic of Megvii Technology China University of Electronic Science and Technology of China China University of Macau China China Toyota Technological Institute Japan Graduate Institute of Electronics Engineering National Taiwan University Taiwan Department of Electrical Engineering National Taiwan University Taiwan Graduate Institute of Communication Engineering National Taiwan University Taiwan ServiceNow United States Beijing University of Post and Teleconmunication Beijing China Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education China Couger Inc. Computer Vision and Pattern Recognition Lab Indian Institute of Technology Ropar Punjab Rupnagar India Research Institute Singapore National University of Singapore Singapore Research Institute Singapore University of Sydney Australia Brain-Inspired Vision Laboratory Information Science and Technology Institution University of Science and Technology of China China State Key Laboratory of Fluid Power and Mechatronic Systems School of Mechanical Engineering Zhejiang University Hangzhou310027 China Key Laboratory of Advanced Manufacturing Technology of Zhejiang Province School of Mechanical Engineering Zhejiang University Hangzhou310027 China South China University of Technology China

ISBN: (纸本)9798350302493

This work reviews the results of the NTIRE 2023 Challenge on Image Shadow Removal. The described set of solutions were proposed for a novel dataset, which captures a wide range of object-light interactions. It consists of 1200 roughly pixel aligned pairs of real shadow free and shadow affected images, captured in a controlled environment. The data was captured in a white-box setup, using professional equipment for lights and data acquisition sensors. The challenge had a number of 144 participants registered, out of which 19 teams were compared in the final ranking. The proposed solutions extend the work on shadow removal, improving over the performance level describing state-of-the-art methods. © 2023 IEEE.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2024年

作者： Ren, Yingying Li, Qiuli Guo, Yangyang Pedrycz, Witold Xing, Lining Liu, Anfeng Song, Yanjie School of Computer Electronics and Information Guangxi University Nanning China Guangxi Key Laboratory of Multimedia Communications and Network Technology China Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University China School of Systems Science Beijing Jiaotong University Beijing China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Poland Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer Istanbul Turkey School of Electronic Engineering Xidian University Xian China School of Electronic Engineering Central South University Changsha China National Engineering Research Center of Maritime Navigation System Dalian Maritime University Dalian China

With the rapid development of the satellite industry, the information transmission network based on communication satellites has gradually become a major and important part of the future satellite ground integration network. However, the low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system and needs to be solved urgently. Effectively planning the task of satellite ground networking by reasonably scheduling resources is crucial for the efficient transmission of task data. In this paper, we hope to provide a task execution scheme that maximizes the profit of the networking task for satellite ground network planning considering feeding mode (SGNPFM). To solve the SGNPFM problem, a mixed-integer planning model with the objective of maximizing the gain of the link-building task is constructed, which considers various constraints of the satellite in the feed-switching mode. Based on the problem characteristics, we propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks. To obtain more high-quality solutions, different similarity evaluation methods are designed to assist the algorithm in intelligently screening individuals. The DSGAalso uses an adaptive crossover strategy based on similarity mechanism, which guides the algorithm to achieve efficient population search. In addition, a task scheduling algorithm considering the feed-switching mode is designed for decoding the algorithm to generate a highquality scheme. The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem. Compared to other algorithms, the proposed algorithm not only obtains higher quality planning schemes but also has faster algorithm convergence speed. The proposed algorithm improves data trans

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Convolutional Neural Networks with Gated Recurrent Connections

arXiv

引用

arXiv 2021年

作者： Wang, Jianfeng Hu, Xiaolin the Computer Science Department University of Oxford Oxfordshire United Kingdom the Institute for Artificial Intelligence the State Key Laboratory of Intelligent Technology and Systems Beijing National Research Center for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing100084 China

The convolutional neural network (CNN) has become a basic model for solving many computer vision problems. In recent years, a new class of CNNs, recurrent convolution neural network (RCNN), inspired by abundant recurrent connections in the visual systems of animals, was proposed. The critical element of RCNN is the recurrent convolutional layer (RCL), which incorporates recurrent connections between neurons in the standard convolutional layer. With increasing number of recurrent computations, the receptive fields (RFs) of neurons in RCL expand unboundedly, which is inconsistent with biological facts. We propose to modulate the RFs of neurons by introducing gates to the recurrent connections. The gates control the amount of context information inputting to the neurons and the neurons’ RFs therefore become adaptive. The resulting layer is called gated recurrent convolution layer (GRCL). Multiple GRCLs constitute a deep model called gated RCNN (GRCNN). The GRCNN was evaluated on several computer vision tasks including object recognition, scene text recognition and object detection, and obtained much better results than the RCNN. In addition, when combined with other adaptive RF techniques, the GRCNN demonstrated competitive performance to the state-of-the-art models on benchmark datasets for these tasks. The codes are released at https://***/Jianf-Wang/GRCNN. © 2021, CC BY.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

The impact of ground control points for the 3D study of grapevines in steep slope vineyards

引用

Procedia computer science 2024年 239卷 2301-2307页

作者： Oiliam Stolarski José Martinho Lourenço Emanuel Peres Raul Morais Joaquim J. Sousa Luís Pádua Centre for the Research and Technology of Agro-Environmental and Biological Sciences (CITAB) University of Trás-os-Montes e Alto Douro (UTAD) 5000-801 Vila Real Portugal Departamento de Geologia e Pólo do Centro de Geociências (CGeo) UTAD 5000-801 Vila Real Portugal Engineering Department School of Science and Technology UTAD 5000-801 Vila Real Portugal Institute for Innovation Capacity Building and Sustainability of Agri-Food Production UTAD 5000-801 Vila Real Portugal Centre for Robotics in Industry and Intelligent Systems (CRIIS) INESC Technology and Science (INESC-TEC) 4200-465 Porto Portugal

Data acquisition through unmanned aerial vehicles (UAVs) has become integral to the study of agricultural crops, especially for multitemporal analyses spanning the entire growing season. Ensuring accurate data alignment is essential not only to maintain data quality but also to leverage the continuous monitoring of the same area over time. Ground control points (GCPs) play a critical role in geolocating UAV data. Their absence can lead to planimetric and altimetric discrepancies, which are particularly impactful in 3D plant-level studies. This study is centered on the examination of misalignment effects in a challenging steep slope vineyard environment and their impacts on 3D alignment accuracy. For this purpose, a UAV equipped with an RGB camera to capture imagery at two distinct flight heights. Various scenarios, each involving a different number of GCPs, were assessed to evaluate their impact on alignment precision. The methodology employed holds potential for assessing geolocation accuracy in complex 3D environments, providing value insights for vineyard monitoring.

关键词： unmanned aerial vehicles photogrammetric processing point clouds geolocation precision viticulture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：