Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Do, Anh Viet, Neumann, Frank
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Neural and Evolutionary Computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Do, Anh Viet
Neumann, Frank
description In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against the classical GREEDY algorithm with restart strategy.
doi_str_mv 10.48550/arxiv.2012.08738
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2012_08738</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2012_08738</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-dca2fff38640b52d2622943996e94680f827f65f7c231ac484637f975a70d5c13</originalsourceid><addsrcrecordid>eNotj8tKxDAYRrNxIaMP4Mq8QGuae5ZSrzAyQmdf_kkT_GHaDGm8jE-v1ll9cOA7cAi5algtrVLsBvIXftScNbxm1gh7TrpXyKEkujkUHPEbCqaJxpRp976bQ6Fd2Ae_wE8sb_TuOMGInv6-Ci74BUpOONA2TXPJgFOZL8hZhP0cLk-7ItuH-237VK03j8_t7boCbWw1eOAxRmG1ZDvFB645d1I4p4OT2rJouYlaReO5aMBLK7Uw0RkFhg3KN2JFrv-1S1V_yDhCPvZ_df1SJ34Ap1JKpg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints</title><source>arXiv.org</source><creator>Do, Anh Viet ; Neumann, Frank</creator><creatorcontrib>Do, Anh Viet ; Neumann, Frank</creatorcontrib><description>In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against the classical GREEDY algorithm with restart strategy.</description><identifier>DOI: 10.48550/arxiv.2012.08738</identifier><language>eng</language><subject>Computer Science - Neural and Evolutionary Computing</subject><creationdate>2020-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2012.08738$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.08738$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Do, Anh Viet</creatorcontrib><creatorcontrib>Neumann, Frank</creatorcontrib><title>Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints</title><description>In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against the classical GREEDY algorithm with restart strategy.</description><subject>Computer Science - Neural and Evolutionary Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tKxDAYRrNxIaMP4Mq8QGuae5ZSrzAyQmdf_kkT_GHaDGm8jE-v1ll9cOA7cAi5algtrVLsBvIXftScNbxm1gh7TrpXyKEkujkUHPEbCqaJxpRp976bQ6Fd2Ae_wE8sb_TuOMGInv6-Ci74BUpOONA2TXPJgFOZL8hZhP0cLk-7ItuH-237VK03j8_t7boCbWw1eOAxRmG1ZDvFB645d1I4p4OT2rJouYlaReO5aMBLK7Uw0RkFhg3KN2JFrv-1S1V_yDhCPvZ_df1SJ34Ap1JKpg</recordid><startdate>20201215</startdate><enddate>20201215</enddate><creator>Do, Anh Viet</creator><creator>Neumann, Frank</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20201215</creationdate><title>Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints</title><author>Do, Anh Viet ; Neumann, Frank</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-dca2fff38640b52d2622943996e94680f827f65f7c231ac484637f975a70d5c13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Neural and Evolutionary Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Do, Anh Viet</creatorcontrib><creatorcontrib>Neumann, Frank</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Do, Anh Viet</au><au>Neumann, Frank</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints</atitle><date>2020-12-15</date><risdate>2020</risdate><abstract>In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has been shown to be effective on such problems. Our analysis departs from singular constraint problems and extends to problems of multiple constraints. We show that previous results of POMC's performance also hold for multiple constraints. Our experimental investigations on random undirected maxcut problems demonstrate POMC's competitiveness against the classical GREEDY algorithm with restart strategy.</abstract><doi>10.48550/arxiv.2012.08738</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2012.08738
ispartof
issn
language eng
recordid cdi_arxiv_primary_2012_08738
source arXiv.org
subjects Computer Science - Neural and Evolutionary Computing
title Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T14%3A54%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Pareto%20Optimization%20for%20Subset%20Selection%20with%20Dynamic%20Partition%20Matroid%20Constraints&rft.au=Do,%20Anh%20Viet&rft.date=2020-12-15&rft_id=info:doi/10.48550/arxiv.2012.08738&rft_dat=%3Carxiv_GOX%3E2012_08738%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true