Sledovat
Manfred K. Warmuth
Manfred K. Warmuth
visiting Google Brain
E-mailová adresa ověřena na: google.com - Domovská stránka
Název
Citace
Citace
Rok
The weighted majority algorithm
N Littlestone, MK Warmuth
Information and computation 108 (2), 212-261, 1994
30151994
Learnability and the Vapnik-Chervonenkis dimension
A Blumer, A Ehrenfeucht, D Haussler, MK Warmuth
Journal of the ACM (JACM) 36 (4), 929-965, 1989
26041989
Online passive-aggressive algorithms.
K Crammer, O Dekel, J Keshet, S Shalev-Shwartz, Y Singer, MK Warmuth
Journal of Machine Learning Research 7 (3), 2006
25552006
Occam's razor
A Blumer, A Ehrenfeucht, D Haussler, MK Warmuth
Information processing letters 24 (6), 377-380, 1987
15271987
Exponentiated gradient versus gradient descent for linear predictors
J Kivinen, MK Warmuth
information and computation 132 (1), 1-63, 1997
10221997
How to use expert advice
N Cesa-Bianchi, Y Freund, D Haussler, DP Helmbold, RE Schapire, ...
Journal of the ACM (JACM) 44 (3), 427-485, 1997
9801997
Tracking the best expert
M Herbster, MK Warmuth
Machine learning 32 (2), 151-178, 1998
7541998
On‐line portfolio selection using multiplicative updates
DP Helmbold, RE Schapire, Y Singer, MK Warmuth
Mathematical Finance 8 (4), 325-347, 1998
4641998
Active learning with support vector machines in the drug discovery process
MK Warmuth, J Liao, G Rätsch, M Mathieson, S Putta, C Lemmen
Journal of chemical information and computer sciences 43 (2), 667-673, 2003
4292003
Relative loss bounds for on-line density estimation with the exponential family of distributions
KS Azoury, MK Warmuth
Machine learning 43, 211-246, 2001
4142001
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
S Floyd, M Warmuth
Machine learning 21 (3), 269-304, 1995
3861995
Predicting {0, 1}-functions on randomly drawn points
D Haussler, N Littlestone, MK Warmuth
Information and Computation 115 (2), 248-292, 1994
3761994
Using and combining predictors that specialize
Y Freund, RE Schapire, Y Singer, MK Warmuth
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
3551997
Finding a shortest solution for the NxN extension of the 15-Puzzle is intractable
D Ratner, M Warmuth
Proceedings of the Fifth AAAI National Conference on Artificial Intelligence …, 1986
3301986
Relating data compression and learnability
N Littlestone, M Warmuth
Technical report, University of California Santa Cruz, 1986
3211986
Computing on an anonymous ring
H Attiya, M Snir, MK Warmuth
Journal of the ACM (JACM) 35 (4), 845-875, 1988
3121988
The CMU SPHINX-4 speech recognition system
P Lamere, P Kwok, E Gouvea, B Raj, R Singh, W Walker, M Warmuth, ...
Ieee intl. conf. on acoustics, speech and signal processing (icassp 2003 …, 2003
3022003
Equivalence of models for polynomial learnability
D Haussler, M Kearns, N Littlestone, MK Warmuth
Information and Computation 95 (2), 129-161, 1991
2841991
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
A Blumer, A Ehrenfeucht, D Haussler, M Warmuth
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2791986
Matrix exponentiated gradient updates for on-line learning and Bregman projection
K Tsuda, G Rätsch, MK Warmuth
Journal of Machine Learning Research 6 (Jun), 995-1018, 2005
2632005
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20