Research output

  1. Published

    When is Cartesian product a Cayley graph?

    Dobson, E., Hujdurovic, A., Imrich, W. & Ortner, R., 2023, Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. p. 362-367

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. Published

    Variational Regret Bounds for Reinforcement Learning

    Ortner, R., Gajane, P. & Auer, P., 2019.

    Research output: Contribution to conferencePaperpeer-review

  3. Published

    Variational Regret Bounds for Reinforcement Learning

    Ortner, R., Gajane, P. & Auer, P., 2019, Proceedings of The 35th Uncertainty in Artificial Intelligence Conference, UAI 2019. p. 81-90

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Published

    Understanding the Gaps in Satisficing Bandits

    Rouyer, C., Ortner, R. & Auer, P., 2024.

    Research output: Contribution to conferencePosterResearchpeer-review

  5. Published

    UCB Revisited: Improved Regret Bounds for the Stochastic Multi-Armed Bandit Problem

    Auer, P. & Ortner, R., 2010, In: Periodica Mathematica Hungarica. 61, p. 55-65

    Research output: Contribution to journalArticleResearchpeer-review

  6. Published

    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. p. 140-154

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  7. Published

    Reinforcement Learning

    Ortner, R., 2009.

    Research output: Contribution to conferencePosterResearchpeer-review

  8. Published

    Regret Bounds for Satisficing in Multi-Armed Bandit Problems

    Michel, T., Hajiabolhassan, H. & Ortner, R., Sept 2022.

    Research output: Contribution to conferencePosterResearchpeer-review

  9. Published

    Regret Bounds for Satisficing in Multi-Armed Bandit Problems

    Michel, T., Hajiabolhassan, H. & Ortner, R., 7 Jun 2023, In: Transactions on machine learning research. 2023, August, 19 p.

    Research output: Contribution to journalArticleResearchpeer-review

  10. Published

    Regret Bounds for Restless Markov Bandits

    Ortner, R., Ryabko, D., Auer, P. & Munos, R., 2012, Algorithmic Learning Theory 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings. p. 214-228

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

Previous 1 2 3 4 5 6 7 8 Next