Department Mathematics and Information Technology
Organisational unit: Departments and Institutes
Research output
- Published
Regret Bounds for Restless Markov Bandits
Ortner, R., Ryabko, D., Auer, P. & Munos, R., 2014, In: Theoretical Computer Science. 558, p. 62-76Research output: Contribution to journal › Article › Research › peer-review
- Published
Regret Bounds for Reinforcement Learning via Markov Chain Concentration
Ortner, R., 23 Jan 2020, In: The journal of artificial intelligence research. 67.2020, 1, p. 115-128 14 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Regret Bounds for Reinforcement Learning via Markov Chain Concentration
Ortner, R., 26 Aug 2021.Research output: Contribution to conference › Poster › Research › peer-review
- E-pub ahead of print
Regret Bounds for Learning State Representations in Reinforcement Learning
Ortner, R., Pirotta, M., Lazaric, A., Fruit, R. & Maillard, O.-A., 2019, (E-pub ahead of print) Advances in Neural Information Processing Systems. Vol. 32. p. 12717 12727 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Regret Bounds for Learning State Representations in Reinforcement Learning
Ortner, R., Pirotta, M., Lazaric, A., Fruit, R. & Maillard, O.-A., Dec 2019.Research output: Contribution to conference › Poster › Research › peer-review
- Published
Reducing communication for distributed learning in neural networks
Auer, P., Burgsteiner, H. & Maass, W., 2002, Proc. of the International Conference on Artificial Neural Networks - ICANN 2002. p. 123-128Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
- Published
Reconstructing subgraph-counting graph polynomials of increasing families of graphs
Imrich, W., Bresar, B. & Klavzar, S., 2005, In: Discrete mathematics. 297, p. 159-166Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing median graphs in subquadratic time
Hagauer, J., Imrich, W. & Klavžar, S., 28 Feb 1999, In: Theoretical Computer Science. 215, 1-2, p. 123-136 14 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing Hamming graphs in linear time and space
Imrich, W. & Klavžr, S., 28 Jul 1997, In: Information processing letters. 63, 2, p. 91-95 5 p.Research output: Contribution to journal › Article › Research › peer-review
- Published
Recognizing halved cubes in a constant time per edge
Imrich, W., Klavẑar, S. & Vesel, A., Nov 1995, In: European journal of combinatorics . 16, 6, p. 617-621 5 p.Research output: Contribution to journal › Article › Research › peer-review
