Learning the Dependence Graph of Time Series with Latent Factors

作者: Sujay Sanghavi , Ali Jalali

DOI:

关键词:

摘要: This paper considers the problem of learning, from samples, dependency structure a system linear stochastic differential equations, when some variables are latent. We observe time evolution variables, and never other variables; this, we would like to find observed - separating out spurious interactions caused by latent variables' series. develop new convex optimization based method do so in case number is smaller than ones. For between sparse, theoretically establish high-dimensional scaling result for recovery. verify our theoretical with both synthetic real data (from stock market).

参考文章(47)
Philippe Marchal, Constructing a sequence of random walks strongly converging to Brownian motion Discrete Mathematics & Theoretical Computer Science. pp. 181- 190 ,(2003)
James Martens, Learning the Linear Dynamical System with ASOS international conference on machine learning. pp. 743- 750 ,(2010)
Zhouchen Lin, Arvind Ganesh, John Wright, Leqin Wu, Minming Chen, Yi Ma, None, Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix Coordinated Science Laboratory, University of Illinois at Urbana-Champaign. ,(2009)
W. D. Ray, Peter Young, Recursive Estimation and Time Series Analysis Journal of the Royal Statistical Society: Series A (General). ,vol. 149, pp. 280- 280 ,(1984) , 10.2307/2981573
P. Massart, B. Laurent, Adaptive estimation of a quadratic functional by model selection Annals of Statistics. ,vol. 28, pp. 1302- 1338 ,(2000) , 10.1214/AOS/1015957395
Neil D Lawrence, Mark Girolami, Magnus Rattray, Guido Sanguinetti, None, Learning and inference in computational systems biology MIT Press; 2010.. ,(2010)
Nathan Srebro, Ali Jalali, Clustering using Max-norm Constrained Optimization arXiv: Learning. ,(2012)