Smooth Analysis

Concept

A method of analyzing algorithms introduced by Spielman and Teng, which involves adding a small amount of random noise to worst-case inputs to show that some lower bounds are fragile, meaning algorithms often perform well in practice despite theoretical worst-case scenarios.

Mentioned in 1 video

Videos Mentioning Smooth Analysis

Cal Newport: Deep Work, Focus, Productivity, Email, and Social Media | Lex Fridman Podcast #166

Cal Newport: Deep Work, Focus, Productivity, Email, and Social Media | Lex Fridman Podcast #166

Lex Fridman

A method of analyzing algorithms introduced by Spielman and Teng, which involves adding a small amount of random noise to worst-case inputs to show that some lower bounds are fragile, meaning algorithms often perform well in practice despite theoretical worst-case scenarios.