Research output

61 - 70 out of 133Page size: 10

Sort by: Publication date

2008
Published
Guest editors' introduction: Special issue on learning theory
Auer, P. & Long, P. M., 1 Dec 2008, In: Journal of Computer and System Sciences. 74, 8, 1 p.
Research output: Contribution to journal › Editorial › peer-review
Published
A learning rule for very simple universal approximators consisting of a single layer of perceptrons
Auer, P., Burgsteiner, H. & Maass, W., 2008, In: Neural networks. 21, p. 786-795
Research output: Contribution to journal › Article › Research › peer-review
Published
An efficient search algorithm for content-based image retrieval with user feedback
Leung, P. & Auer, P., 2008, An efficient search algorithm for content-based image retrieval with user feedback. p. 0-0
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Learning with Malicious Noise
Auer, P., 2008, Encyclopedia of Algorithms. p. 1-99
Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research
Published
Near-optimal Regret Bounds for Reinforcement Learning
Auer, P., Jaksch, T. & Ortner, R., 2008.
Research output: Contribution to conference › Poster › Research › peer-review
2007
Published
A new PAC bound for intersection-closed concept classes
Auer, P. & Ortner, R., 2007, In: Machine learning. 66, p. 151-163
Research output: Contribution to journal › Article › Research › peer-review
Published
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Auer, P., Ortner, R. & Szepesvári, C., 2007, Proceedings of the 20th Annual Conference on Learning Theory. Springer, p. 454-468
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Logarithmic online regret bounds for undiscounted reinforcement learning
Auer, P. & Ortner, R., 2007, Advances in Neural Information Processing Systems 19. MIT Press, p. 49-56
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
2006
Published
Hannan consistency in on-line learning in case of unbounded losses under partial monitoring
Allenberg, C., Auer, P., Györfi, L. & Ottucsák, G., 1 Jan 2006, Algorithmic Learning Theory - 17th International Conference, ALT 2006, Proceedings. Springer Berlin, p. 229-243 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4264 LNAI).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
A Simple Feature Extraction for High Dimensional Image Representations
Savu-Krohn, C. & Auer, P., 2006, Subspace, Latent Structure and Feature Selection. p. 163-172
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Previous 1...3 4 5 6 7 8 9 10 ...14 Next

Research Portal

Research output

Guest editors' introduction: Special issue on learning theory

A learning rule for very simple universal approximators consisting of a single layer of perceptrons

An efficient search algorithm for content-based image retrieval with user feedback

Learning with Malicious Noise

Near-optimal Regret Bounds for Reinforcement Learning

A new PAC bound for intersection-closed concept classes

Improved Rates for the Stochastic Continuum-Armed Bandit Problem

Logarithmic online regret bounds for undiscounted reinforcement learning

Hannan consistency in on-line learning in case of unbounded losses under partial monitoring

A Simple Feature Extraction for High Dimensional Image Representations

Advanced filters