In this paper, a new off-line model predictive control strategy is presented for a kind of linear parameter varying system with polytopic uncertainty. A nest of shrinking ellipsoids is constructed by solving linear matrix inequality. By splitting the objective function into two parts, the proposed strategy moves most computations off-line. The on-line computation is only calculating the current control to assure the system shrinking into the smaller ellipsoid. With the proposed formulation, the stability of the closed system is proved, followed with two numerical examples to demonstrate the proposed method’s effectiveness in the end.
Robust face clustering enjoys a wide range of applications for gate passes, surveillance systems and security analysis in embedded sensors. Nevertheless, existing algorithms have limitations in finding accurate clusters when data contain noise (e.g., occluded face clustering and recognition). It is known that in subspace clustering, the - and -norm regularizers can improve subspace preservation and connectivity, respectively, and the elastic net regularizer (i.e., the mixture of the - and -norms) provides a balance between the two properties. However, existing deterministic methods have high per iteration computational complexities, making them inapplicable to large-scale problems. To address this issue, this paper proposes the first accelerated stochastic variance reduction gradient (RASVRG) algorithm for robust subspace clustering. We also introduce a new momentum acceleration technique for the RASVRG algorithm. As a result of the involvement of this momentum, the RASVRG algorithm achieves both the best oracle complexity and the fastest convergence rate, and it reaches higher efficiency in practice for both strongly convex and not strongly convex models. Various experimental results show that the RASVRG algorithm outperformed existing state-of-the-art methods with elastic net and -norm regularizers in terms of accuracy in most cases. As demonstrated on real-world face datasets with different manually added levels of pixel corruption and occlusion situations, the RASVRG algorithm achieved much better performance in terms of accuracy and robustness.
This paper provides a strategy for the problem of robust model predictive control of constrained, discrete-time systems with state and output disturbances. Using the linear matrix inequality (LMI) method, the nested geometric proportion asymptotically stable ellipsoid (GPASE) strategy is designed off-line, and then the designed shrinking ellipsoids strategy assures the system converges on the equivalent with an exponential convergence velocity. The biggest advantage of this method is the online computation is almost reduced to zero, which makes it possible to apply the designed control scheme not only to plants with slowly varying parameters, but also to fast ones. Finally, a simulation example shows the validity of the proposed technique.
Due to the exponential disparity in the magnitude of high- and low-frequency components in the image frequency domain, existing frequency-domain enhancement methods for adversarial examples often fail to balance the perturbations of high- and low-frequency information. To address this issue, we propose a novel Spectral Space Transformation and Loss adjustment (SSTL) method. Specifically, SSTL introduces a frequency-domain rotation-and-self-mixing strategy that adaptively balances perturbations across high- and low-frequency components, thereby generating more transferable adversarial examples. Furthermore, to mitigate semantic degradation during reconstruction, we design a logits fine-tuning mechanism that up-weights the logits of true labels while suppressing others, effectively preserving the original semantic information and avoiding misleading gradient propagation. Various experimental results demonstrate that SSTL effectively improves adversarial transferability while significantly preserving the semantic information of each image.
30 May 2017 in Discrete Dynamics in Nature and Society
This paper proposes a synchronization scheme for two discrete-time chaotic systems with bounded disturbance. By using active control method and imposing some restriction on the error state, the computation of controller’s feedback matrix is converted to the min-max optimization problem. The theoretical results are derived with the aid of predictive model predictive paradigm and linear matrix inequality technique. Two example simulations are performed to show the effectiveness of the designed control method.