BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Northeastern University College of Engineering - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Northeastern University College of Engineering
X-ORIGINAL-URL:https://coe.northeastern.edu
X-WR-CALDESC:Events for Northeastern University College of Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20250513
DTEND;VALUE=DATE:20250516
DTSTAMP:20260421T131556
CREATED:20250127T214218Z
LAST-MODIFIED:20250127T214218Z
UID:48972-1747094400-1747353599@coe.northeastern.edu
SUMMARY:ODSC East 2025 - Open Data Science Conference
DESCRIPTION:Join the Graduate Admissions team at ODSC East in Boston\, MA to learn about our graduate engineering programs.
URL:https://coe.northeastern.edu/event/odsc-east-2025-open-data-science-conference/
ORGANIZER;CN="Graduate School of Engineering":MAILTO:coe-gradadmissions@northeastern.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250514T130000
DTEND;TZID=America/New_York:20250514T140000
DTSTAMP:20260421T131556
CREATED:20250506T190741Z
LAST-MODIFIED:20250506T190741Z
UID:50753-1747227600-1747231200@coe.northeastern.edu
SUMMARY:An Automatic System to Detect Equivalence Between Iterative Algorithms
DESCRIPTION:Institute for Experiential AI Speaker: Laurent Lessard \nLarge-scale optimization problems in machine learning\, signal processing\, multi-agent systems\, and imaging have fueled ongoing interest in iterative optimization algorithms. New optimization algorithms are regularly proposed in order to capture more complicated models\, reduce computational burdens\, or obtain stronger performance and convergence guarantees. But how can we be sure a recently proposed algorithm is novel? Algorithms can be written in different equivalent ways that are not always obvious\, and with optimization being increasingly prevalent across different applications\, popular algorithms are routinely “re-discovered”. In this talk\, we present a framework for reasoning about equivalence of iterative algorithms. Our framework is based on concepts from control theory and linear systems theory and can identify equivalence for a variety of algorithm classes: (a) single-oracle algorithms such as gradient-based methods\, (b) multi-oracle algorithms such as distributed optimization algorithms\, primal-dual methods\, and operator-splitting methods\, and (c) algorithms that use different but related oracles\, such as subdifferentials\, proximal operators\, and Fenchel conjugates. Our work is a promising step towards an integrated and principled methodology for analyzing and designing control systems that use optimization algorithms “in the loop”. \nLocation: Teams \nRegister
URL:https://coe.northeastern.edu/event/an-automatic-system-to-detect-equivalence-between-iterative-algorithms/
END:VEVENT
END:VCALENDAR