Unsupervised model-free representation learning - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

## Unsupervised model-free representation learning

Daniil Ryabko
• Function : Author

#### Abstract

Numerous control and learning problems face the situation where sequences of high-dimensional highly dependent data are available, but no or little feedback is provided to the learner. In such situations it may be useful to find a concise representation of the input signal, that would preserve as much as possible of the relevant information. In this work we are interested in the problems where the relevant information is in the time-series dependence. Thus, the problem can be formalized as follows. Given a series of observations $X_0,\dots,X_n$ coming from a large (high-dimensional) space $\cX$, find a representation function $f$ mapping $\cX$ to a finite space $\cY$ such that the series $f(X_0),\dots,f(X_n)$ preserve as much information as possible about the original time-series dependence in $X_0,\dots,X_n$. For stationary time series, the function $f$ can be selected as the one maximizing the time-series information $I_\infty(f)=h_0(f(X))- h_\infty (f(X))$ where $h_0(f(X))$ is the Shannon entropy of $f(X_0)$ and $h_\infty (f(X))$ is the entropy rate of the time series $f(X_0),\dots,f(X_n),\dots$. In this paper we study the functional $I_\infty(f)$ from the learning-theoretic point of view. Specifically, we provide some uniform approximation results, and study the behaviour of $I_\infty(f)$ in the problem of optimal control.

### Dates and versions

hal-00913244 , version 1 (03-12-2013)

### Identifiers

• HAL Id : hal-00913244 , version 1

### Cite

Daniil Ryabko. Unsupervised model-free representation learning. Proc. 24th International Conf. on Algorithmic Learning Theory (ALT'13), 2013, Singapore, Singapore. pp.354-366. ⟨hal-00913244⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

139 View