{'fraction_non_alphanumeric': 0.020134228187919462, 'fraction_numerical': 0.0008389261744966443, 'mean_word_length': 5.664804469273743, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
LPV subspace identification using a novel nuclear norm regularization method

It is well-known that recently proposed Linear Parameter-Varying (LPV) subspace identification techniques suffer from a curse of dimensionality leading to an ill-posed parameter estimation problem. In this paper we will focus on regularization methods to solve the parameter estimation problem. Tikhonov and TSVD regularization are conventional general-purpose regularization methods. These general-purpose regularization methods give preference to a solution with a small 2-norm. In principle many other types of additional information about the desired solution can be incorporated in order to stabilize the ill-posed problem. The main contribution of this paper is that we propose a novel regularization strategy for LPV subspace methods: the nuclear norm regularization method. By applying state-of-the-art convex optimization techniques, the method stabilizes the parameter estimation problem by including information on the desired solution that is specific to the (LPV) subspace identification scheme. We will conclude the paper with a summarizing comparison between the different regularization techniques.