Ronald Ortner

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	A Note on the Bias and Kemeny's Constant in Markov Reward Processes with an Application to Markov Chain Perturbation	2024	Ronald Ortner
+ PDF Chat	A Note on the Bias and Kemeny's Constant in Markov Reward Processes with an Application to Markov Chain Perturbation	2024	Ronald Ortner
+	When is Cartesian product a Cayley graph?	2023	Edward Dobson Ademir Hujdurović Wilfried Imrich Ronald Ortner
+	Transfer in Reinforcement Learning via Regret Bounds for Learning Agents	2022	Adrienne Tuynman Ronald Ortner
+	Estimation	2022	Christos Dimitrakakis Ronald Ortner
+	Approximate Representations	2022	Christos Dimitrakakis Ronald Ortner
+ PDF Chat	Regret Bounds for Reinforcement Learning via Markov Chain Concentration	2020	Ronald Ortner
+	Variational Regret Bounds for Reinforcement Learning	2019	Pratik Gajane Ronald Ortner Peter Auer
+	Variational Regret Bounds for Reinforcement Learning	2019	Ronald Ortner Pratik Gajane Peter Auer
+	Autonomous exploration for navigating in non-stationary CMPs	2019	Pratik Gajane Ronald Ortner Peter Auer Csaba Szepesvári
+	Regret Bounds for Reinforcement Learning via Markov Chain Concentration	2018	Ronald Ortner
+	A Sliding-Window Algorithm for Markov Decision Processes with Arbitrarily Changing Rewards and Transitions.	2018	Pratik Gajane Ronald Ortner Peter Auer
+	Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning	2018	Ronan Fruit Matteo Pirotta Alessandro Lazaric Ronald Ortner
+	Regret Bounds for Reinforcement Learning via Markov Chain Concentration	2018	Ronald Ortner
+	A Sliding-Window Algorithm for Markov Decision Processes with Arbitrarily Changing Rewards and Transitions	2018	Pratik Gajane Ronald Ortner Peter Auer
+	Forcing subarrangements in complete arrangements of pseudocircles	2015	Ronald Ortner
+ PDF Chat	Regret bounds for restless Markov bandits	2014	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos
+	Selecting Near-Optimal Approximate State Representations in Reinforcement Learning	2014	Ronald Ortner Odalric-Ambrym Maillard Daniil Ryabko
+ PDF Chat	Selecting Near-Optimal Approximate State Representations in Reinforcement Learning	2014	Ronald Ortner Odalric-Ambrym Maillard Daniil Ryabko
+	Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning	2013	Odalric-Ambrym Maillard Phuong Nguyen Ronald Ortner Daniil Ryabko
+	Online Regret Bounds for Undiscounted Continuous Reinforcement Learning	2013	Ronald Ortner Daniil Ryabko
+	Regret Bounds for Restless Markov Bandits	2012	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos
+ PDF Chat	Regret Bounds for Restless Markov Bandits	2012	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos
+	Regret Bounds for Restless Markov Bandits	2012	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos
+ PDF Chat	Non-Backtracking Random Walks and Cogrowth of Graphs	2007	Ronald Ortner Wolfgang Woess
+	Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles	2007	Ronald Ortner
+	Embeddability of arrangements of pseudocircles into the sphere	2007	Ronald Ortner
+	Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles	2007	Ronald Ortner
+	A Short Note on Stationary Distributions of Unichain Markov Decision Processes	2006	Ronald Ortner
+	Combinations and Mixtures of Optimal Policies in Unichain Markov Decision Processes are Optimal	2005	Ronald Ortner
+	Embeddability of Arrangements of Pseudocircles into the Sphere	2005	Ronald Ortner
+ PDF Chat	On the Combinatorial Structure of Arrangements of Oriented Pseudocircles	2004	J.G. Linhart Ronald Ortner
+	Non-backtracking random walks and cogrowth of graphs	2004	Ronald Ortner Wolfgang Woess
+	Non-backtracking random walks and cogrowth of graphs	2004	Ronald Ortner Wolfgang Woess

Common Coauthors

