701 search results - page 34 / 141 » Self Bounding Learning Algorithms |
169
click to vote
IWCLS
2007
Springer
15 years 6 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
151
click to vote
JMLR
2012
13 years 3 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
121
Voted
NIPS
2007
15 years 1 months ago
2007
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
83
Voted
ACL
2003
15 years 1 months ago
2003
This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of...
118
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— The popularity of IEEE 802.11 WLANs has led to dense deployments in urban areas. High density leads to suboptimal performance unless the interfering networks learn how to optim...