Daniil Ryabko
Daniil Ryabko
Неизвестная организация
Подтвержден адрес электронной почты в домене ryabko.net - Главная страница
Название
Процитировано
Процитировано
Год
Regret bounds for restless Markov bandits
R Ortner, D Ryabko, P Auer, R Munos
Theoretical Computer Science 558, 62-76, 2014
782014
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning
R Ortner, D Ryabko
NIPS, 1772-1780, 2012
712012
Nonparametric statistical inference for ergodic processes
D Ryabko, B Ryabko
Information Theory, IEEE Transactions on 56 (3), 1430-1435, 2010
45*2010
Consistent algorithms for clustering time series
A Khaleghi, D Ryabko, J Mary, P Preux
The Journal of Machine Learning Research 17 (1), 94-125, 2016
392016
Clustering processes
D Ryabko
arXiv preprint arXiv:1004.5194, 2010
392010
Asymptotically optimal perfect steganographic systems
BY Ryabko, DB Ryabko
Problems of Information Transmission 45 (2), 184-190, 2009
39*2009
Selecting the state-representation in reinforcement learning
OA Maillard, D Ryabko, R Munos
Advances in Neural Information Processing Systems, 2627-2635, 2011
352011
Online clustering of processes
A Khaleghi, D Ryabko, J Mary, P Preux
Artificial Intelligence and Statistics, 601-609, 2012
312012
Discrimination between B-processes is impossible
D Ryabko
Journal of Theoretical Probability 23 (2), 565-575, 2010
31*2010
On the possibility of learning in reactive environments with arbitrary dependence
D Ryabko, M Hutter
Theoretical Computer Science 405 (3), 274-284, 2008
28*2008
Optimal regret bounds for selecting the state representation in reinforcement learning
OA Maillard, P Nguyen, R Ortner, D Ryabko
International Conference on Machine Learning, 543-551, 2013
262013
Improved regret bounds for undiscounted continuous reinforcement learning
K Lakshmanan, R Ortner, D Ryabko
International Conference on Machine Learning, 524-532, 2015
252015
Selecting near-optimal approximate state representations in reinforcement learning
R Ortner, OA Maillard, D Ryabko
International Conference on Algorithmic Learning Theory, 140-154, 2014
222014
Locating changes in highly dependent data with unknown number of change points
A Khaleghi, D Ryabko
Advances in Neural Information Processing Systems 25, 3086-3094, 2012
222012
Predicting non-stationary processes
D Ryabko, M Hutter
Applied Mathematics Letters 21 (5), 477-482, 2008
22*2008
Testing composite hypotheses about discrete ergodic processes
D Ryabko
test 21 (2), 317-329, 2012
21*2012
Constructing perfect steganographic systems
B Ryabko, D Ryabko
Information and Computation 209 (9), 1223-1230, 2011
212011
Pattern recognition for conditionally independent data
D Ryabko
The Journal of Machine Learning Research 7, 645-664, 2006
21*2006
A binary-classification-based metric between time-series distributions and its use in statistical and learning problems
D Ryabko, J Mary
The Journal of Machine Learning Research 14 (1), 2837-2856, 2013
20*2013
Asymptotically consistent estimation of the number of change points in highly dependent time series
A Khaleghi, D Ryabko
International Conference on Machine Learning, 539-547, 2014
182014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20