@inproceedings{ifac11, author = {F. Le and I. Markovsky and C. Freeman and E. Rogers}, title = {Recursive Identification of {H}ammerstein Structure}, booktitle = {In the Proc. of the 18th IFAC World Congress}, year = {2011}, month = {August}, address = {Milano, Italy} }

@inproceedings{acc11, author = {F. Le and I. Markovsky and C. Freeman and E. Rogers}, title = {Online identification of electrically stimulated muscle models}, year = {2011}, pages = {90--95}, month = {June}, booktitle = {In the Proc. of the American Control Conference (ACC)}, address = {San Francisco, USA}, issn = {0743-1619}, isbn = {978-1-4577-0080-4}, doi = {10.1109/ACC.2011.5991136} }

@inproceedings{mindstorms-med11, author = {I. Markovsky}, title = {Dynamical systems and control mindstorms}, year = {2012}, booktitle = {In the Proc. of the 20th Mediterranean Conference on Control and Automation}, pages = {54--59}, address = {Barcelona, Spain}, pdf = {http://eprints.soton.ac.uk/271926/1/med11.pdf}, abstract = {An unorthodox programme for teaching systems and control is developed and tested at the School of Electronics and Computer Science of the University of Southampton. Motivation for the employed teaching methods is Moore's method and S. Papert's book “Mindstorms: children, computers, and powerful ideas”. The teaching is shifted from lecture instruction to independent work on computer based projects and physical models. Our experience shows that involvement with projects is more effective in stimulating curiosity in systems and control related concepts and in achieving understanding of these concepts. The programme consists of two parts: 1) analytical and computational exercises, using Matlab/Octave, and 2) laboratory exercises, using programmable Lego mindstorms models. Both activities cut across several disciplines - physics, mathematics, computer programming, as well as the subject of the programme - systems and control theory.}, doi = {dx.doi.org/10.1109/MED.2012.6265614} }

@inproceedings{UM12, author = {K. Usevich and I. Markovsky}, title = {Structured low-rank approximation as a rational function minimization}, booktitle = {In the Proc. of the 16th IFAC Symposium on System Identification}, pages = {722--727}, address = {Brussels}, year = {2012}, pdf = {http://eprints.soton.ac.uk/273000/1/usevich_markovsky_sysid2012.pdf}, abstract = {Many problems of system identification, model reduction and signal processing can be posed and solved as a structured low-rank approximation problem (SLRA). In this paper a reformulation of SLRA as minimization of a multivariate rational function is considered. Using two different parametrizations, we show that the problem reduces to optimization over a compact manifold or to a set of optimization problems over bounded domains of Euclidean space. We make a review of methods of polynomial algebra for global optimization of the rational cost function.}, doi = {10.3182/20120711-3-BE-2027.00143} }

@inproceedings{M12, author = {I. Markovsky}, title = {How effective is the nuclear norm heuristic in solving data approximation problems?}, booktitle = {In the Proc. of the 16th IFAC Symposium on System Identification}, pages = {316--321}, address = {Brussels}, year = {2012}, pdf = {http://eprints.soton.ac.uk/336088/3/nucnrm-sysid.pdf}, software = {http://eprints.soton.ac.uk/336088/2/nucnrm-sysid-code.tar}, abstract = {The question in the title is answered empirically by solving instances of three classical problems: fitting a straight line to data, fitting a real exponent to data, and system identification in the errors-in-variables setting. The results show that the nuclear norm heuristic performs worse than alternative problem dependant methods—ordinary and total least squares, Kung’s method, and subspace identification. In the line fitting and exponential fitting problems, the globally optimal solution is known analytically, so that the suboptimality of the heuristic methods is quantified.}, doi = {10.3182/20120711-3-BE-2027.00125}, isbn = {978-3-902823-06-9} }

@inproceedings{cdc13a, author = {I. Markovsky}, title = {Exact identification with missing data}, booktitle = {In the Proc. of the 52nd IEEE Conference on Decision and Control}, year = {2013}, address = {Florence, Italy}, pages = {151--155}, doi = {10.1109/CDC.2013.6759874}, abstract = {The paper presents initial results on a subspace method for exact identification of a linear time-invariant system from data with missing values. The identification problem with missing data is equivalent to a Hankel structured low-rank matrix completion problem. The novel idea is to search systematically and use effectively completely specified submatrices of the incomplete Hankel matrix constructed from the given data. Nontrivial kernels of the rank-deficient completely specified submatrices carry information about the to-be-identified system. Combining this information into a full model of the identified system is a greatest common divisor computation problem. The developed subspace method has linear computational complexity in the number of data points and is therefore an attractive alternative to more expensive methods based on the nuclear norm heuristic.}, keywords = {subspace system identification, missing data, low-rank matrix completion, nuclear norm, realization.}, pdf = {http://homepages.vub.ac.be/~imarkovs/papers/cdc13a.pdf}, software = {http://homepages.vub.ac.be/~imarkovs/software/cdc13a.tar} }

@inproceedings{cdc13b, author = {I. Markovsky}, title = {Approximate identification with missing data}, booktitle = {In the Proc. of the 52nd IEEE Conference on Decision and Control}, year = {2013}, month = {December}, address = {Florence, Italy}, pages = {156--161}, doi = {10.1109/CDC.2013.6759875}, abstract = {Linear time-invariant system identification is considered in the behavioral setting. Nonstandard features of the problem are specification of missing and exact variables and identification from multiple time series with different length. The problem is equivalent to mosaic Hankel structured low-rank approximation with element-wise weighted cost function. Zero/infinite weights are assigned to the missing/exact data points. The problem is in general nonconvex. A solution method based on local optimization is outlined and compared with alternative methods on simulation examples. In a stochastic setting, the problem corresponds to errors-in-variables identification. A modification of the generic problem considered is presented that is a deterministic equivalent to the classical ARMAX identification. The modification is also a mosaic Hankel structured low-rank approximation problem.}, keywords = {system identification; behavioral approach; missing data; mosaic Hankel matrix; low-rank approximation}, pdf = {http://homepages.vub.ac.be/~imarkovs/papers/cdc13b.pdf}, software = {http://homepages.vub.ac.be/~imarkovs/software/cdc13b.tar} }

@inproceedings{mtns14, author = {M. Ishteva and I. Markovsky}, title = {Tensor low multilinear rank approximation by structured matrix low-rank approximation}, booktitle = {In the Proc. of the 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014)}, year = {2014}, month = {July}, address = {Groningen, The Netherlands}, pages = {1808--1812}, doi = {978-90-367-6321-9}, abstract = {Low-rank approximations play an important role in systems theory and signal processing. The problems of model reduction and system identification can be posed and solved as a low-rank approximation problem for structured matrices. On the other hand, signal source separation, nonlinear system identification, and multidimensional signal processing and data analysis can be approached with powerful methods of low-rank tensor factorizations. The proposed invited session is focused on theoretical and algorithmic aspects of matrix and tensor low-rank approximations, with applications in system theory and multidimensional signal processing.}, optkeywords = {}, pdf = {http://homepages.vub.ac.be/~imarkovs/papers/mtns14.pdf} }

@inproceedings{isma14, author = {I. Markovsky and R. Pintelon}, title = {Consistent estimation of autonomous linear time-invariant systems from multiple experiments}, booktitle = {In the Proc. of the Conference on Noise and Vibration Engineering (ISMA)}, year = {2014}, month = {September}, address = {Leuven, Belgium}, pages = {3265--3268}, optdoi = {}, abstract = {Operational modal analysis from impulse response data can alternatively be viewed as an identification of a stable autonomous linear time-invariant system. For example, earthquake response data of civil engineering structures and impulsive excitation of bridges leads to this problem. Identification from a single experiment, however, does not yield a consistent estimator in the output error setting due to the exponential decay of the noise-free signal. Using data from multiple experiments, on the other hand, is not straightforward because of the need to match the initial conditions in the repeated experiments. Consequently, we consider the identification from arbitrary initial conditions and show that consistent estimation is possible in this case. The computational method proposed in the paper is based on analytic elimination of the initial conditions (nuisance parameter) and local optimization over the remaining (model) parameters. It is implemented in a ready to use software package, available from \url{http://slra.github.io/software.html}}, pdf = {http://homepages.vub.ac.be/~imarkovs/papers/isma14.pdf}, isbn = {9789073802919} }

@inproceedings{Usevich14conf-Decomposing, author = {K. Usevich}, title = {Decomposing multivariate polynomials with structured low-rank matrix completion}, booktitle = {Proc. of the 21th International Symposium on Mathematical Theory of Networks and Systems}, year = {2014}, pages = {1826--1833}, abstract = {We are focused on numerical methods for decomposing a multivariate polynomial as a sum of univariate polynomials in linear forms. The main tool is the recent result on correspondence between the Waring rank of a homogeneous polynomial and the rank of a partially known quasi-Hankel matrix constructed from the coefficients of the polynomial. Based on this correspondence, we show that the original decomposition problem can be reformulated as structured low-rank matrix completion (or as structured low-rank approximation in the case of approximate decomposition). We construct algorithms for the polynomial decomposition problem. In the case of bivariate polynomials, we provide an extension of the well-known Sylvester algorithm for binary forms.} }

@inproceedings{VanMulders.etal14conf-Identification, author = {A. {Van Mulders} and L. Vanbeylen and K. Usevich}, title = {Identification of a block-structured model with several sources of nonlinearity}, booktitle = {Proc. of the 14th European Control Conference}, year = {2014}, abstract = {This paper focuses on a state-space based approach for the identification of a rather general nonlinear block-structured model. The model has several Single-Input Single-Output (SISO) static polynomial nonlinearities connected to a Multiple-Input Multiple-Output (MIMO) dynamic part. The presented method is an extension and improvement of prior work, where at most two nonlinearities could be identified. The location of the nonlinearities or their relation to other parts of the model does not have to be known beforehand: the method is a black-box approach, in which no states, internal signals or structural properties need to be measured or known. The first step is to estimate a partly structured polynomial (nonlinear) state-space model from input-output measurements. Secondly, an algebraic approach is used to split the dynamics and the nonlinearities by decomposing the multivariate polynomial coefficients.}, pages = {1717--1722}, doi = {10.1109/ECC.2014.6862455} }

@inproceedings{Usevich12conf-Improved, author = {K. Usevich}, title = {Improved initial approximation for errors-in-variables system identification}, booktitle = {Proc. of the 20th Mediterranean Conference on Control and Automation}, year = {2012}, pages = {198--203}, address = {Barcelona, Spain, 2012}, month = {July}, abstract = {Errors-in-variables system identification can be posed and solved as a Hankel structured low-rank approximation problem. In this paper different estimates based on suboptimal low-rank approximations are considered. The estimates are shown to have almost the same efficiency and lead to the same minimum when supplied as an initial approximation to local optimization solver of the structured low-rank approximation problem. In this paper it is shown that increasing Hankel matrix window length improves suboptimal estimates for autonomous systems and does not improve them for systems with inputs.}, doi = {10.1109/MED.2012.6265638} }

@inproceedings{IshSonPar13, title = {Unfolding latent tree structures using $4$th order tensors}, author = {M. Ishteva and L. Song and H. Park}, booktitle = {In Proc. of the International Conference on Machine Learning (ICML)}, year = {2013}, doi = {}, url = {http://jmlr.org/proceedings/papers/v28/ishteva13.html}, pdf = {http://jmlr.org/proceedings/papers/v28/ishteva13.pdf}, keywords = {latent tree graphical model, structure learning, quartet test, tensor, low rank, nuclear norm}, abstract = {Discovering the structures of latent variable models whose conditional independence structures are trees is an important yet challenging learning task. Existing approaches for this task often require the unknown number of hidden states as an input. In this paper, we propose a quartet based approach which is \emph{agnostic} to this number. The key contribution is a novel rank characterization of the tensor associated with the marginal distribution of a quartet. This characterization allows us to design a \emph{nuclear norm} based test for resolving quartet relations. We then use the quartet test as a subroutine in a divide-and-conquer algorithm for recovering the latent tree structure. We also derive the conditions under which the algorithm is consistent and its error probability decays exponentially with increasing sample size. We demonstrate that the proposed approach compares favorably to alternatives. In a real world stock dataset, it also discovers meaningful groupings of variables, and produces a model that fits the data better.} }

@inproceedings{SonIshParEtAl13, title = {Hierarchical tensor decomposition of latent tree graphical models}, author = {L. Song and M. Ishteva and A. Parikh and E. Xing and H. Park}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2013}, doi = {}, url = {http://jmlr.org/proceedings/papers/v28/song13.html}, pdf = {http://jmlr.org/proceedings/papers/v28/song13.pdf}, keywords = {parameter estimation, latent tree graphical model, hierarchical tensor decomposition, low rank}, abstract = {We approach the problem of estimating the parameters of a latent tree graphical model from a hierarchical tensor decomposition point of view. In this new view, the marginal probability table of the observed variables is treated as a tensor, and we show that: (i) the latent variables induce low rank structures in various matricizations of the tensor; (ii) this collection of low rank matricizations induces a hierarchical low rank decomposition of the tensor. We further derive an optimization problem for estimating (alternative) parameters of a latent tree graphical model, allowing us to represent the marginal probability table of the observed variables in a compact and robust way. The optimization problem aims to find the best hierarchical low rank approximation of a tensor in Frobenius norm. For correctly specified latent tree graphical models, we show that a global optimum of the optimization problem can be obtained via a recursive decomposition algorithm. This algorithm recovers previous spectral algorithms for hidden Markov models (Hsu et al., 2009; Foster et al., 2012) and latent tree graphical models (Parikh et al., 2011; Song et al., 2011) as special cases, elucidating the global objective these algorithms are optimizing. For misspecified latent tree graphical models, we derive a novel decomposition based on our framework, and provide approximation guarantee and computational complexity analysis. In both synthetic and real world data, this new estimator significantly improves over the state-of-the-art.} }

@inproceedings{DreIshSch15c1, author = {P. Dreesen and M. Ishteva and J. Schoukens}, title = {Recovering {W}iener-{H}ammerstein nonlinear state-space models using linear algebra}, booktitle = {In Proc. of the 17th IFAC Symposium on System Identification (SYSID 2015)}, year = {2015}, address = {Beijing, China}, pages = {} }

@inproceedings{DreIshSch15c2, author = {P. Dreesen and M. Ishteva and J. Schoukens}, title = {On the full and block-decoupling of nonlinear functions}, booktitle = {PAMM-Proceedings of Applied Mathematics and Mechanics}, year = {2015}, volume = {15}, number = {1}, pages = {739--742}, issn = {1617-7061}, url = {http://dx.doi.org/10.1002/pamm.201510352}, doi = {10.1002/pamm.201510352} }

*This file was generated by
bibtex2html 1.97.*