Generalization error bounds using Wasserstein distances.

Adrian Tovar Lopez
Adrian Tovar Lopez

ITW, pp.1-5, (2018)

Cited by: 0|Views1
EI

Abstract:

Generalization error of a learning algorithm characterizes the gap between an algorithm’s performance on test data versus performance on training data. In recent work, Xu u0026 Raginsky [1] showed that generalization error may be upper- bounded using the mutual information $I(S;W)$ between the input $S$ and the output $W$ of an algorithm....More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments