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.

Sergio Pascual-Diaz

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

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

Artificial intelligence and machine learning · 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
1 paper
Reinforcement learning · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
actor-critic methods
0.412019
A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment · NeurIPS 2019
Machine learning › Reinforcement learning › exploration › intrinsically motivated reinforcement learning
empowerment
0.412019
A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment · NeurIPS 2019
Machine learning › Reinforcement learning › exploration
intrinsic motivation
0.412019
A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment · NeurIPS 2019
Machine learning › Reinforcement learning › actor-critic methods
off-policy actor-critic
0.412019
A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment · NeurIPS 2019

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

information theory · 0.8bellman optimality principle · 0.8
YearPublicationVenuePosition
2019 A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment
abstract
Empowerment is an information-theoretic method that can be used to intrinsically motivate learning agents. It attempts to maximize an agent's control over the environment by encouraging visiting states with a large number of reachable next states. Empowered learning has been shown to lead to complex behaviors, without requiring an explicit reward signal. In this paper, we investigate the use of empowerment in the presence of an extrinsic reward signal. We hypothesize that empowerment can guide reinforcement learning (RL) agents to find good early behavioral solutions by encouraging highly empowered states. We propose a unified Bellman optimality principle for empowered reward maximization. Our empowered reward maximization approach generalizes both Bellman’s optimality principle as well as recent information-theoretical extensions to it. We prove uniqueness of the empowered values and show convergence to the optimal solution. We then apply this idea to develop off-policy actor-critic RL algorithms which we validate in high-dimensional continuous robotics domains (MuJoCo). Our methods demonstrate improved initial and competitive final performance compared to model-free state-of-the-art techniques.
Felix Leibfried, Sergio Pascual-Diaz, Jordi Grau-Moya
NeurIPS2