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:20260910T100000
DTEND;TZID=America/Chicago:20260910T120000
DTSTAMP:20260907T234311Z
SUMMARY:Kirill Nagaitsev CS PhD Prospectus: Shaping the Search in LLM-Driven Computational Kernel Optimization
UID:645639@northwestern.edu
TZID:America/Chicago
DESCRIPTION:Optimizing computational kernels for target GPU and accelerator hardware is an important\, ongoing challenge. These kernels are the performance-critical units of AI/ML models and HPC applications\, where small inefficiencies compound into large costs at scale. Traditional approaches include writing custom kernels manually\, which requires significant time and expertise\, as well as using compilers\, which apply transformations from fixed catalogs. Recent work shows that LLM-based methods can also optimize kernels effectively\, often outperforming existing compilers. PIKE\, the first component of my thesis\, demonstrates that in LLM-based multi-agent systems for PyTorch inference optimization\, achieving a cost-effective search requires careful allocation of agents and search resources.  I propose extending PIKE to harness the strengths of tensor program superoptimization\, a search-based technique that explores the space of programs within a fixed operator vocabulary to find the fastest one equivalent to the original kernel. I describe the design space that emerges from these hybrid approaches\, in which a classical search technique is driven by an LLM. I further propose treating the kernel optimization search space itself as adaptable\, using the LLM to modify the operator vocabulary that the superoptimizer searches over. I outline completed work on PIKE\, initial steps toward integrating superoptimization as a classical search method driven by an LLM\, and future directions for shaping the search in LLM-driven kernel optimization.   \n\nWebcast Link: https://urldefense.com/v3/__https:/northwestern.zoom.us/j/6998460618__;!!Dq0X2DkFhyF93HkjWTBQKhk!SY18T5LpZ8BvnSUNXNXqOsy41ZXjlcTt7AhbMWuDF0aenFMNPmBOzNXXIiDto8QKksNbr8squIIBVbwE_e3IpAavO4X8F905N2m0Jq6V_xVCxXk$
LOCATION:Mudd Hall ( formerly Seeley G. Mudd Library)\, 3514\, 2233 Tech Drive\, Evanston\, IL 60208
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/645639
CREATED:20260902T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260902T050000Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR