BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20260105T140000
DTEND;TZID=Europe/Helsinki:20260105T153000
DTSTAMP:20260709T224756
CREATED:20251208T145641Z
LAST-MODIFIED:20251229T080037Z
UID:18634-1767621600-1767627000@crest.science
SUMMARY:Olga KLOPP (ESSEC) - Semi Supervised Learning on Graphs with GNNs
DESCRIPTION:Statistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:00 pm\nDate: 5th January\nPlace: 3001 \n  \nOlga KLOPP (ESSEC) – Semi Supervised Learning on Graphs with GNNs \n Abstract:  \n  \nWe study semi‑supervised node prediction on graphs where responses arise from a graph‑aware feature operator followed by a smooth regression map. Within a class combining skip‑connected GCN propagation with a fully connected ReLU network\, we (i) derive an oracle inequality for population risk under random label masks that separates approximation and estimation error and exposes dependence on the labeled fraction\, covering numbers\, and a receptive‑field constant; (ii) show skip connections exactly represent multi‑hop polynomial filters\, mitigating over‑smoothing; (iii) give covering‑number bounds; and (iv) quantify robustness of our algorithm. These results link classical graph regularization and modern GNN design. \n  \n  \nOrganizers: \nAnna KORBA (CREST)\, Vincent DIVOL (CREST) \, Jaouad MOURTADA (CREST) \n  \n  \nSponsors:\nCREST-CMAP \n
URL:https://crest.science/event/olga-klopp-essec-tba/
CATEGORIES:Seminars,Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR