BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:6711@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20200703T140000
DTEND;TZID=Europe/Paris:20200703T150000
DTSTAMP:20241120T201945Z
URL:https://www.i2m.univ-amu.fr/evenements/graph-algorithms-through-the-le
 ns-of-continuous-optimization/
SUMMARY:Adrian Vladu (IRIF\, Université de Paris): Graph algorithms throug
 h the lens of continuous optimization
DESCRIPTION:Adrian Vladu: Recent years have witnessed a surge in the develo
 pment of fast graph algorithms based on continuous optimization primitives
 . Classically\, graph algorithms have relied on purely combinatorial techn
 iques. However\, new ideas stemming from Scientific Computing and Machine 
 Learning set forth an emerging theme of algorithm design via continuous op
 timization. I will provide a tour through some of the techniques that unde
 rlie this theme\, and show how they can be used to obtain fast algorithms 
 for solving a range of fundamental problems such as: maximum flow\, minimu
 m cost flow\, or optimal transport with entropic regularization.\nThis tal
 k is based on https://arxiv.org/pdf/1902.06391.pdf\, https://arxiv.org/pdf
 /2003.04863.pdf\, and https://arxiv.org/pdf/1704.02310.pdf\, but will be k
 ept self-contained\, and will assume no prior background in optimization.\
 nThis seminar is organized by LIS\, pole Calcul. Link of the visio: https:
 //bbb.lsis.org/b/nat-ka2-j76. 
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/12/Adrian_Vladu.jpg
CATEGORIES:Séminaire,Signal et Apprentissage,Virtual event
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR