Blind Identification of ARX Models with Piecewise Constant Inputs

Blind system identification is known to be a hard ill-posed problem and without further assumptions, no unique solution is at hand. In this contribution, we are concerned with the task of identifying an ARX model from only output measurements. Driven by the task of identifying systems that are turned on and off at unknown times, we seek a piecewise constant input and a corresponding ARX model which approximates the measured outputs. We phrase this as a rank minimization problem and present a relaxed convex formulation to approximate its solution. The proposed method was developed to model power consumption of electrical appliances and is now a part of a bigger energy disaggregation framework. Code will be made available online.

[1]  Y. Nesterov Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[2]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[3]  Michel Verhaegen,et al.  Quadratic Basis Pursuit , 2013, 1301.7002.

[4]  Stephen P. Boyd,et al.  Segmentation of ARX-models using sum-of-norms regularization , 2010, Autom..

[5]  Karim Abed-Meraim,et al.  Blind system identification , 1997, Proc. IEEE.

[6]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[7]  Stephen P. Boyd,et al.  1 Trend Filtering , 2009, SIAM Rev..

[8]  A. Paulraj,et al.  Blind estimation of multiple co-channel digital signals using an antenna array , 1994, IEEE Signal Processing Letters.

[9]  J. Gallier Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[10]  Philippe Loubaton,et al.  On subspace methods for blind identification of single-input multiple-output FIR systems , 1997, IEEE Trans. Signal Process..

[11]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[12]  Emmanuel J. Candès,et al.  PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming , 2011, ArXiv.

[13]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[14]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[15]  James N. Caron,et al.  Efficient blind deconvolution of audio-frequency signal , 2004 .

[16]  Yingbo Hua,et al.  Fast maximum likelihood for blind identification of multiple FIR channels , 1996, IEEE Trans. Signal Process..

[17]  Justin K. Romberg,et al.  Blind Deconvolution Using Convex Programming , 2012, IEEE Transactions on Information Theory.

[18]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[19]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[20]  Ta-Hsin Li,et al.  Blind deconvolution of discrete-valued signals , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[21]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[22]  Henrik Ohlsson,et al.  A dynamical systems approach to energy disaggregation , 2013, 52nd IEEE Conference on Decision and Control.

[23]  G. Papanicolaou,et al.  Array imaging using intensity-only measurements , 2010 .

[24]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[25]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[26]  Emmanuel J. Candès,et al.  Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements , 2010, ArXiv.

[27]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[28]  J. Makhoul,et al.  Linear prediction: A tutorial review , 1975, Proceedings of the IEEE.

[29]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[30]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[31]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[32]  David Gesbert,et al.  On-line blind multichannel equalization based on mutually referenced filters , 1997, IEEE Trans. Signal Process..