Trichotomy of rates in supervised learning
Amir Yehudayoff (Technion, Haifa)
06-Oct-2020, 16:30-17:00 (4 years ago)
Abstract: We show that in supervised learning there are only three learning rates possible: exponential, linear and arbitrarily slow. Joint work with Bousquet, Hanneke, Moran, and van Handel.
The talk will be structured for a general audience, and is meant to be understood by all.
computational complexitydiscrete mathematicscombinatorics
Audience: researchers in the topic
LA Combinatorics and Complexity Seminar
Series comments: Password is on the seminar page. www.math.ucla.edu/~pak/seminars/CCSem-Fall-2020.htm
| Organizers: | Igor Pak*, Greta Panova |
| *contact for this listing |
Export talk to