Ronald Ortner

Publikationen

  1. 2016
  2. Veröffentlicht

    Improved Learning Complexity in Combinatorial Pure Exploration Bandits

    Gabillon, V., Lazaric, A., Ghavamzadeh, M., Ortner, R. & Bartlett, P. 10 Mai 2016

    Forschungsoutput: Forschung - (peer-reviewed)Poster

  3. Veröffentlicht

    Pareto Front Identification from Stochastic Bandit Feedback

    Auer, P., Chiang, C-K., Ortner, R. & Drugan, M. 10 Mai 2016

    Forschungsoutput: Forschung - (peer-reviewed)Poster

  4. Veröffentlicht

    Algorithmic Learning Theory: 27th International Conference, ALT 2016, Proceedings

    Ortner, R., Ulrich Simon, H. & Zilles, S. 2016 Springer.

    Forschungsoutput: ForschungSammelband

  5. Veröffentlicht

    Improved Learning Complexity in Combinatorial Pure Exploration Bandits

    Gabillon, V., Lazaric, A., Ghavamzadeh, M., Ortner, R. & Bartlett, P. 2016 Proceedings of the Nineteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2016. S. 1004-1012 (JMLR Workshop and Conference Proceedings)

    Forschungsoutput: ForschungBeitrag in Konferenzband

  6. Veröffentlicht

    Optimal Behavior is Easier to Learn than the Truth

    Ortner, R. 2016 in : Minds and Machines. 26, 3, S. 243-252

    Forschungsoutput: Forschung - (peer-reviewed)Artikel

  7. Veröffentlicht

    Pareto Front Identification from Stochastic Bandit Feedback

    Auer, P., Chiang, C-K., Ortner, R. & Drugan, M. 2016 Proceedings of the Nineteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2016. S. 939-947 (JMLR Workshop and Conference Proceedings)

    Forschungsoutput: ForschungBeitrag in Konferenzband

  8. 2015
  9. Veröffentlicht

    Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning

    Kailasam, L., Ortner, R. & Ryabko, D. 7 Jul 2015

    Forschungsoutput: Forschung - (peer-reviewed)Poster

  10. Veröffentlicht

    Forcing Subarrangements in Complete Arrangements of Pseudocircles

    Ortner, R. 2015 in : Journal of Computational Geometry. 6, 1, S. 235-248

    Forschungsoutput: Forschung - (peer-reviewed)Artikel

  11. 2014
  12. Veröffentlicht

    Regret Bounds for Restless Markov Bandits

    Ortner, R., Ryabko, D., Auer, P. & Munos, R. 2014 in : Theoretical computer science. 558, S. 62-76

    Forschungsoutput: Forschung - (peer-reviewed)Artikel

  13. Veröffentlicht

    Selecting Near-Optimal Approximate State Representations in Reinforcement Learning

    Ortner, R., Maillard, O-A. & Ryabko, D. 2014 Algorithmic Learning Theory - 25th International Conference, ALT 2014, Bled, October 8-10, 2014. S. 140-154

    Forschungsoutput: ForschungBeitrag in Konferenzband

Vorherige 1 2 3 4 5 6 Nächste