Andere Kunden interessierten sich auch für
![Social Network Analysis: An Introduction with an Extensive Implementation to a Large-Scale Online Network Using Pajek]( "Social Network Analysis: An Introduction with an Extensive Implementation to a Large-Scale Online Network Using Pajek")
Social Network Analysis: An Introduction with an Extensive Implementation to a Large-Scale Online Network Using Pajek77,99 €![Learning Tensorflow]( "Learning Tensorflow")
Learning Tensorflow49,99 €![Optimizing data collection in warzones]( "Optimizing data collection in warzones")
Optimizing data collection in warzones25,99 €![Domain Transfer Learning With 3Q Data Processing]( "Domain Transfer Learning With 3Q Data Processing")
Domain Transfer Learning With 3Q Data Processing29,99 €![Tensor Networks for Dimensionality Reduction and Large-scale Optimization]( "Tensor Networks for Dimensionality Reduction and Large-scale Optimization")
Tensor Networks for Dimensionality Reduction and Large-scale Optimization125,99 €![Large-scale 3D Data Integration]( "Large-scale 3D Data Integration")
Large-scale 3D Data Integration92,99 €![21 Recipes for Mining Twitter]( "21 Recipes for Mining Twitter")
21 Recipes for Mining Twitter32,99 €
Reinforcement learning (RL) is concerned with learning to take actions to maximize rewards, by trial and error, in environments that can evolve in response to actions. A Markov decision process (MDP) [6] is a popular framework to model decision making in RL environments. In the MDP, starting from an initial observed state, an agent repeatedly (a) takes an action, (b) receives a reward, and (c) observes the next state of the MDP. The traditional objective in RL is a search goal - find a policy (a rule to select an action for each state) with high total reward using as few interactions with the environment as possible, known as the sample complexity of RL problem [7]. This is, however, quite different from the corresponding optimization goal, where the learner seeks to maximize the total reward earned from all its decisions, or equivalently, minimize the regret or shortfall in total reward compared to that of an optimal policy [8]. This objective is relevant in many practical sequential decision-making settings in which every decision that is taken carries utility or value - recommendation systems (clicks by consumers translate into revenue), sequential investment and portfolio allocation (financial holdings make profits or losses), dynamic resource allocation in communication systems scheduling decisions affect data throughput), to name a few.