{"corpus_id":182191967,"paper_sha":"ee3034547d5a9417920e2786ffa7398c6e94f89a","doi":"10.1109/TEVC.2019.2918140","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2946739419,"dblp_id":"journals/tec/TianZWJ20","acl_id":null,"title":"An Evolutionary Algorithm for Large-Scale Sparse Multiobjective Optimization Problems","year":2020,"publication_date":"2020-04-01","venue":"IEEE Transactions on Evolutionary Computation","journal":{"name":"IEEE Transactions on Evolutionary Computation","pages":"380-393","volume":"24"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science"],"reference_count":86,"citation_count":334,"influential_citation_count":31,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://openresearch.surrey.ac.uk/view/delivery/44SUR_INST/12139776710002346/13140562420002346","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/ee3034547d5a9417920e2786ffa7398c6e94f89a","s2_open_access_license":null,"s2_open_access_status":"GREEN","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"In the last two decades, a variety of different types of multiobjective optimization problems (MOPs) have been extensively investigated in the evolutionary computation community. However, most existing evolutionary algorithms encounter difficulties in dealing with MOPs whose Pareto optimal solutions are sparse (i.e., most decision variables of the optimal solutions are zero), especially when the number of decision variables is large. Such large-scale sparse MOPs exist in a wide range of applications, for example, feature selection that aims to find a small subset of features from a large number of candidate features, or structure optimization of neural networks whose connections are sparse to alleviate overfitting. This paper proposes an evolutionary algorithm for solving large-scale sparse MOPs. The proposed algorithm suggests a new population initialization strategy and genetic operators by taking the sparse nature of the Pareto optimal solutions into consideration, to ensure the sparsity of the generated solutions. Moreover, this paper also designs a test suite to assess the performance of the proposed algorithm for large-scale sparse MOPs. The experimental results on the proposed test suite and four application examples demonstrate the superiority of the proposed algorithm over seven existing algorithms in solving large-scale sparse MOPs.","claims":[{"public_id":"cl_95198e46eff8e62c836a434766c09827","status":"active","text":"A new evolutionary algorithm is proposed for solving large-scale sparse multiobjective optimization problems.","confidence":0.99,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_95198e46eff8e62c836a434766c09827"},{"public_id":"cl_863b7989d77ca507185fcfad82316e0b","status":"active","text":"A new population initialization strategy and genetic operators are designed to account for the sparse nature of Pareto optimal solutions and preserve sparsity in generated solutions.","confidence":0.97,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_863b7989d77ca507185fcfad82316e0b"},{"public_id":"cl_b8d44ac9e775bee6f2628dd4e4f226c1","status":"active","text":"A test suite is designed to assess performance on large-scale sparse multiobjective optimization problems.","confidence":0.96,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_b8d44ac9e775bee6f2628dd4e4f226c1"},{"public_id":"cl_526ec5e9c1a0033b3c47428c439747bc","status":"active","text":"Experimental results on the test suite and four application examples show the proposed algorithm outperforms seven existing algorithms.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_526ec5e9c1a0033b3c47428c439747bc"}],"concepts":[{"public_id":"co_126b8453019abe0db74c52519f67ed66","status":"active","name":"sparse nature of the Pareto optimal solutions","description":"The property that optimal solutions have most decision variables equal to zero.","types":["property"],"aliases":["sparsity of Pareto optimal solutions"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_126b8453019abe0db74c52519f67ed66"},{"public_id":"co_345982419354dbccc3c8d927da544b8f","status":"active","name":"population initialization strategy","description":"A procedure for generating the initial population used by the evolutionary algorithm.","types":["method component"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_345982419354dbccc3c8d927da544b8f"},{"public_id":"co_46bfdace17adb67c99b9142232dc299d","status":"active","name":"large-scale sparse multiobjective optimization problems","description":"Multiobjective optimization problems with many decision variables and Pareto-optimal solutions that contain mostly zeros.","types":["problem"],"aliases":["large-scale sparse MOPs","sparse MOPs"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_46bfdace17adb67c99b9142232dc299d"},{"public_id":"co_627c9c1de995a097c08a725faf6a987a","status":"active","name":"seven existing algorithms","description":"Seven previously published algorithms used as comparison methods.","types":["baseline"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_627c9c1de995a097c08a725faf6a987a"},{"public_id":"co_7864bcd009f21452fb52d916964c37ce","status":"active","name":"genetic operators","description":"Variation and recombination operations applied during evolutionary search.","types":["method component"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_7864bcd009f21452fb52d916964c37ce"},{"public_id":"co_8149fab95b512876957660f527cd7483","status":"active","name":"test suite","description":"A set of benchmark problems constructed to evaluate algorithms on large-scale sparse multiobjective optimization.","types":["evaluation resource"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_8149fab95b512876957660f527cd7483"},{"public_id":"co_c8ceaa1a44f0bec065041c7a1a4cc54f","status":"active","name":"evolutionary algorithm","description":"An optimization method that uses evolutionary computation principles such as selection, mutation, and recombination.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_c8ceaa1a44f0bec065041c7a1a4cc54f"},{"public_id":"co_de265bb41095177b8d3f7a0b967b7e64","status":"active","name":"four application examples","description":"Four example application settings used to demonstrate the algorithm on practical sparse optimization tasks.","types":["application setting"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_de265bb41095177b8d3f7a0b967b7e64"}],"external_ids":{"DOI":"10.1109/TEVC.2019.2918140","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2946739419,"DBLP":"journals/tec/TianZWJ20","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://openresearch.surrey.ac.uk/view/delivery/44SUR_INST/12139776710002346/13140562420002346","landing_url":"https://www.semanticscholar.org/paper/ee3034547d5a9417920e2786ffa7398c6e94f89a","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":null,"status":"GREEN","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":633668,"paper_uid":"07038d65-bcc1-483c-b206-102af43df18d","canonical_identity":{"paper_id":633668,"paper_uid":"07038d65-bcc1-483c-b206-102af43df18d","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/182191967"}