| Publication | Date of Publication | Type |
|---|
Asymptotic Nonparametric Statistical Analysis of Stationary Time Series
SpringerBriefs in Computer Science | 2023-01-04 | Paper |
Universal time-series forecasting with mixture predictors
SpringerBriefs in Computer Science | 2021-08-11 | Paper |
Time-series information and unsupervised learning of representations
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
On asymptotic and finite-time optimality of Bayesian predictors
| 2020-02-07 | Paper |
A confidence-set approach to signal denoising
Statistical Methodology | 2019-03-13 | Paper |
Hypotheses testing on infinite random graphs
| 2019-01-10 | Paper |
Universality of Bayesian mixture predictors
| 2019-01-10 | Paper |
Nonparametric Statistical Inference for Ergodic Processes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Things Bayes can't do
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Consistent algorithms for clustering time series
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Nonparametric multiple change point estimation in highly dependent time series
Theoretical Computer Science | 2016-02-26 | Paper |
Selecting near-optimal approximate state representations in reinforcement learning
Lecture Notes in Computer Science | 2015-01-14 | Paper |
A binary-classification-based metric between time-series distributions and its use in statistical and learning problems
| 2014-12-08 | Paper |
Regret bounds for restless Markov bandits
Theoretical Computer Science | 2014-10-31 | Paper |
Uniform hypothesis testing for finite-valued stationary processes
Statistics | 2014-07-11 | Paper |
On the relation between realizable and nonrealizable cases of the sequence prediction problem
| 2014-02-03 | Paper |
Nonparametric multiple change point estimation in highly dependent time series
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Unsupervised model-free representation learning
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Testing composite hypotheses about discrete ergodic processes
Test | 2013-02-05 | Paper |
Regret Bounds for Restless Markov Bandits
Lecture Notes in Computer Science | 2012-10-16 | Paper |
On finding predictors for arbitrary families of processes
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Pattern recognition for conditionally independent data
| 2011-10-12 | Paper |
Constructing perfect steganographic systems
Information and Computation | 2011-10-10 | Paper |
Uniform hypothesis testing for ergodic time series distributions
| 2011-07-21 | Paper |
Discrimination between B-processes is impossible
Journal of Theoretical Probability | 2010-06-09 | Paper |
Using data compressors to construct order tests for homogeneity and component independence
Applied Mathematics Letters | 2010-01-29 | Paper |
On the possibility of learning in reactive environments with arbitrary dependence
Theoretical Computer Science | 2008-10-22 | Paper |
Some Sufficient Conditions on an Arbitrary Class of Stochastic Processes for the Existence of a Predictor
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Predicting non-stationary processes
Applied Mathematics Letters | 2008-05-05 | Paper |
Sample complexity for computational classification problems
Algorithmica | 2007-11-28 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
