Enrique Munoz de Cote

Enrique Munoz de Cote

Auto-generated profile, based on publicly available information

Enrique Munoz de Cote

National Institute of Astrophysics, Optics and Electronics (INAOE)

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2017 in Mobile Networks and Applications
Verified
Journal Article
Closed access
PDF file
FLFernando Lezama
Fernando Lezama
JPJorge Palominos
Jorge Palominos
Ansel Yoan Rodríguez GonzálezAnsel Yoan Rodríguez González
Ansel Yoan Rodríguez González
AFAlessandro Farinelli
Alessandro Farinelli
ECEnrique Munoz de Cote
Enrique Munoz de Cote

20 September 2016 in Adaptive Behavior
Verified
Journal Article
Closed access
ECEnrique Munoz de Cote
Enrique Munoz de Cote
EGEsteban O. Garcia
Esteban O. Garcia
EMEduardo Morales
Eduardo Morales
In machine learning, learning a task is expensive (many training samples are needed) and it is therefore of general interest to be able to reuse knowledge across tasks. This is the case in aerial robotics applications, where an autonomous aerial robot cannot interact with the environment hazard free. Prototype generation is a well known technique commonly used in supervised learning to help reduce the number of samples needed to learn a task. However, little is known about how such techniques can be used in a reinforcement learning task. In this work we propose an algorithm that, in order to learn a new (target) task, first generates new samples—prototypes—based on samples acquired previously in a known (source) task. The proposed approach uses Gaussian processes to learn a continuous multidimensional transition function, rendering the method capable of reasoning directly in continuous (states and actions) domains. We base the prototype generation on a careful selection of a subset of samples from the source task (based on known filtering techniques) and transforming such samples using the (little) knowledge acquired in the target task. Our experimental evidence gathered in known reinforcement learning benchmark tasks, as well as a challenging quadcopter to helicopter transfer task, suggests that prototype generation is feasible and, furthermore, that the filtering technique used is not as important as a correct transformation model.

15 March 2016
Verified
Book Chapter
Closed access
PDF file
FLFernando Lezama
Fernando Lezama
Ansel Yoan Rodríguez GonzálezAnsel Yoan Rodríguez González
Ansel Yoan Rodríguez González
ECEnrique Muñoz de Cote
Enrique Muñoz de Cote
Luis Enrique SucarLuis Enrique Sucar
Luis Enrique Sucar

11 March 2019 in arXiv
Verified
Preprint
Open access
PDF file
PHPablo Hernandez-Leal
Pablo Hernandez-Leal
MKMichael Kaisers
Michael Kaisers
TBTim Baarslag
Tim Baarslag
ECEnrique Munoz de Cote
Enrique Munoz de Cote
The key challenge in multiagent learning is learning a best response to the behaviour of other agents, which may be non-stationary: if the other agents adapt their strategy as well, the learning target moves. Disparate streams of research have approached non-stationarity from several angles, which make a variety of implicit assumptions that make it hard to keep an overview of the state of the art and to validate the innovation and significance of new works. This survey presents a coherent overview of work that addresses opponent-induced non-stationarity with tools from game theory, reinforcement learning and multi-armed bandits. Further, we reflect on the principle approaches how algorithms model and cope with this non-stationarity, arriving at a new framework and five categories (in increasing order of sophistication): ignore, forget, respond to target models, learn models, and theory of mind. A wide range of state-of-the-art algorithms is classified into a taxonomy, using these categories and key characteristics of the environment (e.g., observability) and adaptation behaviour of the opponents (e.g., smooth, abrupt). To clarify even further we present illustrative variations of one domain, contrasting the strengths and limitations of each category. Finally, we discuss in which environments the different approaches yield most merit, and point to promising avenues of future research.