Compressing to VC dimension many pointsWARMUTH, Manfred K.Lecture notes in computer science. 2003, pp 743-744, issn 0302-9743, isbn 3-540-40720-0, 2 p.Conference Paper

Online variance minimizationWARMUTH, Manfred K; KUZMIN, Dima.Machine learning. 2012, Vol 87, Num 1, pp 1-32, issn 0885-6125, 32 p.Article

Learning theory and Kernel machines (Washington DC, 24-27 August 2003)Schölkopf, Bernhard; Warmuth, Manfred K.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40720-0, XIV, 746 p, isbn 3-540-40720-0Conference Proceedings

The optimal PAC algorithmWARMUTH, Manfred K.Lecture notes in computer science. 2004, pp 641-642, issn 0302-9743, isbn 3-540-22282-0, 2 p.Conference Paper

Can entropic regularization be replaced by squared euclidean distance plus additional linear constraintsWARMUTH, Manfred K.Lecture notes in computer science. 2006, pp 653-654, issn 0302-9743, isbn 3-540-35294-5, 1Vol, 2 p.Conference Paper

Subspace detection: A robust statistics formulationDASGUPTA, Sanjoy.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40720-0, p. 734Conference Paper

Tutorial: Machine learning methods in natural language processingCOLLINS, Michael.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40720-0, p. 655Conference Paper

Sequence prediction based on monotone complexityHUTTER, Marcus.Lecture notes in computer science. 2003, pp 506-521, issn 0302-9743, isbn 3-540-40720-0, 16 p.Conference Paper

Universal well-calibrated algorithm for on-line classificationVOVK, Vladimir.Lecture notes in computer science. 2003, pp 358-372, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Learning from uncertain dataMOHRI, Mehryar.Lecture notes in computer science. 2003, pp 656-670, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Robust regression by boosting the medianKEGL, Balazs.Lecture notes in computer science. 2003, pp 258-272, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Optimal rates of aggregationTSYBAKOV, Alexandre B.Lecture notes in computer science. 2003, pp 303-313, issn 0302-9743, isbn 3-540-40720-0, 11 p.Conference Paper

How fast is κ-means?DASGUPTA, Sanjoy.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40720-0, p. 735Conference Paper

Entropy bounds for restricted convex hullsKOLTCHINSKII, Vladimir.Lecture notes in computer science. 2003, pp 741-742, issn 0302-9743, isbn 3-540-40720-0, 2 p.Conference Paper

Simplified PAC-Bayesian margin boundsMCALLESTER, David.Lecture notes in computer science. 2003, pp 203-215, issn 0302-9743, isbn 3-540-40720-0, 13 p.Conference Paper

The p-norm generalization of the LMS algorithm for adaptive filteringKIVINEN, Jyrki; WARMUTH, Manfred K; HASSIBI, Babak et al.IEEE transactions on signal processing. 2006, Vol 54, Num 5, pp 1782-1793, issn 1053-587X, 12 p.Article

An open problem regarding the convergence of universal a priori probabilityHUTTER, Marcus.Lecture notes in computer science. 2003, pp 738-740, issn 0302-9743, isbn 3-540-40720-0, 3 p.Conference Paper

Learning and parsing stochastic Unification-Based GrammarsJOHNSON, Mark.Lecture notes in computer science. 2003, pp 671-683, issn 0302-9743, isbn 3-540-40720-0, 13 p.Conference Paper

Learning a function of r relevant variablesBLUM, Avrim.Lecture notes in computer science. 2003, pp 731-733, issn 0302-9743, isbn 3-540-40720-0, 3 p.Conference Paper

Comparing clusterings by the variation of informationMEIL, Marina.Lecture notes in computer science. 2003, pp 173-187, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Predicting nearly as well as the best pruning of a planar decision graphTAKIMOTO, Eiji; WARMUTH, Manfred K.Theoretical computer science. 2002, Vol 288, Num 2, pp 217-235, issn 0304-3975, 19 p.Conference Paper

Optimum follow the leader algorithmKUZMIN, Dima; WARMUTH, Manfred K.Lecture notes in computer science. 2005, pp 684-686, issn 0302-9743, isbn 3-540-26556-2, 3 p.Conference Paper

Maximizing the margin with boostingRÄTSCH, Gunnar; WARMUTH, Manfred K.Lecture notes in computer science. 2002, pp 334-350, issn 0302-9743, isbn 3-540-43836-X, 17 p.Conference Paper

Maximum margin algorithms with Boolean kernelsKHARDON, Roni; SERVEDIO, Rocco A.Lecture notes in computer science. 2003, pp 87-101, issn 0302-9743, isbn 3-540-40720-0, 15 p.Conference Paper

Exploiting task relatedness for multiple task learningBEN-DAVID, Shai; SCHULLER, Reba.Lecture notes in computer science. 2003, pp 567-580, issn 0302-9743, isbn 3-540-40720-0, 14 p.Conference Paper