statistical learning on LARge scale GRaphs (LARGR)
9-10 Mar 2023 Lille (France)
ATTENTION : Thursday, August 21 an operation is planned on the database server
which may cause access issues on Sciencesconf
Login
Lost password ?
Create account
Main menu
Home
Registration
Program
Instructions for participants
Slides of talks
HELP
@ Contact
Program
Week
Thu. 09
Fri. 10
List
‹
Friday, March 10, 2023
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
›9:00 (1h)
(Invited talk) Ranking from pairwise comparisons: a near-linear time minimax optimal algorithm for learning BTL weights - Julien Hendrickx
Julien Hendrickx
› Building A - Plenary Room
9:00 - 10:00 (1h)
(Invited talk) Ranking from pairwise comparisons: a near-linear time minimax optimal algorithm for learning BTL weights - Julien Hendrickx
Building A - Plenary Room
Julien Hendrickx
https://statlearngraph23.sciencesconf.org/data/program/Julien_abstract_slides.pdf
›10:00 (30min)
Coffee break
› Building A - Plenary Room
10:00 - 10:30 (30min)
Coffee break
Building A - Plenary Room
›10:30 (1h)
Contributed talks
› Building A - Plenary Room
10:30 - 11:30 (1h)
Contributed talks
Building A - Plenary Room
›
Curvature-GAT : Improve graph attention with local structural information
- Stephane Chretien, Université Lyon 2
10:30-10:50 (20min)
›
Non Parametric and Semi-Parametric Modeling of a Sequence of Graphs for Testing Abnormality: Application to Cybersecurity
- Clarisse Boinay, Inria Lille - Nord Europe
10:50-11:10 (20min)
›
Trust and scalability through randomized communication graphs
- Jan Ramon, INRIA-Lille
11:10-11:30 (20min)
›11:30 (1h)
(Invited talk) Graph matching: from fundamental limits to algorithms - Marc Lelarge
Marc Lelarge
› Building A - Plenary Room
11:30 - 12:30 (1h)
(Invited talk) Graph matching: from fundamental limits to algorithms - Marc Lelarge
Building A - Plenary Room
Marc Lelarge
https://statlearngraph23.sciencesconf.org/data/program/Lelarge_Abstract_Slides.pdf
›12:30 (1h30)
Lunch break
12:30 - 14:00 (1h30)
Lunch break
›14:00 (1h)
(Invited talk) Learning in graphs with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature - Stephane Chretien
Stephane Chretien
› Building A - Plenary Room
14:00 - 15:00 (1h)
(Invited talk) Learning in graphs with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature - Stephane Chretien
Building A - Plenary Room
Stephane Chretien
https://statlearngraph23.sciencesconf.org/data/program/Stephane_Chretien_Abstract_Slides.pdf
›15:00 (1h)
Contributed talks
› Building A - Plenary Room
15:00 - 16:00 (1h)
Contributed talks
Building A - Plenary Room
›
Graph Neural Networks and Optimal Transport for Distance Learning between Graphs
- Aldo Moscatelli, Laboratoire d'Informatique, du Traitement de l'Information et des Systèmes
15:00-15:20 (20min)
›
Large population limits of Markov processes on random networks
- Marvin Lücke, Zuse Institute Berlin
15:20-15:40 (20min)
›
Temporal network compression via network hashing
- Rémi Vaudaine, Réseaux dynamiques : approche structurelle et temporelle
15:40-16:00 (20min)
Session
Speech
Logistics
Break
Tour
Privacy
|
Accessibility
Loading...