Chair of Information Technology (150)
Organisational unit: Chair
Research output
- Published
Simulating access to hidden information while learning
Auer, P. & Long, P. M., 1994, Proc. of the 26th Annual ACM Symposium on the Theory of Computing. p. 263-272Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
A new PAC bound for intersection-closed concept classes
Auer, P. & Ortner, R., 2007, In: Machine learning. 66, p. 151-163Research output: Contribution to journal › Article › Research › peer-review
- Published
Finite Time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N. & Fischer, P., 2002, In: Machine learning. 47, p. 235-256Research output: Contribution to journal › Article › Research › peer-review
- Published
Online Regret Bounds for a New Reinforcement Learning Algorithm
Auer, P. & Ortner, R., 2005, 1st Austrian Cognitive Vision Workshop. Österr. Computer-Ges., p. 35-42Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
On the Relative Frequency of Points Visited by random walk on Z^2
Auer, P. & Revesz, P., 1989, Colloquia Mathematica Societatis Janos Bolai, 57. Limit Theorem in Probability and Statistics, Pecs (Hungary). p. 27-33Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research
- Published
Using Upper Confidence Bounds for Online Learning
Auer, P., 2000, 41th Annual Symposium on Foundations of Computer Science. p. 270-293Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Finite Time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N. & Fischer, P., 1999, IT Workshop on Decision, Estimation, Classification and Imaging. p. ---Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Some Limit Theorems for the Homogeneous Poisson Process
Auer, P., Hornik, K. & Revesz, P., 1991, In: STATISTICS & PROBABILITY LETTERS (Statistics and probability letters : SPL). 12, p. 91-96Research output: Contribution to journal › Article › Research › peer-review
- Published
Hannan consistency in online learning in case of unbounded losses under partial monitoring
Auer, P., Allenberg, C., Györfi, L. & Ottucsák, G., 2006, Algorithmic Learning Theory. Springer, p. 229-243Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Tracking the Best Disjunction
Auer, P. & Warmuth, M. K., 1995, Proc. of the 36th Annual Sympsoium on Foundations of Computer Science. p. 312-321Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
