Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Algorithms and Hardness for Attention and Kernel Density Estimation

Google TechTalks via YouTube

Overview

Explore the computational challenges and algorithmic solutions for Attention in Large Language Models and Kernel Density Estimation in this Google TechTalk presented by Josh Alman. Dive into the quadratic-time algorithms for both problems and discover recent advancements in achieving almost linear-time performance through techniques like the Fast Multipole Method and the polynomial method. Examine fine-grained hardness results that demonstrate the optimality of these approaches in specific parameter regimes, while identifying potential areas for improvement. Learn about the speaker's collaborative research efforts and gain insights into the intersection of algorithm design, complexity theory, and algebraic tools for enhancing algorithmic efficiency.

Syllabus

Algorithms and Hardness for Attention and Kernel Density Estimation

Taught by

Google TechTalks

Reviews

Start your review of Algorithms and Hardness for Attention and Kernel Density Estimation

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.