Unsupervised model-free representation learning
Daniil Ryabko

TL;DR
This paper introduces an unsupervised, model-free approach for learning representations of high-dimensional time-series data by maximizing a novel information criterion called time-series information, with implications for control tasks.
Contribution
It formulates a new unsupervised representation learning method for time-series data based on maximizing time-series information, including theoretical properties and control applications.
Findings
The representation function f maximizes time-series information.
Properties such as uniqueness and consistency are established.
Implications for optimal control are discussed.
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, which makes any inference rather challenging. To address this challenge, we formulate the following problem. Given a series of observations coming from a large (high-dimensional) space , find a representation function mapping to a finite space such that the series preserves as much information as possible about the original time-series dependence in . We show that, for stationary time series, the function can be selected as the one maximizing a certain information criterion that we call time-series information. Some properties of this functions are investigated, including its uniqueness and consistency of its…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Machine Learning and Algorithms · Control Systems and Identification
