# American Institute of Mathematical Sciences

• Previous Article
A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems
• BDIA Home
• This Issue
• Next Article
Selective further learning of hybrid ensemble for class imbalanced increment learning
January  2017, 2(1): 23-37. doi: 10.3934/bdia.2017006

## An evolutionary multiobjective method for low-rank and sparse matrix decomposition

 School of Electronics and Information, Northwestern Polytechnical University, 127 West Youyi Road, Xi'an Shaanxi, 710072, China

* Corresponding author: Tao Wu

Published  September 2017

This paper addresses the problem of finding the low-rank and sparse components of a given matrix. The problem involves two conflicting objective functions, reducing the rank and sparsity of each part simultaneously. Previous methods combine two objectives into a single objective penalty function to solve with traditional numerical optimization approaches. The main contribution of this paper is to put forward a multiobjective method to decompose the given matrix into low-rank component and sparse part. We optimize two objective functions with an evolutionary multiobjective algorithm MOEA/D. Another contribution of this paper, a modified low-rank and sparse matrix model is proposed, which simplifying the variable of objective functions and improving the efficiency of multiobjective optimization. The proposed method obtains a set of solutions with different trade-off between low-rank and sparse objectives, and decision makers can choose one or more satisfied decomposed results according to different requirements directly. Experiments conducted on artificial datasets and nature images, show that the proposed method always obtains satisfied results, and the convergence, stability and robustness of the proposed method is acceptable.

Citation: Tao Wu, Yu Lei, Jiao Shi, Maoguo Gong. An evolutionary multiobjective method for low-rank and sparse matrix decomposition. Big Data & Information Analytics, 2017, 2 (1) : 23-37. doi: 10.3934/bdia.2017006
##### References:

show all references

##### References:
The distributions of nondominated solutions, dominated solutions and Pareto front in the objective space of the two objectives problem.
Error of sparse component recovering by the ADM method for LRSMD with different choices of the parameter $\lambda$
The Pareto front, two objective functions corresponding to the solutions and box-plot for $ErrLR$ and $ErrSP$ by running 30 times independent experiments. Three rows represent experiment on the data with size:$20\times 20$, rank: 5, sparsity: 0.2, size: $50\times 50$, rank: 5, sparsity: 0.2 and size: $100\times 100$, rank: 5, sparsity: 0.5 respectively.
Box-plot about $ErrLR$ and $ErrSP$ for data with different noise. (a): number of noise points is 20, $\sigma=1$. (b): number of noise points is 20, $\sigma=5$. (c): number of noise points is 20, $\sigma=15$. (d): number of noise points is 50, $\sigma=5$. (e): number of noise points is 50, $\sigma=15$.
The Pareto front and two objective functions corresponding to the solutions for noise data. Noise type: number of noise points is 50 and $\sigma =15$.
The Pareto front and decomposed results with image lena. (a) is Pareto front of MOLRSMD and (b) is three different decomposed results selected form Pareto front, and they locate at the top, middle and bottom of Pareto front, respectively.
The Pareto front and decomposed results with image face. (a) is Pareto front of MOLRSMD and (b) is three different decomposed results selected form Pareto front, and they locate at the top, middle and bottom of Pareto front, respectively.
Results of the proposed MOLRSMD compared with ADM and ALM. The test dataset size is $50\times 50$, rank equals 5 and sparsity is 0.2.
The Parameters in the MOLRSMD used in the Experiments
 Parameter Meaning Value $N$ The number of subproblems 100 $T$ The number of neighbors 20 $t_{max}$ The maximum of generations 300 $pc$ The probability of crossover 0.8 $pd$ The differential multiplier 0.5 $pm$ The probability of mutation 0.2 $ps$ The probability of mutation selection 0.85
 Parameter Meaning Value $N$ The number of subproblems 100 $T$ The number of neighbors 20 $t_{max}$ The maximum of generations 300 $pc$ The probability of crossover 0.8 $pd$ The differential multiplier 0.5 $pm$ The probability of mutation 0.2 $ps$ The probability of mutation selection 0.85
