Regret bounds for sleeping experts and bandits.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 245, doi. 10.1007/s10994-010-5178-7
- By:
- Publication type:
- Article
Works matching IS 08856125 AND DT 2010 AND VI 80 AND IP 2-3
Results: 9
1
2
Time varying undirected graphs.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 295, doi. 10.1007/s10994-010-5180-0
- By:
- Publication type:
- Article
3
On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 141, doi. 10.1007/s10994-010-5173-z
- By:
- Publication type:
- Article
4
The true sample complexity of active learning.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 111, doi. 10.1007/s10994-010-5174-y
- By:
- Publication type:
- Article
5
Stability and model selection in k-means clustering.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 213, doi. 10.1007/s10994-010-5177-8
- By:
- Publication type:
- Article
6
Polynomial regression under arbitrary product distributions.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 273, doi. 10.1007/s10994-010-5179-6
- By:
- Publication type:
- Article
7
Guest editorial: special issue on learning theory.
- Published in:
- 2010
- By:
- Publication type:
- Editorial
8
Extracting certainty from uncertainty: regret bounded by variation in costs.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 165, doi. 10.1007/s10994-010-5175-x
- By:
- Publication type:
- Article
9
Preference-based learning to rank.
- Published in:
- Machine Learning, 2010, v. 80, n. 2-3, p. 189, doi. 10.1007/s10994-010-5176-9
- By:
- Publication type:
- Article