吴裕雄--天生自然神经网络与深度学习实战Python+Keras+TensorFlow：Bellman函数、贪心算法与增强性学习网络开发实践

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了吴裕雄--天生自然神经网络与深度学习实战Python+Keras+TensorFlow：Bellman函数、贪心算法与增强性学习网络开发实践，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含7267字，纯文字阅读大概需要11分钟。

内容图文

!pip install gym

 

 

import random
import numpy as np
import matplotlib.pyplot as plt
from keras.layers import Dense, Dropout, Activation
from keras.models import Sequential
from keras.optimizers import Adam
from keras import backend as K
from collections import deque
import gym

#选取互动环境
env = gym.make('CartPole-v1')
state = env.reset()

#0或1表示让小车向不同方向移动
action = 0
#step(action)表示想环境发生命令
new_state, reward, done , info = env.step(action)
print((new_state, reward, done, info))

import random
import numpy as np
import matplotlib.pyplot as plt
from keras.layers import Dense, Dropout, Activation
from keras.models import Sequential
from keras.optimizers import Adam
from keras import backend as K
from collections import deque
import gym
#选取互动环境
env = gym.make('FrozenLake-v0')
state = env.reset()
env.render()

def  random_actions_game(episodes):
  for episode in range(episodes):
    state = env.reset()
    score = 0
    done = False
    while not done:
      #随机向环境发生命令
      action = random.choice([0, 1])
      new_state, reward, done, info = env.step(action)
      score += 1
    print('Episode: {} score: {}'.format(episode + 1, score))


    random_actions_game(10)

env = env.unwrapped
#环境状态点数量
print(env.observation_space.n)
#可采取的行动数量
print(env.action_space.n)
#在每个节点采取四种行动的概率
print(env.P)

 

 

print(env.P[14][1])

#初始化所有状态点为0
value_of_table = np.zeros(env.observation_space.n)
#设置循环更新最大次数
no_of_iteration = 100000

def  value_iteration(env, gamma = 1.0):
  #设定阈值
  threshold = 1e-20
  
  for i in range(no_of_iteration):
    updated_value_of_table = np.copy(value_of_table)
    #根据公式（8）循环更新每个节点值
    for state in range(env.observation_space.n):
      Q_value = []
      #计算在给的状态点采取所有行动后可获得的最大值
      for action in range(env.action_space.n):
        next_states_rewards = []
        for next_sr in env.P[state][action]:
          trans_prob, next_state, reward, _ = next_sr
          #根据公式（8）计算回报                                        
          next_states_rewards.append((trans_prob * (reward + gamma * updated_value_of_table[next_state])))
          
        Q_value.append(np.sum(next_states_rewards))
      
      #更新状态节点值
      value_of_table[state] = max(Q_value)
    #检测前后两次迭代状态点的值变化是否在阈值范围内
    if np.sum(np.fabs(updated_value_of_table - value_of_table)) <= threshold:
      print("interation finished : %d" % (i+1))
      break
  
  return value_of_table
    

optimal_value_table = value_iteration(env=env, gamma = 1.0)

def  extract_policy(value_table, gamma = 1.0):
  policy = np.zeros(env.observation_space.n)
  
  for state in range(env.observation_space.n):
    Q_table = np.zeros(env.action_space.n)
    #根据当前各状态点的最优值，计算采取不同行动所得分值
    for action in range(env.action_space.n):
      for next_sr in env.P[state][action]:
        trans_prob, next_state, reward, _ = next_sr
        Q_table[action] += (trans_prob * (reward + gamma * value_table[next_state]))
    #把能获得最大回报的行动当做当前状态
    policy[state] = np.argmax(Q_table)
  
  return policy

optimal_policy = extract_policy(optimal_value_table, gamma = 1.0)
print(optimal_policy)

gamma = 0.95
epsilon = 1.0
epsilon_min = 0.01
epsilon_decay = 0.99

deque_len = 20000
#我们的目标是训练网络能在一个episode中获得200分
target_score = 200
episodes = 2000
batch_size = 64
optimizer = 'adam'
loss = 'mse'

#构建参与环境互动的网络
def  agent(states, actions):
  model = Sequential()
  model.add(Dense(16, input_dim = states))
  model.add(Activation('relu'))
  model.add(Dense(16))
  model.add(Activation('relu'))
  model.add(Dense(16))
  model.add(Activation('relu'))
  #网络最后输出两种结果，分别对应在当前状态下采取对应行动时所得最终回报
  model.add(Dense(actions))
  model.add(Activation('linear'))
  return model

'''
根据epsilon贪婪算法，对于给定epsilon,在[0,1]内构造一个随机数，如果随机数的值比epsilon小，那么
我们随机在两种行动中选择一种，如果比episilon大，我们让网络来决定当前状态
'''
def  agent_action(model, epsilon, state, actions):
  if np.random.rand() <= epsilon:
    #随机在两种行动中选一种
    act = random.randrange(actions)
  else:
    act = np.argmax(model.predict(state)[0])
  return act

