12194 search results - page 138 / 2439 » Numberings Optimal for Learning |
181
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
140
click to vote
CIA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We adopt the Markov chain framework to model bilateral negotiations among agents in dynamic environments and use Bayesian learning to enable them to learn an optimal stra...
143
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
Gold’s original paper on inductive inference introduced a notion of an optimal learner. Intuitively, a learner identifies a class of objects optimally iff there is no other lea...
118
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, t...
148
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...