Chair of Information Technology (150)
Organisational unit: Chair
Research output
- 2002
- Published
The nonstochastic multiarmed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, N. & Schapire, R. E., 2002, In: SIAM Journal on Computing. 32 (1), p. 48-77Research output: Contribution to journal › Article › Research › peer-review
- Published
Using confidence bounds for exploitation-exploration trade-offs
Auer, P., 2002, In: Journal of machine learning research (JMLR). p. 397-422Research output: Contribution to journal › Article › Research › peer-review
- 2000
- Published
Adaptive and Self-Confident On-Line Learning Algorithms
Auer, P. & Gentile, C., 2000, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000). Springer, p. 107-117Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
An Improved On-line Algorithm for Learning Linear Evaluation Functions
Auer, P., 2000, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000). Springer, p. 118-125Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- 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
- 1999
- 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
Structural Results About On-Line Learning Models With and Without Queries
Auer, P. & Long, P. M., 1999, In: Machine learning. 36, p. 147-181Research output: Contribution to journal › Article › Research › peer-review
- 1998
- Published
Approximating Hyper-Rechtangles: Learning and Pseudorandon Sets
Auer, P., Long, P. M. & Srinivasan, A., 1998, In: Journal of computer and system sciences (JCSS). 57, p. 376-388Research output: Contribution to journal › Article › Research › peer-review
- Published
Introduction to the Special Issue on Computational Learning Theory
Auer, P. & Maas, W., 1998, In: Algorithmica. 22, p. 1-2Research output: Contribution to journal › Article › Research › peer-review
- Published
On Learning from Ambiguous Information
Auer, P., 1998, In: Periodica polytechnica / Electrical engineering. 1, p. 115-122Research output: Contribution to journal › Article › Research › peer-review
- Published
On-line Learning with Malicious Noise and the Closure Algorithm
Auer, P. & Cesa-Bianchi, N., 1998, In: Annals of mathematics and artificial intelligence. 23, p. 83-99Research output: Contribution to journal › Article › Research › peer-review
- Published
Some thoughts on Boosting and Neural Networks
Auer, P., 1998, 3. Cottbuser Workshop "Aspekte des Neuronalen Lernens". p. 11-28Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Tracking the Best Disjunction
Auer, P. & Warmuth, M. K., 1998, In: Machine learning. 32, p. 127-150Research output: Contribution to journal › Article › Research › peer-review
- 1997
- Published
Approximating Hyper-Rectangles: Learning and Pseudo-random Sets
Auer, P., Long, P. M. & Srinivasan, A., 1997, Proc. 29th Ann. Symp. Theory of Computing. p. 314-323Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Learning Nested Differences in the Presence of Malicious Noise
Auer, P., 1997, In: Theoretical Computer Science. 185, p. 159-175Research output: Contribution to journal › Article › Research › peer-review
- Published
On Learning from Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach
Auer, P., 1997, On Learning from Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach. p. 21-29Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
The Perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant
Auer, P., Kivinen, J. & Warmuth, M. K., 1997, In: Artificial intelligence. p. 325-343Research output: Contribution to journal › Article › Research › peer-review
- 1996
- Published
Exponentially Many Local Minima for Single Neurons
Auer, P., Herbster, M. & Warmuth, M. K., 1996, Advances in Neural Information Processing System 8. MIT Press, p. 316-322Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Learning of Depth Two Neurals Nets with Constant Fan-in at the Hidden Nodes
Auer, P., Kwek, S., Maass, W. & Warmuth, M. K., 1996, Proc. of the Ninth Annual ACM Conference on Computational Learning Theory. p. 333-343Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Limit Laws for the Maximal and Minimal Increments of the Poisson Process
Auer, P. & Hornik, K., 1996, In: Studia Scientiarum Mathematicarum Hungarica. 31, p. 1-13Research output: Contribution to journal › Article › Research › peer-review
