PhD position starting September 2019

Machine Learning for Graph Signal Processing

in co-supervision with J. Salmon (Univ. Montpellier)

Apply Now

Presentation

Handling large datasets has become a major challenge in fields such as applied mathematics, machine learning and statistics. However, many methods proposed in the literature do not take into account the fine structures (geometric or not) behind the underlying data. Such structures can often be modeled by graphs.

Though many worldwide companies such as Google, Facebook or Twitter, have made their success extracting information where the signals live natively on a graph, a refined analysis of the underlying graph influence is still missing and most of the literature neglects, for simplicity, the underlying graph structure, or uses over simplistic linear estimators to overcome these issues. We advocate the use of robust non-linear regularizations to deal with inverse problems or classification tasks on such signals.

Project GraVa is an endeavor to solve such concrete and difficult issues through the mathematical perspective of variational methods for graph signal processing. This stance raises several challenges:

  1. Which estimators are good candidates for such tasks, and how to assess their performance? We will encompass recent contributions from communities of graph harmonic analysis, statistics and optimization, and develop new tools in nonlinear spectral graph theory which is only emerging.

  2. How to design computationally tractable algorithms for these methods? We will rely on modern distributed and parallel optimization schemes. Our main ambition is to go beyond standard approaches by fully taking advantage of key graph properties (regularity, sparsity, etc.).

  3. What is a good metric to compare graph signals and how to classify them? Measuring an L2-error is standard in signal processing but reflects a Gaussian assumption on the noise distribution. We intend to develop more robust and structure-dependent error metrics able to deal with inverse problems, segmentation and classification tasks.

  4. How to tackle time-dependent signals? Dealing with static signals is a first step, but many networks requires considering time-evolving graphs structures. We plan to transfer time-series analysis to graph signals in order to deploy our achievements to real case scenarios.

Positions

Internship positions and PhD funding are available on variational methods for graph signal processing.

Place:

Institut de Mathématiques de Bourgogne, Université de Bourgogne, Dijon, France.

(Preferred) starting date:

  • Master internship: May 2019 (up to 6 months).
  • PhD position: September 2019 (3 years program).

Skills:

  • Master degree in (Applied) Mathematics or Computer Science.
  • Mandatory: competency in at least one programming language, Master-level knowledge in machine learning.
  • Appreciated: Python and scientific stack associated, basic knowledge of graph theory.

Application:

Send to samuel.vaiter@u-bourgogne.fr AND joseph.salmon@umontpellier.fr

  • Curriculum vitæ,
  • Contact details of one or two referees,
  • Recent university records.

Members

Permanent members

PhD student

Events