[Lowerbounds, Upperbounds]

Algorithms are everywhere.

Friday, November 30th, 2007
3:30pm
WEH 7220

Title: Efficient algorithms for agnostic learning (aka learning with arbitrary noise)

Adam Kalai
Georgia Tech

Abstract:
The talk will give an overview of theoretical results for learning from extremely n01sy data, including a boosting procedure and algorithms for learning decision trees, halfspaces, and parity functions.

No Comments :(