BEGIN:VCALENDAR
PRODID:-//planitpurple.northwestern.edu//iCalendar Event//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
CLASS:PUBLIC
BEGIN:VTIMEZONE
TZID:America/Chicago
TZURL:http://tzurl.org/zoneinfo-outlook/America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:0
DTSTART;TZID=America/Chicago:20260416T140000
DTEND;TZID=America/Chicago:20260416T150000
DTSTAMP:20260430T212333Z
SUMMARY:Theory Seminar: Jingwei Li\, Columbia
UID:641528@northwestern.edu
TZID:America/Chicago
DESCRIPTION:Title: Speed Predictions for Online Energy-Efficient Scheduling Abstract: We consider the scheduling problem of online speed scaling where the goal is to minimize the energy consumption of a machine that controls the speed at which jobs are processed. Recent work has leveraged the learning-augmented framework\, where the algorithm is provided with predictions about jobs that will arrive in the future\, to manage power usage more efficiently.  We propose a novelprediction model for speed scaling where the predictions are about the machine speed (the output)\, instead of the jobs (the input). Machine speed predictions have multiple advantages. They are succinct and do not require knowledge of all the parameters of all the jobs. They can be provided dynamically\, which allows them to incorporate data observed at runtime\, instead of being provided up front. Finally\, they lead to a natural definition of smoothness that does not require defining a measure of the prediction error.  We give an algorithm for dynamic machine speed predictions that is $(1+\epsilon)$-consistent and $O(1)$-robust. For offline machine speed predictions and job speed predictions\, we provide an algorithm that achieves the stronger guarantee of  $(1+\epsilon)$-smoothness\, while maintaining $O(1)$-robustness. These guarantees are comparable to previous work on speed scaling with predictions\, but without having to predict the entire input.
LOCATION:Mudd Hall ( formerly Seeley G. Mudd Library)\, 3514\, 2233 Tech Drive\, Evanston\, IL 60208
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/641528
CREATED:20260409T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260409T050000Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR