Result 1 to 20 of 45 total
Contextual bandit algorithms with supervised learning guarantees (English)
Journal of Machine Learning Research - Proceedings Track 15, 19-26 (2011).
1
Agnostic active learning without constraints. (English)
Comput. Res. Repos. 2010, Article No. 1006.2588 (2010).
2
An optimal high probability algorithm for the contextual bandit problem. (English)
Comput. Res. Repos. 2010, Article No. 1002.4058 (2010).
3
Agnostic active learning without constraints (English)
NIPS, 199-207 (2010).
4
Conditional probability tree estimation analysis and algorithms. (English)
Comput. Res. Repos. 2009, Article No. 0903.4217 (2009).
5
Error-correcting tournaments. (English)
Comput. Res. Repos. 2009, Article No. 0902.3176 (2009).
6
Error-correcting tournaments. (English)
Gavaldà, Ricard (ed.) et al., Algorithmic learning theory. 20th international conference, ALT 2009, Porto, Portugal, October 3‒5, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04413-7/pbk). Lecture Notes in Computer Science 5809. Lecture Notes in Artificial Intelligence, 247-262 (2009).
7
Agnostic active learning. (English)
J. Comput. Syst. Sci. 75, No. 1, 78-89 (2009).
8
Importance weighted active learning (English)
ICML, 7 (2009).
9
Tutorial summary: reductions in machine learning (English)
ICML, 172 (2009).
10
Error-correcting tournaments (English)
ALT, 247-262 (2009).
11
Conditional probability tree estimation analysis and algorithms (English)
UAI, 51-58 (2009).
12
The offset tree for learning with partial labels (English)
KDD, 129-138 (2009).
13
Robust reductions from ranking to classification. (English)
Mach. Learn. 72, No. 1-2, 139-153 (2008).
14
Importance weighted active learning. (English)
Comput. Res. Repos. 2008, Article No. 0812.4952 (2008).
15
The offset tree for learning with partial labels. (English)
Comput. Res. Repos. 2008, Article No. 0812.4044 (2008).
16
The benefits of directional antennas in heterogeneouswireless ad-hoc networks (English)
MASS, 442-449 (2008).
17
Scalable topology discovery and link state detection using routing events (English)
SRDS, 165-174 (2008).
18
Robust reductions from ranking to classification. (English)
Bshouty, Nader H. (ed.) et al., Learning theory. 20th annual conference on learning theory, COLT 2007, San Diego, CA, USA, June 13‒15, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72925-9). Lecture Notes in Computer Science 4539. Lecture Notes in Artificial Intelligence, 604-619 (2007).
19
Evaluation of optimization methods for network bottleneck diagnosis (English)
ICAC, 20 (2007).
20
Result 1 to 20 of 45 total
Start
Contact
Print
General Help
