default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniil Ryabko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[b3]Daniil Ryabko:
Universal Time-Series Forecasting with Mixture Predictors. Springer Briefs in Computer Science, Springer 2020, ISBN 978-3-030-54303-7, pp. 1-82- [j16]Daniil Ryabko
:
Time-Series Information and Unsupervised Learning of Representations. IEEE Trans. Inf. Theory 66(3): 1702-1713 (2020) - [c37]Azadeh Khaleghi, Daniil Ryabko:
Clustering piecewise stationary processes. ISIT 2020: 2753-2758 - [i39]Daniil Ryabko:
Universal time-series forecasting with mixture predictors. CoRR abs/2010.00297 (2020)
2010 – 2019
- 2019
- [b2]Daniil Ryabko:
Asymptotic Nonparametric Statistical Analysis of Stationary Time Series. Springer Briefs in Computer Science, Springer 2019, ISBN 978-3-030-12563-9, pp. 1-74 - [j15]Daniil Ryabko:
On Asymptotic and Finite-Time Optimality of Bayesian Predictors. J. Mach. Learn. Res. 20: 149:1-149:24 (2019) - [i38]Daniil Ryabko:
Asymptotic nonparametric statistical analysis of stationary time series. CoRR abs/1904.00173 (2019) - [i37]Azadeh Khaleghi, Daniil Ryabko:
Clustering piecewise stationary processes. CoRR abs/1906.10921 (2019) - 2018
- [i36]Daniil Ryabko:
Finite-time optimality of Bayesian predictors. CoRR abs/1812.08292 (2018) - 2017
- [c36]Daniil Ryabko:
Universality of Bayesian mixture predictors. ALT 2017: 57-71 - [c35]Daniil Ryabko:
Hypotheses testing on infinite random graphs. ALT 2017: 400-411 - [c34]Daniil Ryabko:
Independence clustering (without a matrix). NIPS 2017: 4013-4023 - [i35]Daniil Ryabko:
Independence clustering (without a matrix). CoRR abs/1703.06700 (2017) - [i34]Daniil Ryabko:
Hypotheses testing on infinite random graphs. CoRR abs/1708.03131 (2017) - 2016
- [j14]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Consistent Algorithms for Clustering Time Series. J. Mach. Learn. Res. 17: 3:1-3:32 (2016) - [j13]Azadeh Khaleghi, Daniil Ryabko:
Nonparametric multiple change point estimation in highly dependent time series. Theor. Comput. Sci. 620: 119-133 (2016) - [c33]Daniil Ryabko:
Things Bayes Can't Do. ALT 2016: 253-260 - [i33]Daniil Ryabko:
Things Bayes can't do. CoRR abs/1610.08239 (2016) - [i32]Daniil Ryabko:
Universality of Baysian mixture predictors. CoRR abs/1610.08249 (2016) - 2015
- [c32]K. Lakshmanan, Ronald Ortner, Daniil Ryabko:
Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning. ICML 2015: 524-532 - [c31]Amir Sani, Alessandro Lazaric, Daniil Ryabko:
The replacement bootstrap for dependent data. ISIT 2015: 1194-1198 - [c30]Daniil Ryabko, Boris Ryabko:
Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible. ISIT 2015: 1204-1206 - [i31]Daniil Ryabko, Boris Ryabko:
Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible. CoRR abs/1509.07776 (2015) - 2014
- [j12]Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos:
Regret bounds for restless Markov bandits. Theor. Comput. Sci. 558: 62-76 (2014) - [c29]Ronald Ortner, Odalric-Ambrym Maillard, Daniil Ryabko:
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning. ALT 2014: 140-154 - [c28]Azadeh Khaleghi, Daniil Ryabko:
Asymptotically consistent estimation of the number of change points in highly dependent time series. ICML 2014: 539-547 - [i30]Ronald Ortner, Odalric-Ambrym Maillard, Daniil Ryabko:
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning. CoRR abs/1405.2652 (2014) - 2013
- [j11]Daniil Ryabko, Jérémie Mary:
A binary-classification-based metric between time-series distributions and its use in statistical and learning problems. J. Mach. Learn. Res. 14(1): 2837-2856 (2013) - [c27]Phuong Nguyen, Odalric-Ambrym Maillard, Daniil Ryabko, Ronald Ortner:
Competing with an Infinite Set of Models in Reinforcement Learning. AISTATS 2013: 463-471 - [c26]Daniil Ryabko:
Unsupervised Model-Free Representation Learning. ALT 2013: 354-366 - [c25]Azadeh Khaleghi, Daniil Ryabko:
Nonparametric Multiple Change Point Estimation in Highly Dependent Time Series. ALT 2013: 382-396 - [c24]Odalric-Ambrym Maillard, Phuong Nguyen, Ronald Ortner, Daniil Ryabko:
Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning. ICML (1) 2013: 543-551 - [c23]Daniil Ryabko:
Time-series information and learning. ISIT 2013: 1392-1395 - [i29]Ronald Ortner, Daniil Ryabko:
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning. CoRR abs/1302.2550 (2013) - [i28]Odalric-Ambrym Maillard, Rémi Munos, Daniil Ryabko:
Selecting the State-Representation in Reinforcement Learning. CoRR abs/1302.2552 (2013) - [i27]Odalric-Ambrym Maillard, Phuong Nguyen, Ronald Ortner, Daniil Ryabko:
Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning. CoRR abs/1302.2553 (2013) - [i26]Azadeh Khaleghi, Daniil Ryabko:
A consistent clustering-based approach to estimating the number of change-points in highly dependent time-series. CoRR abs/1302.3407 (2013) - [i25]Daniil Ryabko:
Unsupervised model-free representation learning. CoRR abs/1304.4806 (2013) - 2012
- [c22]Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos:
Regret Bounds for Restless Markov Bandits. ALT 2012: 214-228 - [c21]Ronald Ortner, Daniil Ryabko:
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning. NIPS 2012: 1772-1780 - [c20]Daniil Ryabko, Jérémie Mary:
Reducing statistical time-series problems to binary classification. NIPS 2012: 2069-2077 - [c19]Azadeh Khaleghi, Daniil Ryabko:
Locating Changes in Highly Dependent Data with Unknown Number of Change Points. NIPS 2012: 3095-3103 - [c18]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Online Clustering of Processes. AISTATS 2012: 601-609 - [i24]Azadeh Khaleghi, Daniil Ryabko:
Multiple Change-Point Estimation in Stationary Ergodic Time-Series. CoRR abs/1203.1515 (2012) - [i23]Ronald Ortner, Daniil Ryabko, Peter Auer, Rémi Munos:
Regret Bounds for Restless Markov Bandits. CoRR abs/1209.2693 (2012) - [i22]Daniil Ryabko, Jérémie Mary:
Reducing statistical time-series problems to binary classification. CoRR abs/1210.6001 (2012) - 2011
- [b1]Daniil Ryabko:
Learnability in Problems of Sequential Inference. (Apprenabilité dans les ProblèMES de l'inféRence SéQuentielle). Lille University of Science and Technology, France, 2011 - [j10]Boris Ryabko, Daniil Ryabko:
Constructing perfect steganographic systems. Inf. Comput. 209(9): 1223-1230 (2011) - [j9]Daniil Ryabko:
On the Relation between Realizable and Nonrealizable Cases of the Sequence Prediction Problem. J. Mach. Learn. Res. 12: 2161-2180 (2011) - [c17]Boris Ryabko, Daniil Ryabko:
Confidence sets in time-series filtering. ISIT 2011: 2509-2511 - [c16]Odalric-Ambrym Maillard, Rémi Munos, Daniil Ryabko:
Selecting the State-Representation in Reinforcement Learning. NIPS 2011: 2627-2635 - 2010
- [j8]Daniil Ryabko:
On Finding Predictors for Arbitrary Families of Processes. J. Mach. Learn. Res. 11: 581-602 (2010) - [j7]Daniil Ryabko, Boris Ryabko:
Nonparametric statistical inference for ergodic processes. IEEE Trans. Inf. Theory 56(3): 1430-1435 (2010) - [c15]Daniil Ryabko:
Sequence Prediction in Realizable and Non-realizable Cases. COLT 2010: 119-131 - [c14]Daniil Ryabko:
Clustering processes. ICML 2010: 919-926 - [i21]Daniil Ryabko:
Clustering processes. CoRR abs/1004.5194 (2010) - [i20]Daniil Ryabko:
Clustering processes. CoRR abs/1005.0826 (2010) - [i19]Daniil Ryabko:
Sequence prediction in realizable and non-realizable cases. CoRR abs/1005.5603 (2010) - [i18]Boris Ryabko, Daniil Ryabko:
Confidence Sets in Time--Series Filtering. CoRR abs/1012.3059 (2010)
2000 – 2009
- 2009
- [j6]Daniil Ryabko, Jürgen Schmidhuber:
Using data compressors to construct order tests for homogeneity and component independence. Appl. Math. Lett. 22(7): 1029-1032 (2009) - [j5]B. Ya. Ryabko, Daniil Ryabko:
Asymptotically optimal perfect steganographic systems. Probl. Inf. Transm. 45(2): 184-190 (2009) - [c13]Jean-Yves Audibert, Peter Auer, Alessandro Lazaric, Rémi Munos, Daniil Ryabko, Csaba Szepesvári:
Workshop summary: On-line learning with limited feedback. ICML 2009: 8 - [c12]Daniil Ryabko:
An impossibility result for process discrimination. ISIT 2009: 1734-1738 - [c11]Boris Ryabko, Daniil Ryabko:
Using Kolmogorov complexity for understanding some limitations on steganography. ISIT 2009: 2733-2736 - [c10]Daniil Ryabko:
Characterizing predictable classes of processes. UAI 2009: 471-478 - [i17]Boris Ryabko, Daniil Ryabko:
Using Kolmogorov Complexity for Understanding Some Limitations on Steganography. CoRR abs/0901.4023 (2009) - [i16]Daniil Ryabko:
Characterizing predictable classes of processes. CoRR abs/0905.4341 (2009) - [i15]Daniil Ryabko:
A criterion for hypothesis testing for stationary processes. CoRR abs/0905.4937 (2009) - [i14]Daniil Ryabko:
On Finding Predictors for Arbitrary Families of Processes. CoRR abs/0912.4883 (2009) - 2008
- [j4]Daniil Ryabko, Marcus Hutter:
Predicting non-stationary processes. Appl. Math. Lett. 21(5): 477-482 (2008) - [j3]Daniil Ryabko, Marcus Hutter:
On the possibility of learning in reactive environments with arbitrary dependence. Theor. Comput. Sci. 405(3): 274-284 (2008) - [c9]Daniil Ryabko:
Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor. ALT 2008: 169-182 - [c8]Daniil Ryabko, Boris Ryabko:
On hypotheses testing for ergodic processes. ITW 2008: 281-283 - [e1]Sertan Girgin, Manuel Loth, Rémi Munos, Philippe Preux, Daniil Ryabko:
Recent Advances in Reinforcement Learning, 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30 - July 3, 2008, Revised and Selected Papers. Lecture Notes in Computer Science 5323, Springer 2008, ISBN 978-3-540-89721-7 [contents] - [i13]Daniil Ryabko, Boris Ryabko:
Testing Statistical Hypotheses About Ergodic Processes. CoRR abs/0804.0510 (2008) - [i12]Daniil Ryabko:
An impossibility result for process discrimination. CoRR abs/0809.1053 (2008) - [i11]Boris Ryabko, Daniil Ryabko:
Constructing Perfect Steganographic Systems. CoRR abs/0809.1593 (2008) - [i10]Daniil Ryabko, Marcus Hutter:
On the Possibility of Learning in Reactive Environments with Arbitrary Dependence. CoRR abs/0810.5636 (2008) - 2007
- [j2]Daniil Ryabko:
Sample Complexity for Computational Classification Problems. Algorithmica 49(1): 69-77 (2007) - [c7]Daniil Ryabko:
Testing Component Independence Using Data Compressors. ICANN (2) 2007: 808-815 - [c6]Daniil Ryabko, Marcus Hutter:
On Sequence Prediction for Arbitrary Measures. ISIT 2007: 2346-2350 - [c5]Boris Ryabko, Daniil Ryabko:
Information-Theoretic Approach to Steganographic Systems. ISIT 2007: 2461-2464 - [i9]Daniil Ryabko, Jürgen Schmidhuber:
Using Data Compressors to Construct Rank Tests. CoRR abs/0709.0670 (2007) - 2006
- [j1]Daniil Ryabko:
Pattern Recognition for Conditionally Independent Data. J. Mach. Learn. Res. 7: 645-664 (2006) - [c4]Daniil Ryabko, Marcus Hutter:
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence. ALT 2006: 334-347 - [i8]Daniil Ryabko, Marcus Hutter:
Sequence prediction for non-stationary processes. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i7]Daniil Ryabko, Marcus Hutter:
Learning in Reactive Environments with Arbitrary Dependence. Kolmogorov Complexity and Applications 2006 - [i6]Daniil Ryabko, Marcus Hutter:
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence. CoRR abs/cs/0603110 (2006) - [i5]Daniil Ryabko, Marcus Hutter:
On Sequence Prediction for Arbitrary Measures. CoRR abs/cs/0606077 (2006) - [i4]Boris Ryabko, Daniil Ryabko:
Provably Secure Universal Steganographic Systems. CoRR abs/cs/0606085 (2006) - [i3]Boris Ryabko, Daniil Ryabko:
Provably Secure Universal Steganographic Systems. IACR Cryptol. ePrint Arch. 2006: 63 (2006) - 2005
- [c3]Daniil Ryabko:
On Computability of Pattern Recognition Problems. ALT 2005: 148-156 - [i2]Daniil Ryabko:
On sample complexity for computational pattern recognition. CoRR abs/cs/0502074 (2005) - [i1]Daniil Ryabko:
Pattern Recognition for Conditionally Independent Data. CoRR abs/cs/0507040 (2005) - 2004
- [c2]Daniil Ryabko:
Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data. ALT 2004: 171-180 - [c1]Daniil Ryabko:
Online learning of conditionally I.I.D. data. ICML 2004
Coauthor Index
aka: B. Ya. Ryabko
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
