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:8286@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20141003T140000
DTEND;TZID=Europe/Paris:20141003T150000
DTSTAMP:20241120T210324Z
URL:https://www.i2m.univ-amu.fr/evenements/j-audiffren-cmla-equivalence-be
 tween-regularized-learning-algorithms/
SUMMARY: (...): J. Audiffren (CMLA): Equivalence between regularized learni
 ng algorithms
DESCRIPTION:: Equivalence between regularized learning algorithms by J. Aud
 iffren (CMLA)\n\nThis talk is about the concept of equivalence equivalence
  between machine learning algorithms\\\, and more particularly equivalence
  between algorithms defined with a minimization problem.  We will discuss 
 the notion of equivalence\\\,  its definition and its consequences. We wil
 l introduce  two notions of algorithmic equivalence\\\, namely\\\, weak an
 d strong equivalence\\\, and we will study their strengths  and their limi
 t.
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20140330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR