BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20230105T120000Z
UID:7ef4a09db3444681ffb4de305c6cc90f-383
DTSTAMP:19700101T120016Z
DESCRIPTION:Probabilistic Hash Functions and Hash Tables: A New Paradigm for Efficient AI Training and Inference
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/383/probabilistic-hash-functions-and-hash-tables-a-new-paradigm-for-efficient-ai-training-and-inference/
SUMMARY:Neural Scaling Law informally states that an increase in model size and data automatically improves AI. However, we have reached a point where the growth has reached a tipping end where the cost and energy associated with AI are becoming prohibitive.

 This talk will demonstrate the algorithmic progress that can exponentially reduce the compute and memory cost of training and inference with neural networks. We will show how data structures can fundamentally break the barriers of some of the classical adaptive sampling subroutines. In particular, randomized hash tables can be used to design an efficient
DTSTART:20230105T120000Z
END:VEVENT
END:VCALENDAR