Errors of the proposed MOLRSMD compared with ADM and ALM.
 Methods $ErrLR$ $ErrSP$ $ErrT$ MOLRSMD 0.0100 0.1986 0 ADM 0.0299 0.1331 1.9135e-17 ALM 0.0148 0.0661 2.2412e-10
 Methods $ErrLR$ $ErrSP$ $ErrT$ MOLRSMD 0.0100 0.1986 0 ADM 0.0299 0.1331 1.9135e-17 ALM 0.0148 0.0661 2.2412e-10
 [1] Mingchao Zhao, You-Wei Wen, Michael Ng, Hongwei Li. A nonlocal low rank model for poisson noise removal. Inverse Problems & Imaging, 2021, 15 (3) : 519-537. doi: 10.3934/ipi.2021003 [2] Manfred Einsiedler, Elon Lindenstrauss. On measures invariant under diagonalizable actions: the Rank-One case and the general Low-Entropy method. Journal of Modern Dynamics, 2008, 2 (1) : 83-128. doi: 10.3934/jmd.2008.2.83 [3] Jiahui Chen, Rundong Zhao, Yiying Tong, Guo-Wei Wei. Evolutionary de Rham-Hodge method. Discrete & Continuous Dynamical Systems - B, 2021, 26 (7) : 3785-3821. doi: 10.3934/dcdsb.2020257 [4] Najeeb Abdulaleem. $V$-$E$-invexity in $E$-differentiable multiobjective programming. Numerical Algebra, Control & Optimization, 2021  doi: 10.3934/naco.2021014 [5] Simone Cacace, Maurizio Falcone. A dynamic domain decomposition for the eikonal-diffusion equation. Discrete & Continuous Dynamical Systems - S, 2016, 9 (1) : 109-123. doi: 10.3934/dcdss.2016.9.109 [6] Thomas Alazard. A minicourse on the low Mach number limit. Discrete & Continuous Dynamical Systems - S, 2008, 1 (3) : 365-404. doi: 10.3934/dcdss.2008.1.365 [7] Lara Abi Rizk, Jean-Baptiste Burie, Arnaud Ducrot. Asymptotic speed of spread for a nonlocal evolutionary-epidemic system. Discrete & Continuous Dynamical Systems, 2021  doi: 10.3934/dcds.2021064 [8] Mario Pulvirenti, Sergio Simonella. On the cardinality of collisional clusters for hard spheres at low density. Discrete & Continuous Dynamical Systems, 2021, 41 (8) : 3903-3914. doi: 10.3934/dcds.2021021 [9] J. Frédéric Bonnans, Justina Gianatti, Francisco J. Silva. On the convergence of the Sakawa-Shindo algorithm in stochastic control. Mathematical Control & Related Fields, 2016, 6 (3) : 391-406. doi: 10.3934/mcrf.2016008 [10] Meng Ding, Ting-Zhu Huang, Xi-Le Zhao, Michael K. Ng, Tian-Hui Ma. Tensor train rank minimization with nonlocal self-similarity for tensor completion. Inverse Problems & Imaging, 2021, 15 (3) : 475-498. doi: 10.3934/ipi.2021001 [11] Melis Alpaslan Takan, Refail Kasimbeyli. Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems. Journal of Industrial & Management Optimization, 2021, 17 (4) : 2073-2095. doi: 10.3934/jimo.2020059 [12] Charles Fulton, David Pearson, Steven Pruess. Characterization of the spectral density function for a one-sided tridiagonal Jacobi matrix operator. Conference Publications, 2013, 2013 (special) : 247-257. doi: 10.3934/proc.2013.2013.247 [13] Xiaomao Deng, Xiao-Chuan Cai, Jun Zou. A parallel space-time domain decomposition method for unsteady source inversion problems. Inverse Problems & Imaging, 2015, 9 (4) : 1069-1091. doi: 10.3934/ipi.2015.9.1069 [14] Lars Grüne, Luca Mechelli, Simon Pirkelmann, Stefan Volkwein. Performance estimates for economic model predictive control and their application in proper orthogonal decomposition-based implementations. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021013 [15] Yuri Fedorov, Božidar Jovanović. Continuous and discrete Neumann systems on Stiefel varieties as matrix generalizations of the Jacobi–Mumford systems. Discrete & Continuous Dynamical Systems, 2021, 41 (6) : 2559-2599. doi: 10.3934/dcds.2020375 [16] F.J. Herranz, J. de Lucas, C. Sardón. Jacobi--Lie systems: Fundamentals and low-dimensional classification. Conference Publications, 2015, 2015 (special) : 605-614. doi: 10.3934/proc.2015.0605 [17] Emily McMillon, Allison Beemer, Christine A. Kelley. Extremal absorbing sets in low-density parity-check codes. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021003 [18] Jan Rychtář, Dewey T. Taylor. Moran process and Wright-Fisher process favor low variability. Discrete & Continuous Dynamical Systems - B, 2021, 26 (7) : 3491-3504. doi: 10.3934/dcdsb.2020242 [19] Demetres D. Kouvatsos, Jumma S. Alanazi, Kevin Smith. A unified ME algorithm for arbitrary open QNMs with mixed blocking mechanisms. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 781-816. doi: 10.3934/naco.2011.1.781 [20] Ashkan Ayough, Farbod Farhadi, Mostafa Zandieh, Parisa Rastkhadiv. Genetic algorithm for obstacle location-allocation problems with customer priorities. Journal of Industrial & Management Optimization, 2021, 17 (4) : 1753-1769. doi: 10.3934/jimo.2020044

Impact Factor: