BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IFDS - ECPv6.0.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IFDS
X-ORIGINAL-URL:https://ifds.info
X-WR-CALDESC:Events for IFDS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20220313T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20221106T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220207T123000
DTEND;TZID=America/Chicago:20220207T133000
DTSTAMP:20260515T233346
CREATED:20220119T200612Z
LAST-MODIFIED:20220204T164344Z
UID:1754-1644237000-1644240600@ifds.info
SUMMARY:IFDS Ideas Forum: Rare Gems: Finding Lottery Tickets at Initialization
DESCRIPTION:Title: Rare Gems: Finding Lottery Tickets at InitializationSpeaker: Jy-Yong SoonTime+location: Monday 7 Feb 2022\, 12:30-13:30 Orchard View Room\n \nAbstract: It has been widely observed that large neural networks can be pruned to a small fraction of their original size\, with little loss in accuracy\, by typically following a time-consuming “train\, prune\, re-train” approach. Frankle and Carbin in 2019 conjecture that we can avoid this by training lottery tickets\, i.e.\, special sparse subnetworks found at initialization\, that can be trained to high accuracy. However\, a subsequent line of work presents concrete evidence that current algorithms for finding trainable networks at initialization\, fail simple baseline comparisons\, e.g.\, against training random sparse subnetworks. Finding lottery tickets that train to better accuracy compared to simple baselines remains open. In this work\, we resolve this open problem by discovering rare gems: subnetworks at initialization that attain considerable accuracy\, even before training. Refining these rare gems – by means of fine-tuning – beats current baselines and leads to accuracy competitive or better than magnitude pruning methods.Bio:Jy-yong is a post-doctoral researcher in the Department of Electrical and Computer Engineering (ECE) at the University of Wisconsin-Madison\, working with Prof. Dimitris Papailiopoulos and Prof. Kangwook Lee. He is interested in the intersection of machine learning\, information theory\, and distributed algorithms. He received his Ph.D. degree in 2020 from KAIST\, under the supervision of Prof. Jaekyun Moon. He is a recipient of the IEEE ICC Best Paper Award\, Qualcomm Innovation Awards\, and NRF Korea Post-doctoral Fellowship.
URL:https://ifds.info/event/ifds-ideas-forum-2/
LOCATION:Orchard View Room\, 330 N. Orchard Street\, 3rd Floor NE\, Madison\, Wisconsin\, 53715\, United States
CATEGORIES:IFDS Ideas Forum
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20220207T140000
DTEND;TZID=America/Chicago:20220207T140000
DTSTAMP:20260515T233346
CREATED:20230313T142147Z
LAST-MODIFIED:20230313T142147Z
UID:2426-1644242400-1644242400@ifds.info
SUMMARY:IFDS Ideas Forum
DESCRIPTION:Rare Gems: Finding Lottery Tickets at Initialization
URL:https://ifds.info/event/ifds-ideas-forum-6/
LOCATION:WI
END:VEVENT
END:VCALENDAR