Skip to main content
guest
Join

Help

Sign In
chessprogramming
Home
guest

Join

Help

Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Paul Fischer
Edit
0
3
…
3
Tags
mathematician
people
programmers
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Paul Fischer
Paul Fischer
,
a German mathematician, computer scientist and associate professor and head of the algorithms, logic, and graphs (AlgoLoG) section
^{[1]}
at
Technical University of Denmark
,
Kongens Lyngby
. He holds a M.Sc. in 1983 and Ph.D. 1986 in mathematics from
Bielefeld University
, and a
habilitation
in CS from
University of Dortmund
in 1995
^{[2]}
. His research interests include
computability theory
such as
reduction
of
recursively enumerable
Turing degrees
and
weak truthtable degrees
,
algorithmic learning
,
bandit problems
and
time series
analysis. He has also written about
GUI
programming
using
Java
Swing
^{[3]}
.
Paul Fischer
^{[4]}
Table of Contents
Bandit Problems
Selected Publications
1983 ...
1990 ...
2000 ...
2010 ...
External Links
References
What links here?
Bandit Problems
In
probability theory
, the
multiarmed bandit problem
faces the tradeoff between
exploitation
of the
slot machine
that has the highest expected payoff and
exploration
to get more information about the expected payoffs of the other machines. The tradeoff between exploration and exploitation is also topic in
reinforcement learning
^{[5]}
. The
gambler
has to decide at time steps t = 1, 2, ... which of the finitely many available arms to pull. Each arm produces a
reward
in a
stochastic
manner. The goal is to maximize the reward accumulated over time. In 2002, along with
Peter Auer
and
Nicolò CesaBianchi
, Paul Fischer introduced the
UCB1
(Upper Confidence Bounds) bandit algorithm
^{[6]}
, which was applied as selection algorithm
UCT
to
MonteCarlo Tree Search
as elaborated by
Levente Kocsis
and
Csaba Szepesvári
in 2006
^{[7]}
.
Selected Publications
^{[8]}
^{[9]}
1983 ...
Paul Fischer
(
1983
).
Paare ohne Infimum in den rekursiv aufzählbaren Turing und wttGraden
. Masters thesis,
Bielefeld University
(German)
Paul Fischer
(
1986
).
Some Results on Recursively Enumerable Degrees of Weak Reducibilities
. Ph.D. thesis,
Bielefeld University
1990 ...
Paul Fischer
(
1993
).
Finding Maximum Convex Polygons
.
FCT 1993
,
LNCS
710,
Springer
Paul Fischer
(
1994
).
Über Algorithmisches Lernen
. Habilitation thesis,
University of Dortmund
(German)
Paul Fischer
(
1997
).
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
.
Computational Geometry, Vol. 7
Nicolò CesaBianchi
,
Paul Fischer
(
1998
).
FiniteTime Regret Bounds for the Multiarmed Bandit Problem
.
ICML 1998
,
CiteSeerX
Paul Fischer
,
Hans Ulrich Simon
(eds.)(
1999
).
Computational Learning Theory
.
EuroCOLT'99
,
LNCS
1572,
Springer
2000 ...
Peter Auer
,
Nicolò CesaBianchi
,
Paul Fischer
(
2002
).
Finitetime Analysis of the Multiarmed Bandit Problem
.
Machine Learning
, Vol. 47, No. 2,
pdf
Paul Fischer
(
2005
).
An Introduction to Graphical User Interfaces with Java Swing
.
Pearson Education
,
AddisonWesley
,
Amazon.de
2010 ...
Karunakar Reddy Bayyapu
,
Paul Fischer
(
2015
).
Load Scheduling in a Cloud Based Massive VideoStorage Environment
.
SYNASC 2014
, DOI:
10.1109/SYNASC.2014.54
External Links
Paul Fischer  Associate Professor
Paul Fischer  DTU Orbit
References
^
AlgoLoG  The section for Algorithms, Logic and Graphs in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark
^
Paul Fischer  CV
^
Paul Fischer
(
2005
).
An Introduction to Graphical User Interfaces with Java Swing
.
Pearson Education
,
AddisonWesley
,
Amazon.de
^
Paul Fischer  Associate Professor
^
Multiarmed bandit from Wikipedia
^
Peter Auer
,
Nicolò CesaBianchi
,
Paul Fischer
(
2002
).
Finitetime Analysis of the Multiarmed Bandit Problem
.
Machine Learning
, Vol. 47, No. 2,
pdf
^
Levente Kocsis
,
Csaba Szepesvári
(
2006
).
Bandit based MonteCarlo Planning
ECML06, LNCS/LNAI 4212,
pdf
^
dblp: Paul Fischer
^
List of publications, Paul Fischer
(pdf)
What links here?
Page
Date Edited
GUI
Mar 16, 2018
Java
Feb 25, 2018
Learning
Feb 20, 2018
Nicolò CesaBianchi
May 30, 2015
Paul Fischer
May 20, 2015
People
Feb 28, 2018
Peter Auer
May 29, 2015
UCT
Jan 22, 2018
University of Dortmund
Nov 25, 2016
Up one Level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
a German mathematician, computer scientist and associate professor and head of the algorithms, logic, and graphs (AlgoLoG) section ^{[1]} at Technical University of Denmark, Kongens Lyngby. He holds a M.Sc. in 1983 and Ph.D. 1986 in mathematics from Bielefeld University, and a habilitation in CS from University of Dortmund in 1995 ^{[2]}. His research interests include computability theory such as reduction of recursively enumerable Turing degrees and weak truthtable degrees, algorithmic learning, bandit problems and time series analysis. He has also written about GUI programming using Java Swing ^{[3]}.
Table of Contents
Bandit Problems
In probability theory, the multiarmed bandit problem faces the tradeoff between exploitation of the slot machine that has the highest expected payoff and exploration to get more information about the expected payoffs of the other machines. The tradeoff between exploration and exploitation is also topic in reinforcement learning ^{[5]}. The gambler has to decide at time steps t = 1, 2, ... which of the finitely many available arms to pull. Each arm produces a reward in a stochastic manner. The goal is to maximize the reward accumulated over time. In 2002, along with Peter Auer and Nicolò CesaBianchi, Paul Fischer introduced the UCB1 (Upper Confidence Bounds) bandit algorithm ^{[6]}, which was applied as selection algorithm UCT to MonteCarlo Tree Search as elaborated by Levente Kocsis and Csaba Szepesvári in 2006 ^{[7]}.Selected Publications
^{[8]} ^{[9]}1983 ...
1990 ...
2000 ...
2010 ...
External Links
References
What links here?
Up one Level