Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shai Keynan

dblp:294/8454 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 75% Deep learning architectures and training · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
actor-critic methods
0.512021
Recomposing the Reinforcement Learning Building Blocks with Hypernetworks · ICML 2021
Machine learning › Deep learning architectures and training
hypernetwork
0.512021
Recomposing the Reinforcement Learning Building Blocks with Hypernetworks · ICML 2021
Machine learning › Reinforcement learning
meta-reinforcement learning
0.512021
Recomposing the Reinforcement Learning Building Blocks with Hypernetworks · ICML 2021
Machine learning › Reinforcement learning › value function approximation
q-function approximation
0.512021
Recomposing the Reinforcement Learning Building Blocks with Hypernetworks · ICML 2021

Methods — techniques the papers use, named apart from their topics

hypernetwork · 0.5gradient estimation · 0.5
YearPublicationVenuePosition
2021 Recomposing the Reinforcement Learning Building Blocks with Hypernetworks
abstract
The Reinforcement Learning (RL) building blocks, i.e. $Q$-functions and policy networks, usually take elements from the cartesian product of two domains as input. In particular, the input of the $Q$-function is both the state and the action, and in multi-task problems (Meta-RL) the policy can take a state and a context. Standard architectures tend to ignore these variables’ underlying interpretations and simply concatenate their features into a single vector. In this work, we argue that this choice may lead to poor gradient estimation in actor-critic algorithms and high variance learning steps in Meta-RL algorithms. To consider the interaction between the input variables, we suggest using a Hypernetwork architecture where a primary network determines the weights of a conditional dynamic network. We show that this approach improves the gradient approximation and reduces the learning step variance, which both accelerates learning and improves the final performance. We demonstrate a consistent improvement across different locomotion tasks and different algorithms both in RL (TD3 and SAC) and in Meta-RL (MAML and PEARL).
Elad Sarafian, Shai Keynan, Sarit Kraus
ICML2