Jürgen Forster

发表

Relative Expected Instantaneous Loss Bounds

Manfred K. Warmuth, Jürgen Forster, J. Forster, 2000, J. Comput. Syst. Sci..

How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution

Hans Ulrich Simon, Dietrich Braess, Tomas Sauer, 2002, ALT.

On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes

Hans Ulrich Simon, Jürgen Forster, J. Forster, 2006, Theor. Comput. Sci..

A linear lower bound on the unbounded error probabilistic communication complexity

Jürgen Forster, J. Forster, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Relative Loss Bounds for Temporal-Difference Learning

Manfred K. Warmuth, Jürgen Forster, J. Forster, 2000, Machine Learning.

A linear lower bound on the unbounded error probabilistic communication complexity

Jürgen Forster, 2002, J. Comput. Syst. Sci..

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces

Hans Ulrich Simon, Thorsten Suttorp, Niels Schmitt, 2004, Machine Learning.

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

Satyanarayana V. Lokam, Hans Ulrich Simon, Matthias Krause, 2001, FSTTCS.

Learning Multiplicity Automata from Smallest Counterexamples

Jürgen Forster, 1999, EuroCOLT.

On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution

Hans Ulrich Simon, Jürgen Forster, J. Forster, 2002, ALT.

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces

Hans Ulrich Simon, Niels Schmitt, Jürgen Forster, 2001, COLT/EuroCOLT.

On Relative Loss Bounds in Generalized Linear Regression

Jürgen Forster, J. Forster, 1999, FCT.