Demo Data from EDBT 2026 / reviewers in the wild / expert
Ignasi Clavera
dblp:210/9640
· DBLP profile ↗
6ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author
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
5 papers |
Reinforcement learning · 88% Transfer learning and domain adaptation · 12% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
meta-reinforcement learning |
0.8 | 2 | 2019 | ProMP: Proximal Meta-Policy Search · ICLR (Poster) 2019 Learning to Adapt in Dynamic, Real-World Environments through Meta-Reinforcement Learning · ICLR (Poster) 2019 |
Machine learning › Reinforcement learning
actor-critic methods |
0.4 | 1 | 2020 | Model-Augmented Actor-Critic: Backpropagating through Paths · ICLR 2020 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.4 | 1 | 2020 | Sub-policy Adaptation for Hierarchical Reinforcement Learning · ICLR 2020 |
Machine learning › Transfer learning and domain adaptation
dynamic environment adaptation |
0.4 | 1 | 2019 | Learning to Adapt in Dynamic, Real-World Environments through Meta-Reinforcement Learning · ICLR (Poster) 2019 |
Machine learning › Reinforcement learning
model-based reinforcement learning |
0.3 | 1 | 2018 | Model-Ensemble Trust-Region Policy Optimization · ICLR (Poster) 2018 |
Machine learning › Reinforcement learning
policy optimization |
0.3 | 1 | 2018 | Model-Ensemble Trust-Region Policy Optimization · ICLR (Poster) 2018 |
Methods — techniques the papers use, named apart from their topics
backpropagation · 0.4actor-critic · 0.4proximal policy optimization · 0.4meta-reinforcement learning · 0.4meta-learning · 0.4trust region policy optimization · 0.3model ensemble · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Model-Augmented Actor-Critic: Backpropagating through Paths
Ignasi Clavera, Pieter Abbeel |
ICLR | 1 |
| 2020 | Sub-policy Adaptation for Hierarchical Reinforcement Learning
Alexander C. Li, Carlos Florensa, Ignasi Clavera, Pieter Abbeel |
ICLR | 3 |
| 2019 | Learning to Adapt in Dynamic, Real-World Environments through Meta-Reinforcement Learning
Anusha Nagabandi, Ignasi Clavera, Ronald S. Fearing, Pieter Abbeel, Sergey Levine, Chelsea Finn |
ICLR (Poster) | 2 |
| 2019 | ProMP: Proximal Meta-Policy Search
Jonas Rothfuss, Dennis Lee 0003, Ignasi Clavera, Tamim Asfour, Pieter Abbeel |
ICLR (Poster) | 3 |
| 2018 | Model-Ensemble Trust-Region Policy Optimization
Thanard Kurutach, Ignasi Clavera, Yan Duan, Aviv Tamar, Pieter Abbeel |
ICLR (Poster) | 2 |
| 2017 | Policy transfer via modularity and reward guidingabstractNon-prehensile manipulation, such as pushing, is an important function for robots to move objects and is sometimes preferred as an alternative to grasping. However, due to unknown frictional forces, pushing has been proven a difficult task for robots. We explore the use of reinforcement learning to train a robot to robustly push an object. In order to deal with the sample complexity of training such a method, we train the pushing policy in simulation and then transfer this policy to the real world. In order to ease the transfer from simulation, we propose to use modularity to separate the learned policy from the raw inputs and outputs; rather than training “end-to-end,” we decompose our system into modules and train only a subset of these modules in simulation. We further demonstrate that we can incorporate prior knowledge about the task into the state space and the reward function to speed up convergence. Finally, we introduce “reward guiding” to modify the reward function and further reduce the training time. We demonstrate, in both simulation and real-world experiments, that such an approach can be used to reliably push an object from many initial positions and orientations. Videos available at https://goo.gl/B7LtY3. Ignasi Clavera, David Held, Pieter Abbeel |
IROS | 1 |