Ofertes de projectes

 Es vol fusionar les dades de dos dispositius de tracking que permeti millorar la manera en que un usuari interacciona amb un computador. Per mesurar la millora de la fusió, es realitzaria una serie de mesures del temps que empra un usuari en realitzar una tasca o exercici de test determinat.També es mesuraran el nombre d'errors o rectificacions en realitzar la tasca.

Mitjançant un sistema de dues càmeres estèreo que mesuraria la direcció dels ulls i de la direcció de la mirada, i un segon sistema que mesura la posició dels dits de la ma; es desitja fusionar les dades proporcionades per implementar un sistema de fusió de dades que permeti un accés més eficaç a l'ordinador.

Boltzmann Machines are probabilistic models developed in 1985 by
D.H. Ackley, G.E. Hinton and T.J. Sejnowski. In 2006, Restricted
Boltzmann Machines (RBMs) were used in the pre-training step of
several successful deep learning models, leading to a new renaissance
of neural networks and artificial intelligence.

In spite of their nice mathematical formulation, there are a number of
issues that are hard to compute:

1. The computation of the partition function is NP-hard, involving an  exponential sum of terms
2. The exact computation of the derivative of the log-likelihood is  also NP-hard, since it contains the derivative of the partition function

Therefore, in practice we have to approximate both the computation of
the probabilities and several components of the learning process
itself. These drawbacks have prevented RBMs to show their real
potential as truly probabilistic models.

Currently, we are working on trying to improve several of the unsolved
issues related to RBMs:

1. - Mechanisms to control the learning process: www.lsi.upc.edu/~eromero/Publications/Downloads/2018-tnnls-stopcritRBM.pdf
2. Better approximations of the derivative of the log-likelihood: http://www.lsi.upc.edu/~eromero/Publications/Downloads/2019-nn-weightedCD.pdf
3. Efficient approximation of the partition function (work in progress)

These works have opened new lines of research, some of which can be
the topic of a Master's Thesis. The scope and degree of depth of the
work can be adapted to the estimated times to complete the Thesis. For
further details, contact Enrique Romero (eromero@cs.upc.edu).

This is precisely why companies such as Google have invested a lot of resources on exploring applications of GNN, some of which are as mediatic as Alpha Fold (recently solving the Protein-Folding problem), or used by Goolge Maps to make predictions of the expected traffic of a road. In this regard, the goal of this thesis is to continue investigating about the potential of GNNs when applied to the field of Computer Networks. Our goal is to provide GNN-based solutions that make computer networks run more autonomously and in a more efficient way.

The goal of this thesis is to enable the application of Deep Reinforcement Learning techniques for optimization problems in very large and complex scenarios. Inspired by the last related work from OpenAI (https://openai.com/blog/evolution-strategies/), we will explore time-efficient alternatives to train a Graph Neural Network based DRL agent on large optimization scenarios in a reasonable amount of time.

A more detailed description of the project can be found in

https://www.cs.upc.edu/~eromero/Downloads/Retina-TFM-Project-01.pdf

The project is proposed in collaboration with Javier Zarranz Ventura
(Institut Clínic d'Oftalmologia, ICOF, Hospital Clínic de Barcelona, and
Institut d'Investigacions Biomèdiques August Pi I Sunyer, IDIBAPS),
which would provide a large annotated database to develop the project. For further information, please contact Alfredo Vellido (avellido@cs.
upc.edu) or Enrique Romero (eromero@cs.upc.edu).

 The goal of this thesis is to enable the application of Deep Reinforcement Learning techniques for optimization problems in very large and complex scenarios, in this case Data Center Networks. Inspired by the last related work from OpenAI (https://openai.com/blog/evolution-strategies/), we will explore time-efficient alternatives to train a Graph Neural Network based DRL agent on large optimization scenarios in a reasonable amount of time.

The goal of this thesis is to enable the application of Deep Reinforcement Learning techniques for optimization problems in very large and complex scenarios, in this case LEO satellite communication networks. Inspired by the last related work from OpenAI (https://openai.com/blog/evolution-strategies/), we will explore time-efficient alternatives to train a Graph Neural Network based DRL agent on large optimization scenarios in a reasonable amount of time.