Coauthor	Papers Together
Peter Auer	9
Daniil Ryabko	8
Pratik Gajane	5
Rémi Munos	4
Odalric-Ambrym Maillard	3
Wolfgang Woess	3
Christos Dimitrakakis	2
Adrienne Tuynman	1
Matteo Pirotta	1
Ademir Hujdurović	1
Phuong Nguyen	1
Ronan Fruit	1
J.G. Linhart	1
Alessandro Lazaric	1
Wilfried Imrich	1
Edward Dobson	1
Csaba Szepesvári	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs	2012	Peter L. Bartlett Ambuj Tewari	8
+	Selecting the State-Representation in Reinforcement Learning	2013	Odalric-Ambrym Maillard Daniil Ryabko Rémi Munos	4
+	Handbook of Convex Geometry	1993	Peter M. Gruber Jörg M. Wills	3
+	Online Regret Bounds for Undiscounted Continuous Reinforcement Learning	2013	Ronald Ortner Daniil Ryabko	3
+	Threshold limits for cover times	1991	David Aldous	3
+ PDF Chat	Feature Reinforcement Learning: Part I. Unstructured MDPs	2009	Marcus Hütter	3
+	On the possibility of learning in reactive environments with arbitrary dependence	2008	Daniil Ryabko Marcus Hütter	3
+	Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning	2013	Odalric-Ambrym Maillard Phuong Nguyen Ronald Ortner Daniil Ryabko	3
+	On K-Sets in Arrangements of Curves and Surfaces	2018	Micha Sharir	3
+	RANDOM WALKS ON INFINITE GRAPHS AND GROUPS (Cambridge Tracts in Mathematics 138)	2001	Laurent Saloff‐Coste	2
+	On Chebyshev-Type Inequalities for Primes	1982	M. Nair	2
+	Cogrowth of groups and simple random walks	1983	Wolfgang Woess	2
+	Cogrowth and amenability of discrete groups	1982	Joel M. Cohen	2
+	On the Folkman–Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3	2001	Jürgen Bokowski Susanne Mock Ileana Streinu	2
+ PDF Chat	Concentration inequalities for Markov chains by Marton couplings and spectral methods	2015	Daniel Paulin	2
+ PDF Chat	Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems	2012	Sébastien Bubeck Nicolò Cesa‐Bianchi	2
+ PDF Chat	A short proof of the Grigorchuk-Cohen cogrowth theorem	1989	Ryszard Szwarc	2
+	Counting Paths in Graphs	1999	Laurent Bartholdi	2
+ PDF Chat	Regret Bounds for Reinforcement Learning with Policy Advice	2013	Mohammad Gheshlaghi Azar Alessandro Lazaric Emma Brunskill	2
+ PDF Chat	Difference equations, isoperimetric inequality and transience of certain random walks	1984	Józef Dodziuk	2
+ PDF Chat	Full Banach Mean Values on Countable groups.	1959	Harry Kesten	2
+ PDF Chat	On the Combinatorial Structure of Arrangements of Oriented Pseudocircles	2004	J.G. Linhart Ronald Ortner	2
+	Venn Diagrams and Independent Families of Sets	1975	Branko Grünbaum	1
+ PDF Chat	Regret bounds for restless Markov bandits	2014	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos	1
+	Encyclopedia of Mathematics and its Applications.	1982	Y. L. L. William B. Jones W. J. Thron	1
+	Why is Posterior Sampling Better than Optimism for Reinforcement Learning	2016	Ian Osband Benjamin Van Roy	1
+	Handbook of Product Graphs	2011	Richard H. Hammack Wilfried Imrich Sandi Klavžar	1
+	Surprise-Based Intrinsic Motivation for Deep Reinforcement Learning	2017	Joshua Achiam S. Shankar Sastry	1
+	Curiosity-driven Exploration by Self-supervised Prediction	2017	Deepak Pathak Pulkit Agrawal Alexei A. Efros Trevor Darrell	1
+	Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems	2017	Mengdi Wang	1
+	On normality of n-Cayley graphs	2018	Ademir Hujdurović Klavdija Kutnar Dragan Marušič	1
+	Exploration in Structured Reinforcement Learning	2018	Jungseul Ok Alexandre Proutière Damianos Tranos	1
+	Provably Efficient Maximum Entropy Exploration	2018	Elad Hazan Sham M. Kakade Karan Singh Abby Van Soest	1
+	Variational Regret Bounds for Reinforcement Learning	2019	Pratik Gajane Ronald Ortner Peter Auer	1
+	Quasi-regular graphs, cogrowth, and amenability	2003	Sam Northshield	1
+	Multi-Armed Bandits in Metric Spaces	2008	Robert Kleinberg Aleksandrs Slivkins Eli Upfal	1
+ PDF Chat	Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems	2012	Sébastien Bubeck	1
+	A Topological Representation Theorem for Oriented Matroids	2002	Juergen Bokowski Simon King Susanne Mock Ileana Streinu	1
+	Regret Bounds for Restless Markov Bandits	2012	Ronald Ortner Daniil Ryabko Peter Auer Rémi Munos	1
+	Why is Posterior Sampling Better than Optimism for Reinforcement Learning?	2016	Ian Osband Benjamin Van Roy	1
+	Learning to Play With Intrinsically-Motivated, Self-Aware Agents	2018	Nick Haber Damian Mrowca Stephanie Wang Li Fei-Fei Daniel Yamins	1
+	Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning	2018	Ronan Fruit Matteo Pirotta Alessandro Lazaric Ronald Ortner	1
+	Exploration in Structured Reinforcement Learning	2018	Jungseul Ok Alexandre Proutière Damianos Tranos	1
+	Variational Regret Bounds for Reinforcement Learning	2019	Ronald Ortner Pratik Gajane Peter Auer	1
+ PDF Chat	Monte-Carlo utility estimates for Bayesian reinforcement learning	2013	Christos Dimitrakakis	1
+	Minimax Regret Bounds for Reinforcement Learning	2017	Mohammad Gheshlaghi Azar Ian Osband Rémi Munos	1
+	Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes	2018	Ronan Fruit Matteo Pirotta Alessandro Lazaric	1
+ PDF Chat	Selecting Near-Optimal Approximate State Representations in Reinforcement Learning	2014	Ronald Ortner Odalric-Ambrym Maillard Daniil Ryabko	1
+	Graphs, surfaces, and homology	1977	Peter Giblin	1
+	Empirical Bayes approach to multiparameter estimation: with special reference to multinomial distribution	1989	T. Lwin J. S. Maritz	1