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

Erdi Sayar

dblp:324/6379 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2024
0000-0002-5944-7291ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers
Reinforcement learning · 38% Motion planning and robot control · 25% Generative modeling · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model
conditional diffusion model
0.812024
Diffusion-based Curriculum Reinforcement Learning · NeurIPS 2024
Machine learning › Reinforcement learning
curriculum reinforcement learning
0.812024
Diffusion-based Curriculum Reinforcement Learning · NeurIPS 2024
Machine learning › Generative modeling
diffusion model
0.812024
Diffusion-based Curriculum Reinforcement Learning · NeurIPS 2024
Machine learning › Reinforcement learning › off-policy reinforcement learning › experience replay
hindsight experience replay
0.812024
Contact Energy Based Hindsight Experience Prioritization · ICRA 2024
Robotics › Motion planning and robot control › robot learning
manipulation skill learning
0.812024
Contact Energy Based Hindsight Experience Prioritization · ICRA 2024
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
multi-goal reinforcement learning
0.812024
Contact Energy Based Hindsight Experience Prioritization · ICRA 2024
Robotics › Motion planning and robot control › robot learning › manipulation skill learning
sparse reward manipulation
0.812024
Contact Energy Based Hindsight Experience Prioritization · ICRA 2024

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

tactile sensing · 0.8q-learning · 0.8hindsight experience replay · 0.8exploration · 0.8experience prioritization · 0.8adversarial intrinsic motivation · 0.8
YearPublicationVenuePosition
2024 Hindsight Experience Replay with Evolutionary Decision Trees for Curriculum Goal Generation
Erdi Sayar, Vladislav Vintaykin, Giovanni Iacca, Alois C. Knoll
EvoApplications@EvoStar1
2024 Multi-Objective Evolutionary Hindsight Experience Replay for Robot Manipulation Tasks
abstract
Reinforcement learning (RL) algorithms often face challenges in efficiently learning effective policies for sparse-reward multi-goal robot manipulation tasks, thus requiring a vast amount of experiences. The state-of-the-art algorithm in the field, Hindsight Experience Replay (HER), addresses this issue by using failed trajectories and replacing the desired goal with hindsight goals. However, HER performs poorly when the desired goal is distant from the initial state. To address this limitation, Hindsight Goal Generation (HGG) has been proposed, which generates a curriculum of goals from already visited states. This curriculum generation is based on a single objective, and does not take obstacles into account. Here, we make a step forward by proposing Multi-Objective Evolutionary Hindsight Experience Replay (MOEHER), a novel curriculum RL algorithm that reformulates curriculum generation considering multiple objectives and obstacles. MOEHER utilizes NSGA-II to generate a curriculum that is optimized w.r.t. four objectives, namely the Q-function, the goal-proximity function, and two distance metrics, while simultaneously satisfying constraints on the obstacles. We evaluate MOEHER on four different sparse-reward robot manipulation tasks, with and without obstacles, and compare it with HER and HGG. The results demonstrate that MOEHER surpasses or performs on par with these methods on the tested tasks.
Erdi Sayar, Giovanni Iacca, Alois C. Knoll
GECCO1
2024 Contact Energy Based Hindsight Experience Prioritization
abstract
Multi-goal robot manipulation tasks with sparse rewards are difficult for reinforcement learning (RL) algorithms due to the inefficiency in collecting successful experiences. Recent algorithms such as Hindsight Experience Replay (HER) expedite learning by taking advantage of failed trajectories and replacing the desired goal with one of the achieved states so that any failed trajectory can be utilized as a contribution to learning. However, HER uniformly chooses failed trajectories, without taking into account which ones might be the most valuable for learning. In this paper, we address this problem and propose a novel approach Contact Energy Based Prioritization (CEBP) to select the samples from the replay buffer based on rich information due to contact, leveraging the touch sensors in the gripper of the robot and object displacement. Our prioritization scheme favors sampling of contact-rich experiences, which are arguably the ones providing the largest amount of information. We evaluate our proposed approach on various sparse reward robotic tasks and compare it with the state-of-the-art methods. We show that our method surpasses or performs on par with those methods on robot manipulation tasks. Finally, we deploy the trained policy from our method to a real Franka robot for a pick-and-place task. We observe that the robot can solve the task successfully. The videos and code are publicly available at: https://erdiphd.github.io/HER_force/.
Erdi Sayar, Zhenshan Bing, Carlo D'Eramo, Ozgur S. Oguz, Alois C. Knoll
ICRA1
2024 Diffusion-based Curriculum Reinforcement Learning
abstract
Curriculum Reinforcement Learning (CRL) is an approach to facilitate the learning process of agents by structuring tasks in a sequence of increasing complexity. Despite its potential, many existing CRL methods struggle to efficiently guide agents toward desired outcomes, particularly in the absence of domain knowledge. This paper introduces DiCuRL (Diffusion Curriculum Reinforcement Learning), a novel method that leverages conditional diffusion models to generate curriculum goals. To estimate how close an agent is to achieving its goal, our method uniquely incorporates a $Q$-function and a trainable reward function based on Adversarial Intrinsic Motivation within the diffusion model. Furthermore, it promotes exploration through the inherent noising and denoising mechanism present in the diffusion models and is environment-agnostic. This combination allows for the generation of challenging yet achievable goals, enabling agents to learn effectively without relying on domain knowledge. We demonstrate the effectiveness of DiCuRL in three different maze environments and two robotic manipulation tasks simulated in MuJoCo, where it outperforms or matches nine state-of-the-art CRL algorithms from the literature.
Erdi Sayar, Giovanni Iacca, Ozgur S. Oguz, Alois C. Knoll
NeurIPS1