The internal seminar of Magnet team will be held in Hotel Louvre Lens. Departure: 4th 9:00 from Bus park at gare Lille Europe (on the left when going out of the railway station – after Crowne Plazza); Return: 5th 18:30 Inria parking (leaving Lens at 17:00). Program: 4th 9:45-10:15 Welcome 4th 10:15-11:15 Fast Clustering Methods …
Category: Uncategorized
Sep 19
PAD-ML Kick-Off: Workshop on Privacy-Aware Distributed Machine Learning
We are organizing a Workshop on Privacy-Aware Distributed Machine Learning on October 25, 2018 at INRIA Lille. This workshop serves as kick-off to PAD-ML (Privacy-Aware Distributed Machine Learning), an Inria North-European Associate Team between the Magnet project-team (Inria) and the Privacy-preserving data analysis group (Alan Turing Institute) which officially started in September 2018.
May 30
Pauline Wauquier thesis defense
Pauline defended her PhD thesis on Task driven representation learning on May 29th 2017. Abstract: Machine learning proposes numerous algorithms to solve the different tasks that can be extracted from real world prediction problems. To solve the different concerned tasks, most Machine learning algorithms somehow rely on relationships between instances. Pairwise instances relationships can be …
May 29
Workshop on Decentralized Machine Learning, Optimization and Privacy
We are organizing a Workshop on Decentralized Machine Learning, Optimization and Privacy on September 11-12, 2017 at INRIA Lille.
Nov 30
Grasp
New ANR Project in Magnet: Grasp (GRAph-based machine learning for linguistic Structure Prediction).
Sep 06
Pamela
New ANR Project in Magnet: Pamela (Personalized and decentrAlized MachinE Learning under constrAints).
Jun 03
RSS Workshop
Workshop on Graph based learning of the RSS North-European Team : UCL-Aalto-Lille June 16-17, 2016
Jul 03
A Markov random field approach to online graph label prediction
when: July 2, 2014 where: salle plénière speaker: Mark Herbster title: A Markov random field approach to online graph label prediction abstract: In graph label prediction each vertex is labeled with a 0 or 1. The aim is given a partial labeling of the graph to extend to a complete labeling. A common approach to …
Jul 03
Online Bayesian Moment Matching for Latent Dirichlet Allocation
when: may 20, 2014 from 11 am to noon where: A00 speaker: Pascal Poupart title: Online Bayesian Moment Matching for Latent Dirichlet Allocation abstract: Latent Dirichlet Allocation (LDA) is one of the most important models for the unsupervised discovery of latent components such as topics, entities and relations based on unlabeled corpora. The estimation of …
- 1
- 2
