25,161
edits
Changes
Created page with "'''Home * People * Paul Fischer''' FILE:paulfischer.jpg|border|right|thumb|link=http://www2.imm.dtu.dk/~pafi/| Paul Fischer <ref>[http://www2.imm.dtu.dk/..."
'''[[Main Page|Home]] * [[People]] * Paul Fischer'''
[[FILE:paulfischer.jpg|border|right|thumb|link=http://www2.imm.dtu.dk/~pafi/| Paul Fischer <ref>[http://www2.imm.dtu.dk/~pafi/ Paul Fischer - Associate Professor]</ref> ]]
'''Paul Fischer''',<br/>
a German mathematician, computer scientist and associate professor and head of the algorithms, logic, and graphs (AlgoLoG) section <ref>[http://algolog.compute.dtu.dk/ AlgoLoG - The section for Algorithms, Logic and Graphs in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark]</ref> at [https://en.wikipedia.org/wiki/Technical_University_of_Denmark Technical University of Denmark], [https://en.wikipedia.org/wiki/Kongens_Lyngby Kongens Lyngby].
He holds a M.Sc. in 1983 and Ph.D. 1986 in mathematics from [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], and a [https://en.wikipedia.org/wiki/Habilitation habilitation] in CS from [[University of Dortmund]] in 1995 <ref>[http://www2.imm.dtu.dk/~pafi/CV.pdf Paul Fischer - CV]</ref>. His research interests include [https://en.wikipedia.org/wiki/Computability_theory computability theory] such as [https://en.wikipedia.org/wiki/Reduction_%28recursion_theory%29 reduction] of [https://en.wikipedia.org/wiki/Recursively_enumerable_set recursively enumerable] [https://en.wikipedia.org/wiki/Turing_degree Turing degrees] and [https://en.wikipedia.org/wiki/Truth-table_reduction weak truth-table degrees], [[Learning|algorithmic learning]], [https://en.wikipedia.org/wiki/Multi-armed_bandit bandit problems] and [https://en.wikipedia.org/wiki/Time_series time series] analysis.
He has also written about [[GUI]] [[Programming|programming]] using [[Java]] [https://en.wikipedia.org/wiki/Swing_%28Java%29 Swing] <ref>[[Paul Fischer]] ('''2005'''). ''An Introduction to Graphical User Interfaces with Java Swing''. [https://en.wikipedia.org/wiki/Pearson_Education Pearson Education], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley], [http://www.amazon.de/Introduction-Graphical-User-Interfaces-Swing/dp/0321220706 Amazon.de]</ref>.
=Bandit Problems=
In [https://en.wikipedia.org/wiki/Probability_theory probability theory], the [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problem] faces the tradeoff between [https://en.wikipedia.org/wiki/Exploitation_%28disambiguation%29 exploitation] of the [https://en.wikipedia.org/wiki/Slot_machine slot machine] that has the highest expected payoff and [https://en.wikipedia.org/wiki/Exploration exploration] to get more information about the expected payoffs of the other machines.
The trade-off between exploration and exploitation is also topic in [[Reinforcement Learning|reinforcement learning]] <ref>[https://en.wikipedia.org/wiki/Multi-armed_bandit Multi-armed bandit from Wikipedia]</ref>. The [https://en.wikipedia.org/wiki/Gambling gambler] has to decide at time steps t = 1, 2, ... which of the finitely many available arms to pull. Each arm produces a [https://en.wikipedia.org/wiki/Reward reward] in a [https://en.wikipedia.org/wiki/Stochastic stochastic] manner.
The goal is to maximize the reward accumulated over time. In 2002, along with [[Peter Auer]] and [[Nicolò Cesa-Bianchi]], Paul Fischer introduced the '''UCB1''' (Upper Confidence Bounds) bandit algorithm <ref>[[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''2002'''). ''[http://link.springer.com/article/10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 47, No. 2, [http://homes.di.unimi.it/~cesabian/Pubblicazioni/ml-02.pdf pdf]</ref>, which was applied as selection algorithm [[UCT]] to [[Monte-Carlo Tree Search]] as elaborated by [[Levente Kocsis]] and [[Csaba Szepesvári]] in 2006 <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/f/Fischer:Paul dblp: Paul Fischer]</ref> <ref>[http://www2.imm.dtu.dk/~pafi/Publications.pdf List of publications, Paul Fischer] (pdf)</ref>
==1983 ...==
* [[Paul Fischer]] ('''1983'''). ''Paare ohne Infimum in den rekursiv aufzählbaren Turing und wtt-Graden''. Masters thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University] (German)
* [[Paul Fischer]] ('''1986'''). ''Some Results on Recursively Enumerable Degrees of Weak Reducibilities''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University]
==1990 ...==
* [[Paul Fischer]] ('''1993'''). ''Finding Maximum Convex Polygons''. [http://dblp.uni-trier.de/db/conf/fct/fct93.html#Fischer93 FCT 1993], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 710, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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''. [http://dblp.uni-trier.de/db/journals/comgeo/comgeo7.html#Fischer97 Computational Geometry, Vol. 7]
* [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''1998'''). ''Finite-Time Regret Bounds for the Multiarmed Bandit Problem''. [http://dblp.uni-trier.de/db/conf/icml/icml1998.html#Cesa-BianchiF98 ICML 1998], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.4710 CiteSeerX]
* [[Paul Fischer]], [[Mathematician#HUSimon|Hans Ulrich Simon]] (eds.)('''1999'''). ''[http://www.springer.com/de/book/9783540657019 Computational Learning Theory]''. [http://dblp.uni-trier.de/db/conf/eurocolt/eurocolt1999.html EuroCOLT'99], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 1572, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
==2000 ...==
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''2002'''). ''[http://link.springer.com/article/10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 47, No. 2, [http://homes.di.unimi.it/~cesabian/Pubblicazioni/ml-02.pdf pdf]
* [[Paul Fischer]] ('''2005'''). ''An Introduction to Graphical User Interfaces with Java Swing''. [https://en.wikipedia.org/wiki/Pearson_Education Pearson Education], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley], [http://www.amazon.de/Introduction-Graphical-User-Interfaces-Swing/dp/0321220706 Amazon.de]
==2010 ...==
* [http://orbit.dtu.dk/en/persons/karunakar-reddy-bayyapu%2829aab3b6-8a0b-4ec6-bd28-9d7b111cdae1%29.html Karunakar Reddy Bayyapu], [[Paul Fischer]] ('''2015'''). ''[http://orbit.dtu.dk/en/publications/load-scheduling-in-a-cloud-based-massive-videostorage-environment%28d464ad92-a486-4d17-a0b7-9921b0c63bd5%29.html Load Scheduling in a Cloud Based Massive Video-Storage Environment]''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7031476 SYNASC 2014], DOI: [http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7034704 10.1109/SYNASC.2014.54]
=External Links=
* [http://www2.imm.dtu.dk/~pafi/ Paul Fischer - Associate Professor]
* [http://orbit.dtu.dk/en/persons/paul-fischer%28ae4cbb9c-32c6-4f88-a54d-d8663bee54f5%29.html Paul Fischer - DTU Orbit]
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Mathematician|Fischer]]
[[FILE:paulfischer.jpg|border|right|thumb|link=http://www2.imm.dtu.dk/~pafi/| Paul Fischer <ref>[http://www2.imm.dtu.dk/~pafi/ Paul Fischer - Associate Professor]</ref> ]]
'''Paul Fischer''',<br/>
a German mathematician, computer scientist and associate professor and head of the algorithms, logic, and graphs (AlgoLoG) section <ref>[http://algolog.compute.dtu.dk/ AlgoLoG - The section for Algorithms, Logic and Graphs in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark]</ref> at [https://en.wikipedia.org/wiki/Technical_University_of_Denmark Technical University of Denmark], [https://en.wikipedia.org/wiki/Kongens_Lyngby Kongens Lyngby].
He holds a M.Sc. in 1983 and Ph.D. 1986 in mathematics from [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University], and a [https://en.wikipedia.org/wiki/Habilitation habilitation] in CS from [[University of Dortmund]] in 1995 <ref>[http://www2.imm.dtu.dk/~pafi/CV.pdf Paul Fischer - CV]</ref>. His research interests include [https://en.wikipedia.org/wiki/Computability_theory computability theory] such as [https://en.wikipedia.org/wiki/Reduction_%28recursion_theory%29 reduction] of [https://en.wikipedia.org/wiki/Recursively_enumerable_set recursively enumerable] [https://en.wikipedia.org/wiki/Turing_degree Turing degrees] and [https://en.wikipedia.org/wiki/Truth-table_reduction weak truth-table degrees], [[Learning|algorithmic learning]], [https://en.wikipedia.org/wiki/Multi-armed_bandit bandit problems] and [https://en.wikipedia.org/wiki/Time_series time series] analysis.
He has also written about [[GUI]] [[Programming|programming]] using [[Java]] [https://en.wikipedia.org/wiki/Swing_%28Java%29 Swing] <ref>[[Paul Fischer]] ('''2005'''). ''An Introduction to Graphical User Interfaces with Java Swing''. [https://en.wikipedia.org/wiki/Pearson_Education Pearson Education], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley], [http://www.amazon.de/Introduction-Graphical-User-Interfaces-Swing/dp/0321220706 Amazon.de]</ref>.
=Bandit Problems=
In [https://en.wikipedia.org/wiki/Probability_theory probability theory], the [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problem] faces the tradeoff between [https://en.wikipedia.org/wiki/Exploitation_%28disambiguation%29 exploitation] of the [https://en.wikipedia.org/wiki/Slot_machine slot machine] that has the highest expected payoff and [https://en.wikipedia.org/wiki/Exploration exploration] to get more information about the expected payoffs of the other machines.
The trade-off between exploration and exploitation is also topic in [[Reinforcement Learning|reinforcement learning]] <ref>[https://en.wikipedia.org/wiki/Multi-armed_bandit Multi-armed bandit from Wikipedia]</ref>. The [https://en.wikipedia.org/wiki/Gambling gambler] has to decide at time steps t = 1, 2, ... which of the finitely many available arms to pull. Each arm produces a [https://en.wikipedia.org/wiki/Reward reward] in a [https://en.wikipedia.org/wiki/Stochastic stochastic] manner.
The goal is to maximize the reward accumulated over time. In 2002, along with [[Peter Auer]] and [[Nicolò Cesa-Bianchi]], Paul Fischer introduced the '''UCB1''' (Upper Confidence Bounds) bandit algorithm <ref>[[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''2002'''). ''[http://link.springer.com/article/10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 47, No. 2, [http://homes.di.unimi.it/~cesabian/Pubblicazioni/ml-02.pdf pdf]</ref>, which was applied as selection algorithm [[UCT]] to [[Monte-Carlo Tree Search]] as elaborated by [[Levente Kocsis]] and [[Csaba Szepesvári]] in 2006 <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/f/Fischer:Paul dblp: Paul Fischer]</ref> <ref>[http://www2.imm.dtu.dk/~pafi/Publications.pdf List of publications, Paul Fischer] (pdf)</ref>
==1983 ...==
* [[Paul Fischer]] ('''1983'''). ''Paare ohne Infimum in den rekursiv aufzählbaren Turing und wtt-Graden''. Masters thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University] (German)
* [[Paul Fischer]] ('''1986'''). ''Some Results on Recursively Enumerable Degrees of Weak Reducibilities''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Bielefeld_University Bielefeld University]
==1990 ...==
* [[Paul Fischer]] ('''1993'''). ''Finding Maximum Convex Polygons''. [http://dblp.uni-trier.de/db/conf/fct/fct93.html#Fischer93 FCT 1993], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 710, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media 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''. [http://dblp.uni-trier.de/db/journals/comgeo/comgeo7.html#Fischer97 Computational Geometry, Vol. 7]
* [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''1998'''). ''Finite-Time Regret Bounds for the Multiarmed Bandit Problem''. [http://dblp.uni-trier.de/db/conf/icml/icml1998.html#Cesa-BianchiF98 ICML 1998], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.4710 CiteSeerX]
* [[Paul Fischer]], [[Mathematician#HUSimon|Hans Ulrich Simon]] (eds.)('''1999'''). ''[http://www.springer.com/de/book/9783540657019 Computational Learning Theory]''. [http://dblp.uni-trier.de/db/conf/eurocolt/eurocolt1999.html EuroCOLT'99], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 1572, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
==2000 ...==
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Paul Fischer]] ('''2002'''). ''[http://link.springer.com/article/10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 47, No. 2, [http://homes.di.unimi.it/~cesabian/Pubblicazioni/ml-02.pdf pdf]
* [[Paul Fischer]] ('''2005'''). ''An Introduction to Graphical User Interfaces with Java Swing''. [https://en.wikipedia.org/wiki/Pearson_Education Pearson Education], [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley], [http://www.amazon.de/Introduction-Graphical-User-Interfaces-Swing/dp/0321220706 Amazon.de]
==2010 ...==
* [http://orbit.dtu.dk/en/persons/karunakar-reddy-bayyapu%2829aab3b6-8a0b-4ec6-bd28-9d7b111cdae1%29.html Karunakar Reddy Bayyapu], [[Paul Fischer]] ('''2015'''). ''[http://orbit.dtu.dk/en/publications/load-scheduling-in-a-cloud-based-massive-videostorage-environment%28d464ad92-a486-4d17-a0b7-9921b0c63bd5%29.html Load Scheduling in a Cloud Based Massive Video-Storage Environment]''. [http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7031476 SYNASC 2014], DOI: [http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7034704 10.1109/SYNASC.2014.54]
=External Links=
* [http://www2.imm.dtu.dk/~pafi/ Paul Fischer - Associate Professor]
* [http://orbit.dtu.dk/en/persons/paul-fischer%28ae4cbb9c-32c6-4f88-a54d-d8663bee54f5%29.html Paul Fischer - DTU Orbit]
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Mathematician|Fischer]]
