TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Show HN: OpenAI's Cartpole Can Be Optimally Solved in ~10 Random Initializations

1 点作者 eugenhotaj将近 7 年前

1 comment

tlb将近 7 年前
Indeed, cartpole should be that easy. The observation vector is dimension 4, and the action vector is dimension 1. Gym has a range of difficulties, of which this is the lowest. It&#x27;s good for debugging because you can verify the math in your head.<p>The linked code is quite fragile, though. It chooses random models (4-vectors) with all positive signs between 0 and 1. It so happens that there&#x27;s a valid solution in this range, but a good RL agent should work equally well with flipped signs of observation and action vectors, and it should be able to solve it (possibly with more iterations) with any affine transformation of the two vector spaces.
评论 #17546248 未加载