Peter Auer

According to our database1, Peter Auer authored at least 86 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Variational Regret Bounds for Reinforcement Learning.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes.
Proceedings of the Conference on Learning Theory, 2019

Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information.
Proceedings of the Conference on Learning Theory, 2019

2018
Online Learning With Randomized Feedback Graphs for Optimal PUE Attacks in Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2018

2017
Online Learning.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

2016
Learning with Malicious Noise.
Encyclopedia of Algorithms, 2016

Guest editors' foreword.
Theor. Comput. Sci., 2016

An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits.
Proceedings of the 29th Conference on Learning Theory, 2016

Pareto Front Identification from Stochastic Bandit Feedback.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2014
Editors' Introduction.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013
Reinforcement Learning (Dagstuhl Seminar 13321).
Dagstuhl Reports, 2013

2012
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits.
Proceedings of the Workshop on On-line Trading of Exploration and Exploitation 2, 2012

Autonomous Exploration For Navigating In MDPs.
Proceedings of the COLT 2012, 2012

PAC-Bayesian Inequalities for Martingales.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

PAC Subset Selection in Stochastic Multi-armed Bandits.
Proceedings of the 29th International Conference on Machine Learning, 2012

Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments.
Proceedings of the Tenth European Workshop on Reinforcement Learning, 2012

Regret Bounds for Restless Markov Bandits.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Relevance Feedback Models for Content-Based Image Retrieval.
Proceedings of the Multimedia Analysis, Processing and Communications, 2011

Noisy Search with Comparative Feedback.
Proceedings of the UAI 2011, 2011

PAC-Bayesian Analysis of Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Exploration and Exploitation in Online Learning.
Proceedings of the Adaptive and Intelligent Systems - Second International Conference, 2011

Invited Talk: UCRL and Autonomous Exploration.
Proceedings of the Recent Advances in Reinforcement Learning - 9th European Workshop, 2011

Models for Autonomously Motivated Exploration in Reinforcement Learning.
Proceedings of the Discovery Science - 14th International Conference, 2011

Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

Models for Autonomously Motivated Exploration in Reinforcement Learning - (Extended Abstract).
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Online Learning.
Proceedings of the Encyclopedia of Machine Learning, 2010

UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem.
Periodica Mathematica Hungarica, 2010

Near-optimal Regret Bounds for Reinforcement Learning.
J. Mach. Learn. Res., 2010

Pinview: Implicit Feedback in Content-Based Image Retrieval.
Proceedings of the First Workshop on Applications of Pattern Analysis, 2010

Exploration-Exploitation of Eye Movement Enriched Multiple Feature Spaces for Content-Based Image Retrieval.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2010

2009
Consistent Interpretation of Image Sequences to Improve Object Models on the Fly.
Proceedings of the Computer Vision Systems, 2009

Workshop summary: On-line learning with limited feedback.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2008
Learning with Malicious Noise.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A learning rule for very simple universal approximators consisting of a single layer of perceptrons.
Neural Networks, 2008

Guest editors' introduction: Special issue on learning theory.
J. Comput. Syst. Sci., 2008

Near-optimal Regret Bounds for Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

An Efficient Search Algorithm for Content-Based Image Retrieval with User Feedback.
Proceedings of the Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007
Improved Rates for the Stochastic Continuum-Armed Bandit Problem.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Generic Object Recognition with Boosting.
IEEE Trans. Pattern Anal. Mach. Intell., 2006

A distributed voting scheme to maximize preferences.
ITA, 2006

Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Visual Classification of Images by Learning Geometric Appearances Through Boosting.
Proceedings of the Artificial Neural Networks in Pattern Recognition, Second IAPR Workshop, 2006

Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
A Simple Feature Extraction for High Dimensional Image Representations.
Proceedings of the Subspace, 2005

2004
Object Recognition Using Segmentation for Feature Detection.
Proceedings of the 17th International Conference on Pattern Recognition, 2004

A Boosting Approach to Multiple Instance Learning.
Proceedings of the Machine Learning: ECML 2004, 2004

Weak Hypotheses and Boosting for Generic Object Detection and Recognition.
Proceedings of the Computer Vision, 2004

A New PAC Bound for Intersection-Closed Concept Classes.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2002
The Nonstochastic Multiarmed Bandit Problem.
SIAM J. Comput., 2002

Finite-time Analysis of the Multiarmed Bandit Problem.
Machine Learning, 2002

Using Confidence Bounds for Exploitation-Exploration Trade-offs.
J. Mach. Learn. Res., 2002

Adaptive and Self-Confident On-Line Learning Algorithms.
J. Comput. Syst. Sci., 2002

The InfoSky visual explorer: exploiting hierarchical structure and document similarities.
Information Visualization, 2002

Reducing Communication for Distributed Learning in Neural Networks.
Proceedings of the Artificial Neural Networks, 2002

2000
Approximating Hyper-Rectangles: Learning and Pseudo-random Sets
Electronic Colloquium on Computational Complexity (ECCC), 2000

On-line Learning with Malicious Noise and the Closure Algorithm
Electronic Colloquium on Computational Complexity (ECCC), 2000

Tracking the best disjunction
Electronic Colloquium on Computational Complexity (ECCC), 2000

Learning Nested Differences in the Presence of Malicious Noise
Electronic Colloquium on Computational Complexity (ECCC), 2000

Gambling in a rigged casino: The adversarial multi-armed bandit problem
Electronic Colloquium on Computational Complexity (ECCC), 2000

Simulating Access to Hidden Information while Learning
Electronic Colloquium on Computational Complexity (ECCC), 2000

On Learning from Ambiguous Information
Electronic Colloquium on Computational Complexity (ECCC), 2000

On-line Learning of Rectangles in Noisy Environments
Electronic Colloquium on Computational Complexity (ECCC), 2000

Learning of Depth Two Neural Networks with Constant Fan-in at the Hidden Nodes
Electronic Colloquium on Computational Complexity (ECCC), 2000

On the Complexity of Function Learning
Electronic Colloquium on Computational Complexity (ECCC), 2000

Using Upper Confidence Bounds for Online Learning.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Adaptive and Self-Confident On-Line Learning Algorithms.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

An Improved On-line Algorithm for Learning Linear Evaluation Functions.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999
Structural Results About On-line Learning Models With and Without Queries.
Machine Learning, 1999

1998
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.
J. Comput. Syst. Sci., 1998

1997
The Perceptron Algorithm Versus Winnow: Linear Versus Logarithmic Mistake Bounds when Few Input Variables are Relevant (Technical Note).
Artif. Intell., 1997

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach.
Proceedings of the Fourteenth International Conference on Machine Learning (ICML 1997), 1997

1996
Tight Bounds on the Cumulative Profit of Distributed Voters (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract).
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995
Exponentially many local minima for single neurons.
Proceedings of the Advances in Neural Information Processing Systems 8, 1995

Theory and Applications of Agnostic PAC-Learning with Small Decision Trees.
Proceedings of the Machine Learning, 1995

Tracking the Best Disjunction.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Learning Nested Differences in the Presence of Malicious Noise.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives.
Neural Computation, 1994

Simulating access to hidden information while learning.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

On-line Learning with Malicious Noise and the Closure Algorithm.
Proceedings of the Algorithmic Learning Theory, 1994

1993
On the Complexity of Function Learning.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On-Line Learning of Rectangles in Noisy Environments.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1991
Unification in the Combination of Disjoint Theories.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991

Solving String Equations with Constant Restrictions.
Proceedings of the Word Equations and Related Topics, Second International Workshop, 1991


  Loading...