9 citations found. Retrieving documents...
von Neumann, J. 1927. Zur Theorie der Gesellschaftsspiele. Mathematische Annalen 100:295--320.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Maximizing the Margin with Boosting - Rätsch, Warmuth (2002)   (1 citation)  (Correct)

....example # is defined by # . Suppose we would combine all possible hypotheses from (assuming is finite) then the following well known theorem establishes the connection between margins and edges [first seen in connection with Boosting in 4, 2] Theorem 1 (Min Max Theorem, [22]) # 4 # (1) where and is the dimensional probability simplex. Thus, the minimal edge that can be achieved over all possible weightings of the training set is equal to the maximal margin of a combined ....

J. von Neumann. Zur Theorie der Gesellschaftsspiele. Math. Ann., 100:295--320, 1928.


Maximizing the Margin with Boosting - Rätsch, Warmuth (2002)   (1 citation)  (Correct)

.... of a given example (x, y) is defined by yf (x) Suppose we would combine all possible hypotheses from H (assuming H is finite) then the following well known theorem esblishes the connection between margins and edges [first seen in connection with Boosting in 4, 2] Theorem I (Min Max eorem, [22]) min min d hH n=l, N n=l k=l where d , and is the k dimensional probability simplex. Thus, the minimal edge if that can be achieved over all possible weightings d of the training set is equal to the maximal margin of a combined hypothesis from H. Also, for any non optimal weightings ....

J. von Neumann. Zur Theorie der Gesellschaftsspiele. Math. Ann., 100:295 320, 1928.


A Generalized Strategy Eliminability Criterion and.. - Conitzer, Sandholm (2005)   (Correct)

No context found.

von Neumann, J. 1927. Zur Theorie der Gesellschaftsspiele. Mathematische Annalen 100:295--320.


Marginal Boosting - Gunnar Atsch Manfred   (Correct)

No context found.

J. von Neumann. Zur Theorie der Gesellschaftsspiele. Math. Ann., 100:295--320, 1928.


Planning Algorithms - LaValle (2004)   (3 citations)  (Correct)

No context found.

J. von Neumann. Zur theorie der gesellschaftsspiele. Mathematische Annalen, 100:295--320, 1928.


Games, Walks and Grammars - Problems I've Worked on - Vervoort (2000)   (Correct)

No context found.

J. von Neumann, Zur Theorie der Gesellschaftsspiele, Mathematischen Annalen, Volume 100, p. 295-320, 1928.


Marginal Boosting - Rätsch, Warmuth (2001)   (Correct)

No context found.

J. von Neumann. Zur Theorie der Gesellschaftsspiele. Math. Ann., 100:295--320, 1928.


The Statistical Strength of Nonlocality Proofs - van Dam, Gill, Grünwald   (Correct)

No context found.

J. Von Neumann, "Zur Theorie der Gesellschaftsspiele", Mathematische Annalen, Volume 100, pp. 295--320, 1928.


The Origins of Dynamic Inventory Modelling under Uncertainty.. - Girlich, Chikán (1999)   (Correct)

No context found.

von Neumann, J., 1928. Zur Theorie der Gesellschaftsspiele. Math. Annalen 100: 295 - 320.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC