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

Simon Ramstedt

dblp:210/9961 · DBLP profile ↗
← Back
3ranked-venue papers
1as 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 · 3 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1

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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
delayed reinforcement learning
0.512021
Reinforcement Learning with Random Delays · ICLR 2021
Machine learning › Reinforcement learning
actor-critic methods
0.412019
Real-Time Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning
continuous control
0.412019
Real-Time Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning
markov decision process
0.412019
Real-Time Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning › online decision making › online reinforcement learning
real-time reinforcement learning
0.412019
Real-Time Reinforcement Learning · NeurIPS 2019

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

soft actor-critic · 0.4actor-critic · 0.4
YearPublicationVenuePosition
2021 Reinforcement Learning with Random Delays
Yann Bouteiller, Simon Ramstedt, Giovanni Beltrame, Christopher Joseph Pal, Jonathan Binas
ICLR2
2019 Real-Time Reinforcement Learning
abstract
Markov Decision Processes (MDPs), the mathematical framework underlying most algorithms in Reinforcement Learning (RL), are often used in a way that wrongfully assumes that the state of an agent's environment does not change during action selection. As RL systems based on MDPs begin to find application in real-world safety critical situations, this mismatch between the assumptions underlying classical MDPs and the reality of real-time computation may lead to undesirable outcomes. In this paper, we introduce a new framework, in which states and actions evolve simultaneously and show how it is related to the classical MDP formulation. We analyze existing algorithms under the new real-time formulation and show why they are suboptimal when used in real-time. We then use those insights to create a new algorithm Real-Time Actor Critic (RTAC) that outperforms the existing state-of-the-art continuous control algorithm Soft Actor Critic both in real-time and non-real-time settings.
Simon Ramstedt, Christopher Joseph Pal
NeurIPS1
2017 Goal-driven dimensionality reduction for reinforcement learning
abstract
Defining a state representation on which optimal control can perform well is a tedious but crucial process. It typically requires expert knowledge, does not generalize straightforwardly over different tasks and strongly influences the quality of the learned controller. In this paper, we present an autonomous feature construction method for learning low-dimensional manifolds of goal-relevant features jointly with an optimal controller using reinforcement learning. Our method combines information-theoretic algorithms with principal component analysis to performs a return-weighted reduction of the state representation. The method does not require any preprocessing of the data, does not assume strong restrictions on the state representation, and substantially improves the performance of learning by reducing the number of samples required. We show that our method can learn high quality controller in redundant spaces, even from pixels, and outperforms both classical and state-of-the-art deep learning approaches.
Simone Parisi, Simon Ramstedt, Jan Peters 0001
IROS2