training_data = deque(maxlen = deque_len)

def  memory(state, new_state, reward, done, action):
  training_data.append((state, new_state, reward, done, action))

def  performance_plot(scores, target_score):
  scores_arr = np.array(scores)
  scores_arr[np.where(scores_arr > target_score)] = target_score
  plt.figure(figsize = (20, 5))
  plt.title('Plot of Score v/s Episode')
  plt.xlabel('Episodes')
  plt.ylabel('Scores')
  plt.plot(scores_arr)
  plt.show()

'''
将状态点，行动，环境反馈，下一个状态点等信息存储在队列里，输入网络，让网络识别如何在给定状态的中选择
合适的行动
'''
def replay_back(epsilon, gamma, epislon_min, epsilon_decay, model, training_data, 
           batch_size = 64):
  idx = random.sample(range(len(training_data)), min(len(training_data), batch_size))
  train_batch = [training_data[j] for j in idx]
  for state, new_state, reward, done, action in train_batch:
    target = reward
    '''
    在当前状态(state)采取给定行动(action)，进入下一个状态(next_state),
    如果next_state不是终止状态,那意味着在在当前状态state采取给定行动action是正确的，
    于是我们根据Bellman函数迭代更新当前状态采取给定行动后的回报,然后训练网络识别状态点，行动
    以及回报之间存在的关系,然后根据这种训练后的能力去识别新状态点在采取不同行动后的回报
    '''
    if not done:
      #bellman函数迭代状态点执行给定行动后的回报
      target = reward + gamma * np.amax(model.predict(new_state)[0])
    target_f = model.predict(state)
    #修正网络在给定状态下对给定行动后回报的预测
    target_f[0][action] = target
    #让网络重新识别给定状态采取给定行动后所得回报间的联系
    model.fit(state, target_f, epochs = 1, verbose = 0)
    if epsilon > epsilon_min:
      #不断缩小epsilon的值，这样在agent_action中会更多的让网络做出决策
      epsilon *= epsilon_decay
  return epsilon

def  train(target_score, batch_size, episodes, optimizer, loss, epsilon,
          gamma, epsilon_min, epsilon_decay, actions):
  print('---training---')
  K.clear_session()
  scores = []
  model = agent(states, actions)
  model.compile(loss = loss, optimizer = optimizer)
  
  for episode in range(1, episodes + 1):
    state = env.reset()
    #转换成1*4向量
    state = state.reshape(1, states)
    done = False
    time_step = 0
    while not done:
      #使用贪婪算法获得行动类型
      action = agent_action(model, epsilon, state, actions)
      new_state, reward, done, info = env.step(action)
      '''
      如果当前行动导致的下个状态是终止状态，就如同并东湖问题中的窟窿，因此它对应的回报要对应负值
      '''
      reward = reward if not done else -10
      new_state = new_state.reshape(1, states)
      #把状态转换信息存储起来用于训练网络
      memory(state, new_state, reward, done, action)
      state = new_state
      time_step += 1
      
    #将当前状态转换信息去训练网络
    epsilon = replay(epsilon, gamma, epsilon_min, epsilon_decay, model,
                    training_data)
    scores.append(time_step)
    if episode % 100 == 0:
      print('episod {}, socre {}, epsilon{:4}'.format(episode, time_step,
                                                     epsilon))
      print('Avg Score over last 100 epochs', sum(scores[-100:])/100)
      if sum(scores[-100: ])/100 > target_score:
        print('----Goal Achived After {} Episodes------'.format(episode))
        performance_plot(scores, target_score)
        break
  model.save('/content/gdrive/My Drive/CartPole.h5')     
  return model     

from google.colab import drive
drive.mount('/content/gdrive')

env = gym.make('CartPole-v1')

seed_val = 456
np.random.seed(seed_val)
env.seed(seed_val)
random.seed(seed_val)

states = env.observation_space.shape[0]
actions = env.action_space.n
training_data = deque(maxlen=deque_len)

model = train(target_score=target_score, batch_size=batch_size,
              episodes=episodes, optimizer=optimizer, loss=loss,
              epsilon=epsilon, gamma=gamma, epsilon_min=epsilon_min,
              epsilon_decay=epsilon_decay, actions=actions)

 

内容总结

以上是互联网集市为您收集整理的吴裕雄--天生自然神经网络与深度学习实战Python+Keras+TensorFlow：Bellman函数、贪心算法与增强性学习网络开发实践全部内容，希望文章能够帮你解决吴裕雄--天生自然神经网络与深度学习实战Python+Keras+TensorFlow：Bellman函数、贪心算法与增强性学习网络开发实践所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---