| 2008 |
|---|
| 13 | EE | Ronald Ortner:
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions.
ALT 2008: 123-137 |
| 12 | EE | Peter Auer,
Thomas Jaksch,
Ronald Ortner:
Near-optimal Regret Bounds for Reinforcement Learning.
NIPS 2008: 89-96 |
| 11 | EE | Ronald Ortner:
Embeddability of arrangements of pseudocircles into the sphere.
Eur. J. Comb. 29(2): 457-469 (2008) |
| 2007 |
|---|
| 10 | EE | Ronald Ortner:
Pseudometrics for State Aggregation in Average Reward Markov Decision Processes.
ALT 2007: 373-387 |
| 9 | EE | Peter Auer,
Ronald Ortner,
Csaba Szepesvári:
Improved Rates for the Stochastic Continuum-Armed Bandit Problem.
COLT 2007: 454-468 |
| 8 | EE | Peter Auer,
Ronald Ortner:
A new PAC bound for intersection-closed concept classes.
Machine Learning 66(2-3): 151-163 (2007) |
| 7 | EE | Ronald Ortner:
Linear dependence of stationary distributions in ergodic Markov decision processes.
Oper. Res. Lett. 35(5): 619-626 (2007) |
| 2006 |
|---|
| 6 | EE | Peter Auer,
Ronald Ortner:
Logarithmic Online Regret Bounds for Undiscounted Reinforcement Learning.
NIPS 2006: 49-56 |
| 2005 |
|---|
| 5 | EE | Ronald Ortner:
Combinations and Mixtures of Optimal Policies in Unichain Markov Decision Processes are Optimal
CoRR abs/math/0508319: (2005) |
| 4 | EE | Ronald Ortner:
Embeddability of Arrangements of Pseudocircles into the Sphere
CoRR abs/math/0508320: (2005) |
| 2004 |
|---|
| 3 | EE | Peter Auer,
Ronald Ortner:
A New PAC Bound for Intersection-Closed Concept Classes.
COLT 2004: 408-414 |
| 2 | EE | Peter Auer,
Ronald Ortner:
A Boosting Approach to Multiple Instance Learning.
ECML 2004: 63-74 |
| 1 | EE | Johann Linhart,
Ronald Ortner:
On the Combinatorial Structure of Arrangements of Oriented Pseudocircles.
Electr. J. Comb. 11(1): (2004) |
