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

Philippe Hamel

dblp:80/7057 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2019
0009-0007-9815-8453ORCID · corroborated

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

Artificial intelligence and machine learning · 4

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%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
discount factor
0.412019
Per-Decision Option Discounting · ICML 2019
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.412019
The Option Keyboard: Combining Skills in Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning › hierarchical reinforcement learning
option discovery
0.412019
The Option Keyboard: Combining Skills in Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning › hierarchical reinforcement learning
options framework
0.412019
Per-Decision Option Discounting · ICML 2019
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill composition
0.412019
The Option Keyboard: Combining Skills in Reinforcement Learning · NeurIPS 2019
Machine learning › Reinforcement learning › hierarchical reinforcement learning
temporal abstraction
0.412019
Per-Decision Option Discounting · ICML 2019
Audio and music processing
music information retrieval
0.212014
AutoMashUpper: automatic creation of multi-song music mashups · IEEE ACM Trans. Audio Speech Lang. Process. 2014
Machine learning › Reinforcement learning
transfer learning in reinforcement learning
0.112019
The Option Keyboard: Combining Skills in Reinforcement Learning · NeurIPS 2019

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

pseudo-rewards · 0.4options framework · 0.4markov decision process · 0.4cumulants · 0.4spectral balance · 0.2rhythmic similarity · 0.2listening test · 0.2harmonic similarity · 0.2
YearPublicationVenuePosition
2019 Per-Decision Option Discounting
abstract
In order to solve complex problems an agent must be able to reason over a sufficiently long horizon. Temporal abstraction, commonly modeled through options, offers the ability to reason at many timescales, but the horizon length is still determined by the discount factor of the underlying Markov Decision Process. We propose a modification to the options framework that naturally scales the agent’s horizon with option length. We show that the proposed option-step discount controls a bias-variance trade-off, with larger discounts (counter-intuitively) leading to less estimation variance.
Anna Harutyunyan, Peter Vrancx, Philippe Hamel, Ann Nowé, Doina Precup
ICML3
2019 The Option Keyboard: Combining Skills in Reinforcement Learning
abstract
The ability to combine known skills to create new ones may be crucial in the solution of complex reinforcement learning problems that unfold over extended periods. We argue that a robust way of combining skills is to define and manipulate them in the space of pseudo-rewards (or "cumulants"). Based on this premise, we propose a framework for combining skills using the formalism of options. We show that every deterministic option can be unambiguously represented as a cumulant defined in an extended domain. Building on this insight and on previous results on transfer learning, we show how to approximate options whose cumulants are linear combinations of the cumulants of known options. This means that, once we have learned options associated with a set of cumulants, we can instantaneously synthesise options induced by any linear combination of them, without any learning involved. We describe how this framework provides a hierarchical interface to the environment whose abstract actions correspond to combinations of basic skills. We demonstrate the practical benefits of our approach in a resource management problem and a navigation task involving a quadrupedal simulated robot.
André Barreto 0001, Diana Borsa, Shaobo Hou, Gheorghe Comanici, Eser Aygün, Philippe Hamel, Daniel Toyama, Jonathan J. Hunt, Shibl Mourad, David Silver 0001, Doina Precup
NeurIPS6
2014 AutoMashUpper: automatic creation of multi-song music mashups
abstract
In this paper we present a system, AutoMashUpper, for making multi-song music mashups. Central to our system is a measure of “mashability” calculated between phrase sections of an input song and songs in a music collection. We define mashability in terms of harmonic and rhythmic similarity and a measure of spectral balance. The principal novelty in our approach centres on the determination of how elements of songs can be made fit together using key transposition and tempo modification, rather than based on their unaltered properties. In this way, the properties of two songs used to model their mashability can be altered with respect to transformations performed to maximize their perceptual compatibility. AutoMashUpper has a user interface to allow users to control the parameterization of the mashability estimation. It allows users to define ranges for key shifts and tempo as well as adding, changing or removing elements from the created mashups. We evaluate AutoMashUpper by its ability to reliably segment music signals into phrase sections, and also via a listening test to examine the relationship between estimated mashability and user enjoyment.
Matthew E. P. Davies, Philippe Hamel, Kazuyoshi Yoshii, Masataka Goto
IEEE ACM Trans. Audio Speech Lang. Process.2
2009 Workshop summary: Sparse methods for music audio
abstract
No abstract available.
Douglas Eck, Daniel P. W. Ellis, Philippe Hamel
ICML3