Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

DDPG fixes #75

Closed
wants to merge 11 commits into from
Closed

DDPG fixes #75

wants to merge 11 commits into from

Conversation

kengz
Copy link
Owner

@kengz kengz commented Mar 20, 2017

@@ -44,7 +44,7 @@ def select_action(self, state):
Q_state = agent.actor.predict(state)[0]
assert Q_state.ndim == 1
action = np.argmax(Q_state)
logger.info(str(Q_state)+' '+str(action))
# logger.info(str(Q_state)+' '+str(action))
return action

def update(self, sys_vars):
Copy link
Collaborator

@lgraesser lgraesser Mar 25, 2017

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

AnnealedGaussian calls self.sample() but I don't think sample has been defined.
Also, how to explore with discrete actions. Add an epsilon greedy component to the policy?

@lgraesser
Copy link
Collaborator

I think it's really close to working but something is off with the gradient update. The DDPG implementation from permami works, and ddpg_tf implementation results in exactly the same actions up to the first gradient update. I also did some testing around the weights init - the algorithm is not that sensitive to them and will work for different initializations.

@kengz
Copy link
Owner Author

kengz commented Apr 18, 2017

working DDPG implemented in #118

@kengz kengz closed this Apr 18, 2017
@kengz kengz deleted the ddpg branch April 18, 2017 12:42
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants