Sign inSign in

Adam Klivans is a professor specializing in algorithms and theoretical computer science.

More

Adam Klivans is a professor specializing in algorithms and theoretical computer science. In a research-level Simons Institute lecture, Klivans starts from the 2022 tester-learner definition and bounds sample complexity by Rademacher complexity rather than VC dimension.

Playlists

1

About

Adam Klivans is a professor specializing in algorithms and theoretical computer science. In a research-level Simons Institute lecture, Klivans starts from the 2022 tester-learner definition and bounds sample complexity by Rademacher complexity rather than VC dimension.

Connections

6

Their places, courses, books and lectures.