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

Serge Thilges

dblp:367/3763 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
episodic reinforcement learning
0.812024
Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning · ICLR 2024
Machine learning › Reinforcement learning
exploration
0.812024
Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning · ICLR 2024
Machine learning › Reinforcement learning › exploration
parameter space exploration
0.812024
Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning · ICLR 2024

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

step-based policy update · 0.8
YearPublicationVenuePosition
2024 Open the Black Box: Step-based Policy Updates for Temporally-Correlated Episodic Reinforcement Learning
abstract
Current advancements in reinforcement learning (RL) have predominantly focused on learning step-based policies that generate actions for each perceived state. While these methods efficiently leverage step information from environmental interaction, they often ignore the temporal correlation between actions, resulting in inefficient exploration and unsmooth trajectories that are challenging to implement on real hardware. Episodic RL (ERL) seeks to overcome these challenges by exploring in parameters space that capture the correlation of actions. However, these approaches typically compromise data efficiency, as they treat trajectories as opaque black boxes. In this work, we introduce a novel ERL algorithm, Temporally-Correlated Episodic RL (TCE), which effectively utilizes step information in episodic policy updates, opening the 'black box' in existing ERL methods while retaining the smooth and consistent exploration in parameter space. TCE synergistically combines the advantages of step-based and episodic RL, achieving comparable performance to recent ERL methods while maintaining data efficiency akin to state-of-the-art (SoTA) step-based RL.
Hongyi Zhou, Dominik Roth, Serge Thilges, Fabian Otto, Rudolf Lioutikov, Gerhard Neumann
ICLR4