Generalization Guarantees via Algorithm-dependent Rademacher Complexity.

Sarah Sachs Tim van Erven Liam Hodgkinson Rajiv Khanna Umut Simsekli

Published in: CoRR (2023)

Keyphrases

learning algorithm
objective function
computational complexity
k means
theoretical analysis
error bounds
decision trees
active learning
probabilistic model
worst case