Text editing frames grammatical error correction (GEC) as a sequence tagging problem, where edit tags are assigned to input tokens, and applying these edits results in the corrected text. This approach has gained atte...
详细信息
This paper introduces the Balanced Arabic Readability Evaluation Corpus (BAREC),1 a large-scale, fine-grained dataset for Arabic readability assessment. BAREC consists of 68,182 sentences spanning 1+ million words, ca...
Owing to the interesting physical characteristics of perovskites, herein, we investigate RbZnX3 (X = Cl, Br) halide perovskites for sustainable green energy applications. All the given structures were made relaxed and...
详细信息
There is a vast amount of gene expression data that has been gathered in microarray studies all over the world. Many of these studies use different experimentation plans, different platforms, different methodologies, ...
详细信息
There is a vast amount of gene expression data that has been gathered in microarray studies all over the world. Many of these studies use different experimentation plans, different platforms, different methodologies, etc. Merging information of different studies is an important part of current research in bioinformatics and several algorithms have been proposed recently. There is clearly a need to create large data sets which will allow more statistically relevant analysis in order to obtain more and better results in clinical and medical research. In this article we consistently describe several gene expression data merging techniques and apply them on several cancer microarray data sets.
In this paper we study the potential of using energy aware metrics in reinforcement learning based routing algorithms for wireless sensor networks. This paper contributes with an enhanced version of an existing energy...
详细信息
In this paper we study the potential of using energy aware metrics in reinforcement learning based routing algorithms for wireless sensor networks. This paper contributes with an enhanced version of an existing energy aware algorithm and with a study that tests the influence of combining energy aware metrics with load balancing metrics from delay based Q-routing. We show that our enhanced algorithm can significantly improve the lifetime of a network without requiring any extra information or communication, by propagating energy information beyond direct neighbors throughout the network. Our study also shows that topologies composed from heterogenous nodes can have a significant impact on an algorithm's performance. Furthermore we show that load balancing in routing algorithms can help to improve the network lifetime while only requiring energy information about a node's direct neighbors.
Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The feed-back an agent experiences in a MAS, ...
详细信息
ISBN:
(纸本)9781581136838
Although well understood in the single-agent framework, the use of traditional reinforcement learning (RL) algorithms in multi-agent systems (MAS) is not always justified. The feed-back an agent experiences in a MAS, is usually influenced by the other agents present in the system. Multi agent environments are therefore non-stationary and convergence and optimality guarantees of RL algorithms are lost. To better understand the dynamics of traditional RL algorithms we analyze the learning process in terms of evolutionary dynamics. More specifically we show how the Replicator Dynamics (RD) can be used as a model for Q-learning in games. The dynamical equations of Q-learning are derived and illustrated by some well chosen experiments. Both reveal an interesting connection between the exploitation-exploration scheme from RL and the selection-mutation mechanisms from evolutionary game theory.
Coordination is an important issue in multiagent systems. Within the stochastic game framework this problem translates to policy learning in a joint action space. This technique however suffers some im- portant drawba...
详细信息
This paper provides a novel approach to multi-agent coordination in general-sum Markov games. Contrary to what is common in multi-agent learning, our approach does not focus on reaching a particular equilibrium betwee...
详细信息
This paper provides a novel approach to multi-agent coordination in general-sum Markov games. Contrary to what is common in multi-agent learning, our approach does not focus on reaching a particular equilibrium between agent policies. Instead, it learns a basis set of special joint agent policies, over which it can randomize to build different solutions. The main idea is to tackle a Markov game by decomposing it into a set of multi-agent common interest problems, also called Multi-agent Markov Decision Processes (MMDPs). Each MMDP reflects one agent's preferences in the system. With only a minimum of coordination, simple reinforcement learning agents using Parameterised Learning Automata are able to solve this set of common interest problems in parallel. A third party then selects the MMDP to be played, without a need for the agents to know which problem or reward function they are confronted with. As a result, a team of simple learning agents is able to switch play between desired joint policies rather than mixing individual policies. One application of this principle, which we consider in this paper, is to let simple adaptive agents learn to take turns in generalsum Markov Games in order to satisfy their individual objectives. We experimentally demonstrate this principle in a grid-world setting.
In multi-objective problems, it is key to find compromising solutions that balance different objectives. The linear scalarization function is often utilized to translate the multi-objective nature of a problem into a ...
详细信息
The structure of human memory seems to be optimized for efficient prediction, planning, and behavior. We propose that these capacities rely on a tripartite structure of memory that includes concepts, events, and conte...
详细信息
暂无评论