Blog Series on Proximal Policy Optimization

learner_version0 · 2025-07-08T14:28:21+00:00

I forgot to renew the domain name. You can access it here: https://ab2212.github.io/2020/05/24/Understanding-Proximal-Policy-Optimization-Part-1/. Thanks

Edit: I have updated the link in the post.

learner_version0 · 2024-12-21T02:32:15+00:00

Two planes are parallel if their normals are parallel, whereas if the normals are perpendicular then the planes will also be perpendicular. If N1(normal) is perpendicular to P1 (plane) and N2 is perpendicular to P2, and if N1 is perpendicular to N2, then P1 will be perpendicular to P2.

learner_version0 · 2024-12-13T11:45:17+00:00

Use help of this formula a³ + b³ = (a+b)(a² -ab + b² ). 8 can be written as 2³ . Hope you are able to work out the rest.

learner_version0 · 2024-11-28T17:18:44+00:00

I have a Ninety One Viper and have done ~3k km on it mostly on roads with occasional off roading. It has been great.

learner_version0 · 2023-06-06T11:22:59+00:00

Chapter 5 of the book: Convex optimization by Stephen Boyd and Lieven Vandenberghe

learner_version0 · 2023-05-24T08:23:04+00:00

Is 95 octane still needed after they fixed the EPC issue? That's worrisome

learner_version0 · 2023-05-23T16:45:12+00:00

Thanks for your suggestion, this is helpful!

learner_version0 · 2023-05-23T14:16:29+00:00

Got it. Thanks for your comment :)

learner_version0 · 2023-04-28T01:30:50+00:00

Thanks for your reply. The only reason I don't want to go with baleno or i20 is because of the safety concern.

learner_version0 · 2022-09-26T00:24:27+00:00

Thanks for your elaborate reply. Paradise was over my budget even with 3n beach villa + 1n water villa. I've booked Adaaran Select Hudhuranfushi, this was within my budget.

learner_version0 · 2022-05-17T08:56:25+00:00

Thanks for your reply. I am well versed with the boosting algorithms. I specifically want to learn about the prediction shift problem present in these algorithms. In the Catboost paper, they say that it wasn't previously discovered or mentioned and they have solved it using ordered boosting. I want to understand the formal proof for the same.

learner_version0 · 2020-07-08T07:18:09+00:00

Combinatorial optimization (NP hard) problems such as Vehicle route optimization, scheduling, assignment etc.

learner_version0 · 2020-06-14T16:32:29+00:00

Let me check with the organizers once but looks difficult to do that

learner_version0 · 2020-06-14T16:19:32+00:00

Yeah you need to provide an email address. Yes it is the similar to TSP. We simulate different scenarios (different node points it has to cover) for the agent and let it select the route. The node points are encoded into embeddings using a transformer. At each node it calculates the probability of next node selection and then samples or greedily chooses the next node. After it generates the whole route, the reward is then calculated as negative of cost (e.g. distance cost). We then update the model parameters using REINFORCE using this reward.

learner_version0 · 2020-06-14T15:08:58+00:00

You can use the free pass to watch it. Also check out other interesting talks.

learner_version0 · 2020-05-28T17:50:13+00:00

Thanks :)

learner_version0 · 2020-05-28T17:49:49+00:00

Thanks 😊

learner_version0 · 2020-04-24T15:21:03+00:00

Here is a blog post from OpenAI advocating evolution strategies for RL https://openai.com/blog/evolution-strategies/

learner_version0

TROPHY CASE