PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

EPrints submitted by Ronald Ortner

Click here to see user's record.

Number of EPrints submitted by this user: 28

A new PAC bound for intersection-closed concept classes
Peter Auer and Ronald Ortner
In: COLT 2004, 1-4 July 2004, Banff, Canada.

A boosting approach to multiple instance learning
Peter Auer and Ronald Ortner
In: ECML 2004, 20-24 Sep 2004, Pisa, Italy.

Online Regret Bounds for a New Reinforcement Learning Algorithm
Peter Auer and Ronald Ortner
In: 1st Austrian Cognitive Vision Workshop, 31 Jan 2005, Zell an der Pram, Austria.

Combinations and mixtures of optimal policies in unichain MDPs are optimal
Ronald Ortner
(2005) Cornell University.

A new PAC bound for intersection-closed concept classes
Peter Auer and Ronald Ortner
Machine Learning Volume 66, pp. 151-163, 2006.

A boosting approach to multiple instance learning
Peter Auer and Ronald Ortner
Journal of Machine Learning Research 2005.

Online Regret Bounds for a New Reinforcement Learning Algorithm
Peter Auer and Ronald Ortner
In: 1st Austrian Cognitive Vision Workshop, 31 Jan 2005, Zell an der Pram, Austria.

Online Regret Bounds for a New Reinforcement Learning Algorithm
Peter Auer and Ronald Ortner
(2005) Working Paper, University of Leoben.

To generalize is to be an idiot - or a machine: Machine learning and the problem of induction
Ronald Ortner
In: ESF Exploratory Workshop: Applied Logic in the Methodology of Science, 8-10 September 2006, Bristol, UK.

Logarithmic Online Regret Bound for Undiscounted Reinforcement Learning
Peter Auer and Ronald Ortner
In: NIPS 2006, 4-7 Dec 2006, Vancouver, Canada.

Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
Ronald Ortner
In: Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings Lecture Notes in Computer Science (4754). (2007) Springer , pp. 373-387. ISBN 978-3-540-75224-0

Linear Dependence of Stationary Distributions in Ergodic Markov Decision Processes
Ronald Ortner
Operations Research Letters Volume 35, Number 5, pp. 619-626, 2007.

Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning
Peter Auer and Ronald Ortner
In: Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 4-7, 2006 (2006) MIT Press , pp. 49-56. ISBN 0-262-19568-2

Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Peter Auer, Ronald Ortner and Csaba Szepesvari
In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings. Lecture Notes in Computer Science (4539). (2007) Springer , pp. 454-468. ISBN 978-3-540-72925-9

Optimism in the Face of Uncertainty Should be Refutable
Ronald Ortner
Minds and Machines Volume 18, Number 4, pp. 521-526, 2008.

Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Ronald Ortner
In: Proceedings of the 19th International Conference on Algorithmic Learning Theory Lecture Notes in Artificial Intelligence (5254). (2008) Springer , pp. 123-137.

Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Ronald Ortner
In: 19th International Conference on Algorithmic Learning Theory, 13-16 Oct 2008, Budapest, Hungary.

Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Ronald Ortner
Theoretical Computer Science Volume 411, Number 29-30, pp. 2684-2695, 2010. ISSN 0304-3975

Exploiting Similarity Information in Reinforcement Learning. Similarity Models for Multi-Armed Bandits and MDPs
Ronald Ortner
In: Proceedings of the 2nd International Conference on Agents and Artificial Intelligence (2010) INSTICC , pp. 203-210. ISBN 978-989-674-021-4

Exploiting Similarity Information in Reinforcement Learning. Similarity Models for Multi-Armed Bandits and MDPs
Ronald Ortner
In: 2nd International Conference on Agents and Artificial Intelligence (ICAART 2010), 22 - 24 January 2010, Valencia, Spain.

Combining Classifiers for Improved Multilabel Image Classification
Martin Antenreiter, Ronald Ortner and Peter Auer
In: Learning from Multi-label Data, MLD Workshop at ECML 2009, 7 September 2009, Bled, Slovenia.

Combining Classifiers for Improved Multilabel Image Classification
Martin Antenreiter, Ronald Ortner and Peter Auer
In: Learning from Multi-label Data, MLD Workshop at ECML 2009, 7 September 2009, Bled, Slovenia.

Near-optimal Regret Bounds for Reinforcement Learning
Thomas Jaksch, Ronald Ortner and Peter Auer
Journal of Machine Learning Research Volume 11, pp. 1563-1600, 2010.

UCB Revisited: Improved Regret Bounds for the Stochastic Multi-Armed Bandit Problem
Peter Auer and Ronald Ortner
Periodica Mathematica Hungarica Volume 61, Number 1-2, pp. 55-65, 2010. ISSN 0031-5303

Adaptive Aggregation for Reinforcement Learning in Average Reward Markov Decision Processes
Ronald Ortner
Annals of Operations Research 2011.

Competing with an Infinite Set of Models in Reinforcement Learning
Phuong Nguyen, Odalric-Ambrym Maillard, Daniil Ryabko and Ronald Ortner
In: AISTATS 2013, April 29 - May 1, 2013, Scottsdale, USA.

Regret Bounds for Restless Markov Bandits
Ronald Ortner
In: Algorithmic Learning Theory 23rd International Conference, ALT 2012, Lyon, France(2012).

Online Regret Bounds for Undiscounted Continuous Reinforcement Learning
Ronald Ortner and Daniil Ryabko
In: NIPS 2012, Lake Tahoe, USA(2012).