Abstract
The convergence behavior of traditional learning algorithms can be analyzed in the VC theoretical framework. Recently, many researchers have been interested in a class of randomized learning algorithms including the Gibbs algorithm from statistical mechanics. However, no successful theory concerning the generalization behavior of these randomized learning algorithms have been established previously. In order to fully understand the behavior of these randomized estimators, we shall compare them with regularization schemes for deterministic estimators. Furthermore, we present theoretical analysis for such algorithms which leads to rigorous convergence bounds.
| Original language | English (US) |
|---|---|
| Pages | 156-163 |
| Number of pages | 8 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) - Santa Cruz, CA, USA Duration: Jul 6 1999 → Jul 9 1999 |
Conference
| Conference | Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) |
|---|---|
| City | Santa Cruz, CA, USA |
| Period | 7/6/99 → 7/9/99 |
ASJC Scopus subject areas
- Computational Mathematics